[Lecture Notes in Computer Science] Evolutionary Computation in Combinatorial Optimization Volume 7245 || Iterated Greedy Algorithms for the Maximal Covering Location Problem

✍ Scribed by Hao, Jin-Kao; Middendorf, Martin

• Book ID: 121082978
• Publisher: Springer Berlin Heidelberg
• Year: 2012
• Tongue: English
• Weight: 182 KB
• Edition: 1
• Category: Article
• ISBN: 3642291244
• DOI: 10.1007/978-3-642-29124-1_15

✦ Synopsis

This book constitutes the refereed proceedings of the 12th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2012, held in Málaga, Spain, in April 2012, colocated with the Evo* 2012 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. . The 22 revised full papers presented were carefully reviewed and selected from 48 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, economic, 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.