Evolutionary Computation in Combinatorial Optimization
19th European Conference, EvoCOP 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24-26, 2019, Proceedings
Herausgegeben: Liefooghe, Arnaud; Paquete, Luís
PAYBACK Punkte
19 °P sammeln!
This book constitutes the refereed proceedings of the 19th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2019, held as part of Evo_ 2019, in Leipzig, Germany, in April 2019, co-located with the Evo_ 2019 events EuroGP, EvoMUSART and EvoApplications.The 14 revised full papers presented were carefully reviewed and selected from 37 submissions. The papers cover a wide spectrum of topics, ranging from the foundations of evolutionary computation algorithms and other search heuristics to their accurate design and application to both single- and multi-objective...
This book constitutes the refereed proceedings of the 19th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2019, held as part of Evo_ 2019, in Leipzig, Germany, in April 2019, co-located with the Evo_ 2019 events EuroGP, EvoMUSART and EvoApplications.
The 14 revised full papers presented were carefully reviewed and selected from 37 submissions. The papers cover a wide spectrum of topics, ranging from the foundations of evolutionary computation algorithms and other search heuristics to their accurate design and application to both single- and multi-objective combinatorial optimization problems. Fundamental and methodological aspects deal with runtime analysis, the structural properties of fitness landscapes, the study of metaheuristics core components, the clever design of their search principles, and their careful selection and configuration. Applications cover domains such as scheduling, routing, partitioning and general graph problems.
The 14 revised full papers presented were carefully reviewed and selected from 37 submissions. The papers cover a wide spectrum of topics, ranging from the foundations of evolutionary computation algorithms and other search heuristics to their accurate design and application to both single- and multi-objective combinatorial optimization problems. Fundamental and methodological aspects deal with runtime analysis, the structural properties of fitness landscapes, the study of metaheuristics core components, the clever design of their search principles, and their careful selection and configuration. Applications cover domains such as scheduling, routing, partitioning and general graph problems.
Andere Kunden interessierten sich für
