Evolutionary Computation in Combinatorial Optimization: 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings
This book constitutes the refereed proceedings of the 6th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2006, held in Budapest, Hungary in April 2006. The 24 revised full papers presented were carefully reviewed and selected from 77 submissions. The papers include coverage of evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, and memetic algorithms.
Search in google:
This book constitutes the refereed proceedings of the 6th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2006, held in Budapest, Hungary in April 2006.The 24 revised full papers presented were carefully reviewed and selected from 77 submissions. The papers cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, variable neighborhood search, greedy randomized adaptive search procedures, ant colony optimization, and particle swarm optimization algorithms. The papers deal with representations, heuristics, analysis of problem structures, and comparisons of algorithms. The list of studied combinatorial optimization problems includes prominent examples like graph coloring, knapsack problems, the traveling salesperson problem, scheduling, graph matching, as well as specific real-world problems.
Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem1The trade off between diversity and quality for multi-objective workforce scheduling13Evolving the structure of the particle swarm optimization algorithms25A tabu search algorithm for optimization of gas distribution networks37Design of a retail chain stocking up policy with a hybrid evolutionary algorithm49Parametrized GRASP heuristics for three-index assignment61A memetic algorithm with bucket elimination for the still life problem73Effects of scale-free and small-world topologies on binary coded self-adaptive CEA86Particle swarm for the traveling salesman problem99Hierarchical cellular genetic algorithm111Improving graph colouring algorithms and heuristics using a novel representation123Minimizing makespan on a single batch processing machine with non-identical job sizes : a hybrid genetic approach135A relation-algebraic view on evolutionary algorithms for some graph problems147New computational results for the nurse scheduling problem : a scatter search algorithm159Fast EAX algorithm considering population diversity for traveling salesman problems171A memetic algorithm with population management (MA\|PM) for the capacitated location-routing problem183The core concept for the multidimensional knapsack problem195Multiobjective scheduling of jobs with incompatible families on parallel batch machines209A memetic algorithm for the biobjective minimum spanning tree problem222A comparative study of ant colony optimization and reactive search for graph matching problems234Divide-and-evolve : a new memetic scheme for domain-independent temporal planning247A variable neighbourhood search algorithm for job shop scheduling problems261An efficient hybrid search algorithm for various optimization problems272A hybrid VNS/tabu search algorithm for apportioning the European parliament284
