Evolutionary Computation in Combinatorial Optimization: 17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings

✍ Scribed by Bin Hu, Manuel López-Ibáñez (eds.)

• Publisher: Springer International Publishing
• Year: 2017
• Tongue: English
• Leaves: 261
• Series: Lecture Notes in Computer Science 10197
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages I-XII
A Computational Study of Neighborhood Operators for Job-Shop Scheduling Problems with Regular Objectives....Pages 1-17
A Genetic Algorithm for Multi-component Optimization Problems: The Case of the Travelling Thief Problem....Pages 18-29
A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search....Pages 30-43
A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling....Pages 44-59
Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?....Pages 60-74
Decomposing SAT Instances with Pseudo Backbones....Pages 75-90
Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control....Pages 91-107
Estimation of Distribution Algorithms for the Firefighter Problem....Pages 108-123
LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows....Pages 124-140
Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO....Pages 141-156
Optimizing Charging Station Locations for Electric Car-Sharing Systems....Pages 157-172
Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier....Pages 173-188
Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants....Pages 189-200
The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches....Pages 201-214
Towards Landscape-Aware Automatic Algorithm Configuration: Preliminary Experiments on Neutral and Rugged Landscapes....Pages 215-232
Understanding Phase Transitions with Local Optima Networks: Number Partitioning as a Case Study....Pages 233-248
Back Matter....Pages 249-249

✦ Subjects

Numeric Computing;Algorithm Analysis and Problem Complexity;Discrete Mathematics in Computer Science;Computation by Abstract Devices;Artificial Intelligence (incl. Robotics)