Peter I. Cowling & Peter Merz 
Evolutionary Computation in Combinatorial Optimization [PDF ebook] 
10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010, Proceedings

Support
€79.72
méthodes de payement

Table des matières

Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling.- Heuristic and Exact Methods for the Discrete (r p)-Centroid Problem.- On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme.- A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study.- Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems.- A Genetic Algorithm to Minimize Chromatic Entropy.- Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings.- A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks.- Ant Colony Optimization for Tree Decompositions.- Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times.- Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures.- Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systems.- The Office-Space-Allocation Problem in Strongly Hierarchized Organizations.- A Study of Memetic Search with Multi-parent Combination for UBQP.- Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing.- A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centres.- Geometric Generalization of the Nelder-Mead Algorithm.- Guided Ejection Search for the Pickup and Delivery Problem with Time Windows.- An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principles.- Multilevel Variable Neighborhood Search for Periodic Routing Problems.- Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive.- A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem.- Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem.- Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem.

Achetez cet ebook et obtenez-en 1 de plus GRATUITEMENT !
Langue Anglais ● Format PDF ● Pages 290 ● ISBN 9783642121395 ● Éditeur Peter I. Cowling & Peter Merz ● Maison d’édition Springer Berlin ● Lieu Heidelberg ● Pays DE ● Publié 2010 ● Téléchargeable 24 mois ● Devise EUR ● ID 2171768 ● Protection contre la copie Adobe DRM
Nécessite un lecteur de livre électronique compatible DRM

Plus d’ebooks du même auteur(s) / Éditeur

16 795 Ebooks dans cette catégorie