Evolutionary Computation In Combinatorial Optimization 9th European Conference

Metaheuristics Have Been Shown To Be E?ective For Di?cult Combinatorial Op- Mization Problems Appearing In A Wide Variety Of Industrial, Economic, And Sci- Ti?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 Problem, Packing And Cutting, Satis?ability, And General Mixed Integer Programming.