Evolutionary Computation in Combinatorial Optimization

Carlos Cotta

ISBN 10: 3540786031 / ISBN 13: 9783540786030

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2008, 2008

About this Item

Neuware -Metaheuristics have been shown to be e ective for di cult combinatorial - timization problems appearing in various industrial, economical, 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, network design, transportation and distribution, vehicle routing, the travelling salesman pr- lem, packing and cutting, satis ability and general mixed integer programming. EvoCOPbeganin2001andhasbeenheldannuallysincethen.Itwasthe 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, EvoCOP has broadened its scope over the last years and invited submissions on any kind of metaheuristic for combinatorial optimization. 304 pp. Englisch.

Seller Inventory # 9783540786030

Bibliographic Details

• Title: Evolutionary Computation in Combinatorial Optimization
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2008
• Publication Date: 2008
• Language: English
• ISBN 10: 3540786031
• ISBN 13: 9783540786030
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

This book constitutes the refereed proceedings of the 8th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2008, held in Naples, Italy, in March 2008. The 24 revised full papers presented were carefully reviewed and 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 randomized adaptive search procedures, estimation of distribution algorithms and ant colony optimization.