This book constitutes the refereed proceedings of the 10th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2010, held in Instanbul, Turkey, in April 2010. The 24 revised full papers presented were carefully reviewed an selected from 69 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy radomized adaptive search procedures, estimation of distribution algorithms and ant colony opitmization.
Author(s): Salwani Abdullah, Khalid Shaker (auth.), Peter Cowling, Peter Merz (eds.)
Series: Lecture Notes in Computer Science 6022 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010
Language: English
Pages: 290
Tags: Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Pattern Recognition; Image Processing and Computer Vision; Discrete Mathematics in Computer Science
Front Matter....Pages -
Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling....Pages 1-10
Heuristic and Exact Methods for the Discrete ( r | p )-Centroid Problem....Pages 11-22
On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme....Pages 23-34
A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study....Pages 35-46
Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems....Pages 47-58
A Genetic Algorithm to Minimize Chromatic Entropy....Pages 59-70
Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings....Pages 71-82
A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks....Pages 83-94
Ant Colony Optimization for Tree Decompositions....Pages 95-106
Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times....Pages 107-118
Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures....Pages 119-130
Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systems....Pages 131-142
The Office-Space-Allocation Problem in Strongly Hierarchized Organizations....Pages 143-153
A Study of Memetic Search with Multi-parent Combination for UBQP....Pages 154-165
Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing....Pages 166-177
A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centres....Pages 178-189
Geometric Generalization of the Nelder-Mead Algorithm....Pages 190-201
Guided Ejection Search for the Pickup and Delivery Problem with Time Windows....Pages 202-213
An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principles....Pages 214-225
Multilevel Variable Neighborhood Search for Periodic Routing Problems....Pages 226-238
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive....Pages 239-251
A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem....Pages 252-263
Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem....Pages 264-275
Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem....Pages 276-287
Back Matter....Pages -
