Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008

Carlos Cotta, Jano I. van Hemert (Eds.): Recent Advances in Evolutionary Computation for Combinatorial Optimization. Studies in Computational Intelligence Vol. 153 Springer 2008, ISBN 978-3-540-70806-3

Theory and Methodology

Matthew J. Craven:
An Evolutionary Algorithm for the Solution of Two-Variable Word Equations in Partially Commutative Groups. 3-19
Enda Ridge, Daniel Kudenko:
Determining Whether a Problem Characteristic Affects Heuristic Performance. 21-35
Hernán E. Aguirre, Kiyoshi Tanaka:
Performance and Scalability of Genetic Algorithms on NK-Landscapes. 37-52
Prasanna Balaprakash, Mauro Birattari, Thomas Stützle:
Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem. 53-66

Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger:
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. 69-85
Napoleão Nepomuceno, Plácido Rogério Pinheiro, André L. V. Coelho:
A Hybrid Optimization Framework for Cutting and Packing Problems. 87-99
Enrique Alba, Gabriel Luque:
A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem. 101-112
Ferrante Neri, Niko Kotilainen, Mikko Vapa:
A Memetic-Neural Approach to Discover Resources in P2P Networks. 113-129

Nysret Musliu:
An Iterative Heuristic Algorithm for Tree Decomposition. 133-150
Francisco Luna, Enrique Alba, Antonio J. Nebro, Salvador Pedraza:
Search Intensification in Metaheuristics for Solving the Automatic Frequency Problem in GSM. 151-166
István Juhos, Jano I. van Hemert:
Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem. 167-184

Francisco Ballestín:
Different Codifications and Metaheuristic Algorithms for the Resource Renting Problem with Minimum and Maximum Time Lags. 187-202
Susana Fernandes, Helena R. Lourenço:
A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem. 203-218
Fatos Xhafa, Bernat Duran:
Parallel Memetic Algorithms for Independent Job Scheduling in Computational Grids. 219-239

Thomas Fischer, Peter Merz:
Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges. 243-258
Vittorio Maniezzo, Matteo Roffilli:
Algorithms for Large Directed Capacitated Arc Routing Problem Instances. 259-274
Nacima Labadi, Christian Prins, Mohamed Reghioui:
An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem. 275-294
Bryant A. Julstrom:
A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem. 295-307

Last update Tue Feb 14 03:46:38 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page