| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910337847703321 |
|
|
Titolo |
Evolutionary Computation in Combinatorial Optimization : 19th European Conference, EvoCOP 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24–26, 2019, Proceedings / / edited by Arnaud Liefooghe, Luís Paquete |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2019.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIV, 213 p. 55 illus., 32 illus. in color.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 11452 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Numerical analysis |
Algorithms |
Artificial intelligence |
Computer science—Mathematics |
Discrete mathematics |
Artificial intelligence—Data processing |
Numerical Analysis |
Artificial Intelligence |
Discrete Mathematics in Computer Science |
Data Science |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
| |