Note: Intro -- Preface -- Organization -- Table of Contents -- A CP/LNS Approach for Multi-day Homecare Scheduling Problems -- 1 Introduction -- 1.1 Related Work -- 2 A Constraint Model for Homecare Activity Scheduling -- 2.1 Variables -- 2.2 Constraints -- 2.3 Branching Strategy -- 3 Hybrid Approach -- 4 Experimental Analysis -- 5 Conclusions and Future Work -- References -- A Hybrid Metaheuristic to Solve the Resource Allocation Problem in Bike Sharing Systems -- 1 Logistical Challenges in Bike Sharing Systems -- 2 Related Literature -- 3 The Resource Allocation Problem -- 4 The Hybrid Metaheuristic -- 5 Computational Study -- 6 Conclusions and Outlook -- References -- Algorithm Comparison by Automatically Configurable Stochastic Local Search Frameworks: A Case Study Using Flow-Shop Scheduling Problems -- 1 Introduction -- 2 Framework -- 3 The Permutation Flowshop Problem -- 3.1 Problem-Specific Components for the PFSP -- 4 Experimental Evaluation -- 4.1 Experimental Setup -- 4.2 Experimental Results for PFSP-WCT -- 4.3 Experimental Results for PFSP-WT -- 5 Discussion and Conclusions -- References -- A Local Search Approach for Binary Programming: Feasibility Search -- 1 Introduction -- 2 Related Works -- 3 TheBPLocalSearchSolver -- 3.1 Conflict Graphs -- 3.2 Constructive Approach -- 3.3 Local Search : Chains of Flips -- 4 Computational Experiments -- 5 Conclusions -- References -- A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs -- 1 Introduction -- 2 Partition-Based Construction Heuristic -- 2.1 Step 1: Partition -- 2.2 Step 2: Decompose -- 2.3 Step 3: Solve -- 2.4 Step 4: Repair -- 3 Partition-Based Memetic Algorithm -- 4 Computational Results -- 4.1 Evaluation of the Partitioning Algorithms -- 4.2 Comparison to Other Methods -- 5 Conclusions -- References. , A Path-Generation Matheuristic for Large Scale Evacuation Planning -- 1 Introduction -- 2 Problem Formulation -- 3 Related Work -- 4 Proposed Approaches -- 4.1 Master Problem -- 4.2 Subproblem -- 5 Computational Experiments -- 6 Conclusions -- References -- A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem -- 1 Introduction -- 2 Problem Definition -- 2.1 Solution Representation -- 3 Related Work -- 4 Variable Neighborhood Search -- 4.1 Construction Heuristics -- 4.2 Neighborhood Structures and Search -- 5 ILP-Based Very Large Neighborhood Search -- 5.1 An ILP for Packing Strips -- 5.2 Determining Strip Dimensions -- 6 Experimental Results -- 7 Conclusions -- References -- Cooperative Parallel Decomposition Guided VNS for Solving Weighted CSP -- 1 Introduction -- 2 Context and Definitions -- 2.1 Weighted CSP -- 2.2 Tree Decomposition -- 2.3 Decomposition Guided -- 3 Parallel -- 3.1 Asynchronous Master-Slave Architecture for -- 3.2 Master Algorithm -- 3.3 Slave Algorithm -- 4 Benchmark Problems -- 5 Experiments -- 5.1 Experimental Protocol -- 5.2 Contribution of the Parallelization -- 6 Conclusions -- References -- GeNePi: A Multi-Objective Machine Reassignment Algorithm for Data Centres -- 1 Introduction -- 2 Problem Definition -- 2.1 Reassignment Problem -- 2.2 Objectives -- 3 Description of Our Solution: GeNePi -- 3.1 Ge: A Variant of the Constructive Phase of GRASP -- 3.2 Ne: NSGA-II -- 3.3 Pi: A Pareto Local Search -- 4 Evaluation -- 4.1 Experimental Setups -- 4.2 Metrics -- 4.3 Algorithms -- 4.4 Tuning the Steps of GeNePi -- 4.5 Results -- 5 Conclusion -- References -- Hybrids of Integer Programming and ACO for Resource Constrained Job Scheduling -- 1 Introduction -- 2 Problem Specification -- 3 An Integer Programming Formulation -- 4 Column Generation. , 5 Lagrangian Relaxation -- 5.1 The Lagrangian Heuristic -- 6 Ant Colony Optimisation -- 6.1 Variants of CG/LR and ACO Hybrids -- 7 Experiments and Results -- 7.1 Results -- 8 Conclusion -- References -- Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem -- 1 Introduction -- 1.1 Problem Description -- 1.2 Related Work -- 1.3 Organization of the Paper -- 2 Proposed Algorithm -- 2.1 Preliminaries -- 2.2 Main Algorithm -- 3 Experimental Evaluation -- 3.1 Problem Instances -- 3.2 Algorithm Tuning -- 3.3 Numerical Results -- 4 Conclusions and Future Work -- References -- JAM: A Tabu-Based Two-Stage Simulated Annealing Algorithm for the Multidimensional Arrangement Problem -- 1 Introduction -- 1.1 Problem Definition -- 1.2 Related Work -- 1.3 Contributions -- 2 The Algorithm JAM -- 2.1 Notation -- 2.2 Overview of JAM -- 2.3 Elements of JAM -- 3 Evaluation of JAM -- 4 Conclusions -- References -- Online Performance Measures for Metaheuristic Optimization -- 1 Introduction -- 2 The Global Optimization Problem -- 2.1 Definitions -- 2.2 Practical Issues in Global Optimization -- 3 Our Contribution : Time Series Analysis for Performance Assessment of Metaheuristics -- 4 Applications of DFA for Metaheuristics -- 4.1 Differential Evolution (DE) as an Optimization Technique -- 4.2 Basin Hopping (BH) as an Optimization Technique -- 5 Experimental Results -- 5.1 DE - General Findings -- 5.2 DE - On-Line Performance Measure -- 5.3 DE - Online Adaption of Parameter Choices -- 5.4 BH - Results of DFA Analysis -- 6 Discussion -- References -- Speeding Up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem -- 1 Introduction -- 2 The Bi-Level Capacitated Vehicle Routing Problem with Time Limits -- 3 Related Work -- 4 MIP Model for 2L-VRP-TL. , 5 Logic-Based Benders' Decomposition for 2L-VRP-TL -- 6 Metaheuristic Improvements -- 6.1 Heuristic BD -- 7 Computational Experiments -- 7.1 Instances -- 7.2 Results -- 8 Conclusions -- References -- Author Index.

Note: Förderkennzeichen BMBF 16KIS0055 [richtig] - 16KIS0053K [falsch]. - Verbund-Nummer 01149953 , Projektleiter ist laut Berichtsblatt Autor , Weitere Autoren dem Berichtsblatt entnommen , Unterschiede zwischen dem gedruckten Dokument und der elektronischen Ressource können nicht ausgeschlossen werden , Mit deutscher und englischer Zusammenfassung

Note: Förderkennzeichen BMWi 0327241C. - Verbund-Nummer 01066133 , Unterschiede zwischen dem gedruckten Dokument und der elektronischen Ressource können nicht ausgeschlossen werden

Note: Förderkennzeichen BMWi 0327241D. - Verbund-Nummer 01066133 , Unterschiede zwischen dem gedruckten Dokument und der elektronischen Ressource können nicht ausgeschlossen werden