+612 9045 4394
 
CHECKOUT
Evolutionary Computation in Combinatorial Optimization : 10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010, Proceedings - Peter I. Cowling

Evolutionary Computation in Combinatorial Optimization

10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010, Proceedings

By: Peter I. Cowling (Editor), Peter Merz (Editor)

Paperback

Published: 25th March 2010
Ships: 15 business days
15 business days
$135.90
or 4 easy payments of $33.98 with Learn more

Metaheuristicscontinuetodemonstratetheire?ectivenessforanever-broadening range of di?cult combinatorial optimization problems appearing in a wide - riety of industrial, economic, and scienti?c domains. Prominent examples of metaheuristics are evolutionary algorithms, tabu search, simulated annealing, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, ant colony optimization and estimation of distribution algorithms. Problems solved successfully include scheduling, timetabling, networkdesign, transportationanddistribution, vehicle routing, the travelling salesman problem, packing and cutting, satis?ability and general mixed integer programming. EvoCOP began in 2001 and has been held annually since then. It is the ?rst event speci?cally dedicated to the application of evolutionary computation and related methods to combinatorial optimization problems. Originally held as a workshop, EvoCOPbecameaconferencein2004.Theeventsgaveresearchersan excellent opportunity to present their latest research and to discuss current - velopments and applications. Following the general trend of hybrid metaheur- tics and diminishing boundaries between the di?erent classes of metaheuristics, EvoCOPhas broadenedits scope in recent years and invited submissions on any kind of metaheuristic for combinatorial optimization.

Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetablingp. 1
Heuristic and Exact Methods for the Discrete (r p)-Centroid Problemp. 11
On the Benefit of Sub-optimality within the Divide-and-Evolve Schemep. 23
A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Studyp. 35
Fitness Distance Correlation and Search Space Analysis for Permutation Based Problemsp. 47
A Genetic Algorithm to Minimize Chromatic Entropyp. 59
Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodingsp. 71
A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networksp. 83
Ant Colony Optimization for Tree Decompositionsp. 95
Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Timesp. 107
Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measuresp. 119
Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systemsp. 131
The Office-Space-Allocation Problem in Strongly Hierarchized Organizationsp. 143
A Study of Memetic Search with Multi-parent Combination for UBQPp. 154
Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealingp. 166
A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centresp. 178
Geometric Generalization of the Nelder-Mead Algorithmp. 190
Guided Ejection Search for the Pickup and Delivery Problem with Time Windowsp. 202
An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principlesp. 214
Multilevel Variable Neighborhood Search for Periodic Routing Problemsp. 226
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archivep. 239
A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problemp. 252
Local Search Algorithms on Graphics Processing Units. A Case Study:. The Permutation Perceptron Problemp. 264
Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problemp. 276
Author Indexp. 289
Table of Contents provided by Ingram. All Rights Reserved.

ISBN: 9783642121388
ISBN-10: 3642121381
Series: Theoretical Computer Science and General Issues
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 290
Published: 25th March 2010
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.37 x 15.75  x 1.78
Weight (kg): 0.48