Evolutionary Computation in Combinatorial Optimization
G nther R. Raidl (Editor), Jens GottliebBooks.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
This book constitutes the refereed proceedings of the 5th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2005, held in Lausanne, Switzerland in March/April 2005.
The 24 revised full papers presented were carefully reviewed and selected from 66 submissions. The papers cover evolutionary algorithms as well as related approaches like scatter search, simulated annealing, ant colony optimization, immune algorithms, variable neighborhood search, hyperheuristics, and estimation of distribution algorithms. The papers deal with representations, analysis of operators and fitness landscapes, and comparison algorithms. Among the combinatorial optimization problems studied are graph coloring, quadratic assignment, knapsack, graph matching, packing, scheduling, timetabling, lot-sizing, and the traveling salesman problem.
Synopsis
This book constitutes the refereed proceedings of the 5th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2005, held in Lausanne, Switzerland in March/April 2005.
The 24 revised full papers presented were carefully reviewed and selected from 66 submissions. The papers cover evolutionary algorithms as well as related approaches like scatter search, simulated annealing, ant colony optimization, immune algorithms, variable neighborhood search, hyperheuristics, and estimation of distribution algorithms. The papers deal with representations, analysis of operators and fitness landscapes, and comparison algorithms. Among the combinatorial optimization problems studied are graph coloring, quadratic assignment, knapsack, graph matching, packing, scheduling, timetabling, lot-sizing, and the traveling salesman problem.