TY - BOOK
T1 - Evolutionary Computation in Combinatorial Optimization
T2 - 21st European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2021 Held as Part of EvoStar 2021
A2 - Zarges, Christine
A2 - Verel, Sébastien
PY - 2021/3/26
Y1 - 2021/3/26
N2 - This book constitutes the refereed proceedings of the 21st European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2021, held as part of Evo*2021, as Virtual Event, in April 2021, co-located with the Evo*2021 events: EvoMUSART, EvoApplications, and EuroGP. The 14 revised full papers presented in this book were carefully reviewed and selected from 42 submissions. They cover a wide spectrum of topics, ranging from the foundations of evolutionary algorithms and other search heuristics to their accurate design and application to combinatorial optimization problems. Fundamental and methodological aspects deal with runtime analysis, the structural properties of fitness landscapes, the study of core components of metaheuristics, the clever design of their search principles, and their careful selection and configuration. Applications cover problem domains such as scheduling, routing, search-based software engineering and general graph problems. The range of topics covered in this volume reflects the current state of research in the fields of evolutionary computation and combinatorial optimization.
AB - This book constitutes the refereed proceedings of the 21st European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2021, held as part of Evo*2021, as Virtual Event, in April 2021, co-located with the Evo*2021 events: EvoMUSART, EvoApplications, and EuroGP. The 14 revised full papers presented in this book were carefully reviewed and selected from 42 submissions. They cover a wide spectrum of topics, ranging from the foundations of evolutionary algorithms and other search heuristics to their accurate design and application to combinatorial optimization problems. Fundamental and methodological aspects deal with runtime analysis, the structural properties of fitness landscapes, the study of core components of metaheuristics, the clever design of their search principles, and their careful selection and configuration. Applications cover problem domains such as scheduling, routing, search-based software engineering and general graph problems. The range of topics covered in this volume reflects the current state of research in the fields of evolutionary computation and combinatorial optimization.
KW - artificial intelligence
KW - automatic algorithm configuration
KW - combinatorial mathematics
KW - combinatorial optimization
KW - combinatorial problems
KW - evolutionary algorithms
KW - genetic algorithms heuristic methods
KW - local optima
KW - metaheuristics
KW - multi-objective optimization
KW - particle swarm optimization
KW - problem solving
KW - runtime analysis
KW - search spaces
KW - simulated annealing stochastic local search
KW - mathematics
KW - optimization problems
KW - swarm intelligence
U2 - 10.1007/978-3-030-72904-2
DO - 10.1007/978-3-030-72904-2
M3 - Edited book
SN - 978-3-030-72903-5
T3 - Lecture Notes in Computer Science
BT - Evolutionary Computation in Combinatorial Optimization
PB - Springer Nature
Y2 - 7 April 2021 through 9 April 2021
ER -