Evolutionary Computation in Combinatorial Optimization

1. Front Matter

   Pages i-xiv

   PDF

2. A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications

   • Thomas Jatschka, Tobias Rodemann, Günther R. Raidl

   Pages 1-16

3. A Binary Algebraic Differential Evolution for the MultiDimensional Two-Way Number Partitioning Problem

   • Valentino Santucci, Marco Baioletti, Gabriele Di Bari, Alfredo Milani

   Pages 17-32

4. A New Representation in Genetic Programming for Evolving Dispatching Rules for Dynamic Flexible Job Shop Scheduling

   • Fangfang Zhang, Yi Mei, Mengjie Zhang

   Pages 33-49

5. An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant Processing Times on One Machine

   • Hoang Thanh Le, Philine Geser, Martin Middendorf

   Pages 50-65

6. Route Planning for a Fleet of Electric Vehicles with Waiting Times at Charging Stations

   • Baoxiang Li, Shashi Shekhar Jha, Hoong Chuin Lau

   Pages 66-82

7. Multiple Periods Vehicle Routing Problems: A Case Study

   • Bilal Messaoudi, Ammar Oulamara, Nastaran Rahmani

   Pages 83-98

8. Rigorous Performance Analysis of State-of-the-Art TSP Heuristic Solvers

   • Paul McMenemy, Nadarajen Veerapen, Jason Adair, Gabriela Ochoa

   Pages 99-114

9. Runtime Analysis of Discrete Particle Swarm Optimization Applied to Shortest Paths Computation

   • Alexander Raß, Jonas Schreiner, Rolf Wanka

   Pages 115-130

10. Quasi-Optimal Recombination Operator

    • Francisco Chicano, Gabriela Ochoa, Darrell Whitley, Renato Tinós

    Pages 131-146

11. Insights into the Feature Selection Problem Using Local Optima Networks

    • Werner Mostert, Katherine M. Malan, Gabriela Ochoa, Andries P. Engelbrecht

    Pages 147-162

12. Clarifying the Difference in Local Optima Network Sampling Algorithms

    • Sarah L. Thomson, Gabriela Ochoa, Sébastien Verel

    Pages 163-178

13. A Unifying View on Recombination Spaces and Abstract Convex Evolutionary Search

    • Marcos Diez García, Alberto Moraglio

    Pages 179-195

14. Program Trace Optimization with Constructive Heuristics for Combinatorial Problems

    • James McDermott, Alberto Moraglio

    Pages 196-212

15. Correction to: Evolutionary Computation in Combinatorial Optimization

    • Arnaud Liefooghe, Luís Paquete

    Pages C1-C5

16. Back Matter

    Pages 213-213

    PDF

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.

• artificial intelligence
• automatic algorithm configuration
• combinatorial mathematics
• combinatorial optimization
• combinatorial problems
• evolutionary algorithms
• genetic algorithms
• graph theory
• heuristic methods
• local optima
• metaheuristics
• particle swarm optimization (pso)
• problem solving
• routing protocols
• runtime analysis
• search spaces
• simulated annealing
• stochastic local search
• traveling salesman problem
• algorithm analysis and problem complexity
• data structures

• University of Lille, Lille, France

  Arnaud Liefooghe

• University of Coimbra, Coimbra, Portugal

  Luís Paquete

Policies and ethics