Evolutionary Computation in Combinatorial Optimization

1. Front Matter

   Pages I-XII

   PDF

2. A Computational Study of Neighborhood Operators for Job-Shop Scheduling Problems with Regular Objectives

   • Hayfa Hammami, Thomas Stützle

   Pages 1-17

3. A Genetic Algorithm for Multi-component Optimization Problems: The Case of the Travelling Thief Problem

   • Daniel K. S. Vieira, Gustavo L. Soares, João A. Vasconcelos, Marcus H. S. Mendes

   Pages 18-29

4. A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search

   • Gelareh Taghizadeh, Nysret Musliu

   Pages 30-43

5. A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling

   • Jonas Ingels, Broos Maenhout

   Pages 44-59

6. Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?

   • Evelia Lizárraga, María J. Blesa, Christian Blum

   Pages 60-74

7. Decomposing SAT Instances with Pseudo Backbones

   • Wenxiang Chen, Darrell Whitley

   Pages 75-90

8. Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control

   • Bong-Min Kim, Christian Kloimüllner, Günther R. Raidl

   Pages 91-107

9. Estimation of Distribution Algorithms for the Firefighter Problem

   • Krzysztof Michalak

   Pages 108-123

10. LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows

    • Miroslaw Blocho, Jakub Nalepa

    Pages 124-140

11. Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO

    • Luís F. Simões, Dario Izzo, Evert Haasdijk, A. E. Eiben

    Pages 141-156

12. Optimizing Charging Station Locations for Electric Car-Sharing Systems

    • Benjamin Biesinger, Bin Hu, Martin Stubenschrott, Ulrike Ritzinger, Matthias Prandtstetter

    Pages 157-172

13. Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier

    • Anton Bassin, Arina Buzdalova

    Pages 173-188

14. Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants

    • John H. Drake, Jerry Swan, Geoff Neumann, Ender Özcan

    Pages 189-200

15. The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches

    • Pedro Pinacho Davidson, Christian Blum, José A. Lozano

    Pages 201-214

16. Towards Landscape-Aware Automatic Algorithm Configuration: Preliminary Experiments on Neutral and Rugged Landscapes

    • Arnaud Liefooghe, Bilel Derbel, Sébastien Verel, Hernán Aguirre, Kiyoshi Tanaka

    Pages 215-232

17. Understanding Phase Transitions with Local Optima Networks: Number Partitioning as a Case Study

    • Gabriela Ochoa, Nadarajen Veerapen, Fabio Daolio, Marco Tomassini

    Pages 233-248

18. Back Matter

    Pages 249-249

    PDF

This book constitutes the refereed proceedings of the 17th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2017, held in Amsterdam, The Netherlands, in April 2017, co-located with the Evo*2017 events EuroGP, EvoMUSART and EvoApplications.

The 16 revised full papers presented were carefully reviewed and selected from 39 submissions. The papers cover both empirical and theoretical studies on a wide range of academic and real-world applications. The methods include evolutionary and memetic algorithms, large neighborhood search, estimation of distribution algorithms, beam search, ant colony optimization, hyper-heuristics and matheuristics. Applications include both traditional domains, such as knapsack problem, vehicle routing, scheduling problems and SAT; and newer domains such as the traveling thief problem, location planning for car-sharing systems and spacecraft trajectory optimization. Papers also study important concepts such as pseudo-backbones, phase transitions in local optima networks, and the analysis of operators. This wide range of topics makes the EvoCOP proceedings an important source for current research trends in combinatorial optimization.

• combinatorial optimization
• discrete space search
• evolutionary algorithms
• metaheuristics
• particle swarm optimisation
• algorithms
• ant colony optimization
• estimation of distribution algorithms
• graph problem
• hyper-heuristics
• linear programming
• matheuristics
• memetic algorithm
• multi-objective optimization
• optimization problems
• permutation problems
• quadratic assignment
• routing
• search methodologies
• vehicle routing

• Austrian Institute of Technology, Vienna, Austria

  Bin Hu

• University of Manchester, Manchester, United Kingdom

  Manuel López-Ibáñez

Policies and ethics