Evolutionary Computation in Combinatorial Optimization

Chapter 1 Better Runtime Guarantees via Stochastic Domination

Chapter 2 On the Fractal Nature of Local Optima Networks

Chapter 3 How Perturbation Strength Shapes the Global Structure of TSP Fitness Landscapes

Chapter 4 Worst Improvement Based Iterated Local Search

Chapter 5 Automatic Grammar-Based Design of Heuristic Algorithms for Unconstrained Binary Quadratic Programming

Chapter 6 Automatic Algorithm Configuration for the Permutation Flow Shop Scheduling Problem Minimizing Total Completion Time

Chapter 7 Data Clustering Using Grouping Hyper-heuristics

Chapter 8 Reference Point Adaption Method for Genetic Programming Hyper-Heuristic in Many-Objective Job Shop Scheduling

Chapter 9 MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutation Flowshop Scheduling Problem

Chapter 10 An Evolutionary Algorithm with Practitioner’s-Knowledge-Based Operators for the Inventory Routing Problem

Chapter 12 An Ant Colony Approach for the Winner Determination Problem

Chapter 13 Erratum to: On the Fractal Nature of Local Optima Networks