1 option
Evolutionary Computation in Combinatorial Optimization : 18th European Conference, EvoCOP 2018, Parma, Italy, April 4-6, 2018, Proceedings / edited by Arnaud Liefooghe, Manuel López-Ibáñez.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 10782
- Theoretical Computer Science and General Issues, 2512-2029 ; 10782
- Language:
- English
- Subjects (All):
- 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.
- Local Subjects:
- Numerical Analysis.
- Algorithms.
- Artificial Intelligence.
- Discrete Mathematics in Computer Science.
- Data Science.
- Physical Description:
- 1 online resource (XIV, 189 pages) : 31 illustrations
- Edition:
- 1st ed. 2018.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2018.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the 18th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2018, held in Parma, Italy, in April 2018, co-located with the Evo* 2018 events EuroGP, EvoMUSART and EvoApplications. The 12 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 by means of automatic algorithm configuration and hyper-heuristics. Applications cover conventional academic domains such as NK landscapes, binary quadratic programming, traveling salesman, vehicle routing, or scheduling problems, and also include real-world domains in clustering, commercial districting and winner determination.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-77449-7
- 9783319774497
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.