Evolutionary Computation in Combinatorial Optimization : 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008. Proceedings
Publication year: 2008
ISBN: 978-3-540-78604-7
Internet Resource: Please Login to download book
Metaheuristics have been shown to be e?ective for di?cult combinatorial - timization problems appearing in various industrial, economical, and scientifc 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, satisfability and general mixed integer programming.
Subject: Computer Science, Variable, algorithm, algorithms, combinatorial optimization, evolutionary algorithm, metaheuristic, optimization, algorithm, analysis and problem complexity, Computation by Abstract Devices, Algorithm Analysis and Problem, Complexity, Numeric Computing, Discrete Mathematics in Computer Science
