Anmerkung: Intro -- Preface -- Organization -- Table of Contents -- A Pre-processing Aware RINS Based MIP Heuristic -- 1 Introduction -- 2 Literature Review -- 3 The pRINS MIP Heuristic -- 4 Characterization of Instances -- 5 Experiments and Results -- 6 FinalRemarks -- References -- A Hybrid Simulated Annealing Algorithm for Location of Cross-Docking Centers in a Supply Chain -- 1 Introduction -- 2 Problem Description and Formulation -- 2.1 Proposed Model -- 3 Proposed Hybrid Meta-heuristic Algorithm -- 4 Computational Results -- 5 Conclusion -- References -- Intensification/Diversification in Decomposition Guided VNS -- 1 Introduction -- 2 Context and Definitions -- 2.1 Cost Functions Network -- 2.2 Tree Decomposition -- 2.3 Decomposition Guided VNS (DGVNS) -- 3 Strategies for Intensification/Diversification in -- 3.1 Intensification versus Diversification -- 3.2 DGVNS-1: Move Systematically to the Next Cluster -- 3.3 DGVNS-2: Move to the Next Cluster If No Improvement Is Made -- 3.4 DGVNS-3: Move to the Next Cluster after Each Improvement -- 4 Benchmark Problems -- 5 Experiments -- 5.1 Experimental Protocol -- 5.2 Comparing the Three Strategies -- 5.3 Comparing with Other Approaches -- 6 Conclusions -- References -- A Hybridized Particle Swarm Optimization with Expanding Neighborhood Topology for the Feature Selection Problem -- 1 Introduction -- 2 Feature Selection Problem -- 3 Particle Swarm Optimization with Expanding Neighborhood Topology Algorithm -- 3.1 General Description -- 4 Computational Results -- 5 Conclusions -- References -- Interleaving Constraint Propagation: An Efficient Cooperative Search with Branch and Bound -- 1 Introduction -- 2 Cooperative Search Framework -- 2.1 The SOLVE Component -- 2.2 The OBSERVATION Component -- 2.3 The ANALYSE Component -- 2.4 The UPDATE Component -- 3 B& -- B + Constraint Propagation Solver. , 3.1 Basic Hybridization -- 3.2 Hybridization Based on Propagation Rate -- 4 Conclusion -- References -- Automatic Tuning of GRASP with Evolutionary Path-Relinking -- 1 Introduction -- 2 GRASP with Evolutionary Path-Relinking -- 3 Automatic Tuning Using a BRKGA -- 3.1 Encoding and Decoding -- 4 GRASP+evPR for Three Optimization Problems -- 4.1 Set Covering -- 4.2 Maximum Cut -- 4.3 Node Capacitated Graph Partitioning -- 5 Experimental Results -- 5.1 Instances -- 5.2 The Experiments -- 6 Concluding Remarks -- References -- Combining Genetic Algorithm and Simulated Annealing Methods for Reconstructing HV-Convex Binary Matrices -- 1 Introduction -- 2 Preliminaries -- 3 HV-ConvexBinaryMatrix -- 3.1 Definitions -- 3.2 Integer Programming Formulation -- 3.3 Bounds -- 4 Simulated Annealing -- 4.1 Overview -- 4.2 Simulated Annealing for RBM(H,V) -- 5 Genetic Algorithm -- 5.1 Overview -- 5.2 Genetic Algorithm for RBM(H,V) -- 6 Combining GA and SA Algorithm (GASA) for -- 6.1 GASA Algorithm -- 7 Computational Results -- 7.1 Choice of the Parameters -- 7.2 Results -- 8 Conclusion -- References -- Experimental Analysis of Pheromone-Based Heuristic Column Generation Using irace -- 1 Introduction -- 2 Vehicle Routing Problems with Black Box Feasibility -- 2.1 The Capacitated Vehicle Routing Problem and Black-Box Feasibility -- 2.2 Applications of the VRPBB -- 3 Pheromone-Based Heuristic Column Generation for the VRPBB -- 3.1 Reformulation as Set Partitioning Problem -- 3.2 Pheromone-Based Heuristic Column Generation (ACO-HCG) -- 4 Experimental Setup -- 5 Experimental Results -- 5.1 Manual vs. Automatic Parameter Configurations -- 5.2 Experimental Analysis of the ACO-HCG Parameters -- 6 Conclusion -- References -- A New Hybrid Metaheuristic - Combining Stochastic Tunneling and Energy Landscape Paving -- 1 Introduction -- 1.1 Previous Work. , 1.2 Our Contribution: Synergistically Combining STUN and ELP -- 2 A Combined Algorithm -- 3 A Test Instance -- 4 Results -- 4.1 Performance Benchmarking - Quality of Solutions -- 4.2 Statistical Properties of Search Dynamics -- 4.3 Sensitivity Analysis to -- Choices -- 5 Conclusions -- References -- Workgroups Diversity Maximization: A Metaheuristic Approach -- 1 Introduction -- 2 A Mathematical Model for the Workgroup Diversity Problem -- 3 A Pool-Based Metaheuristic Algorithm -- 4 Computational Results and Statistical Analysis -- 5 Conclusions and Future Work -- References -- Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations -- 1 Introduction -- 2 Problem Definition -- 3 Variable Neighborhood Search for BBSS -- 3.1 VND Neighborhood Structures -- 3.2 VNS Neighborhoods Structures -- 4 Maximum Flow Based Method for the General Case -- 5 Combined Approach -- 6 Computational Results -- 7 Conclusions and Future Work -- References -- Automatic Design of Hybrid Stochastic Local Search Algorithms -- 1 Introduction -- 2 Generalized Local Search Structure -- 3 Implementation -- 3.1 A Practical Implementation of the GLS Structure -- 3.2 A Grammar Description of the GLS Structure -- 3.3 Automatic Generation of Hybrid LS Metaheuristics -- 4 Experimental Setup -- 4.1 The PFSP-WT -- 4.2 Local Search Components for the PFSP-WT -- 4.3 Experimental Protocol -- 5 Experimental Results -- 6 Conclusion -- References -- GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem -- 1 Introduction -- 2 The Virtual Network Mapping Problem -- 3 Background and Related Work -- 4 GRASP -- 5 VNS -- 6 Results -- 6.1 GRASP -- 6.2 VNS -- 6.3 Comparison -- 7 Conclusions -- References -- Hybrid Metaheuristics for the Far From Most String Problem -- 1 The Far From Most String Problem (FFMSP). , 2 Hybrid Metaheuristics -- 2.1 A Pure GRASP -- 2.2 A Pure VNS -- 2.3 Path-Relinking -- 2.4 Hybrid GRASP with Path-Relinking -- 2.5 Hybrid GRASP with VNS -- 2.6 Hybrid VNS with Path-Relinking -- 2.7 Hybrid GRASP with VNS and Path-Relinking -- 3 Experimental Results -- 4 Concluding Remarks and Future Work -- References -- On Missing Data Hybridizations for Dimensionality Reduction -- 1 Introduction -- 2 Unsupervised Nearest Neighbors -- 2.1 Unsupervised Regression -- 2.2 Iterative Unsupervised Regression -- 2.3 Latent Sorting -- 3 Missing Data -- 3.1 Repair-and-Embed -- 3.2 Embed-and-Repair -- 4 Experimental Comparison of Missing Data Methods -- 5 Conclusions -- References -- A Hybrid ACO+CP for Balancing Bicycle Sharing Systems -- 1 Introduction -- 2 Related Work -- 3 A Constraint Model for BBSP -- 3.1 Variables -- 3.2 Constraints -- 4 AnACO+CPHybrid -- 4.1 ACO+CP for BBSP -- 5 Experimental Analysis -- 6 Conclusions and Future Work -- References -- Author Index.