Evolutionary Computation in Combinatorial Optimization

Chapter 1 A Computational Study of Neighborhood Operators for Job-Shop Scheduling Problems with Regular Objectives

Chapter 3 A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search

Chapter 4 A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling

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

Chapter 6 Decomposing SAT Instances with Pseudo Backbones

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

Chapter 8 Estimation of Distribution Algorithms for the Firefighter Problem

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

Chapter 10 Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO

Chapter 11 Optimizing Charging Station Locations for Electric Car-Sharing Systems

Chapter 12 Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier

Chapter 13 Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants

Chapter 14 The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches

Chapter 15 Towards Landscape-Aware Automatic Algorithm Configuration: Preliminary Experiments on Neutral and Rugged Landscapes

Chapter 16 Understanding Phase Transitions with Local Optima Networks: Number Partitioning as a Case Study