Pro-active Dynamic Vehicle Routing : Real-Time Control and Request-Forecasting Approaches to Improve Customer Service

Online-Ressource (LII, 319 p. 121 illus, digital)

Description based upon print version of record

Pro-active Dynamic Vehicle Routing; Foreword; Preface; Acknowledgments; Contents; List of Figures; List of Tables; List of Algorithms; Abbreviations; General RDOPG Symbols; Symbols in Chap. 2; Symbols in Chap. 4; Chapter 1: Introduction; 1.1 Motivation; Economic Need for Action; 1.2 Categorization of the Considered Problem; 1.3 Aims and Contributions of the Book; 1.3.1 Central Research Questions to Be Answered in This Book; 1.3.2 Contributions of This Book; 1.4 Outline of the Book; Chapter 2: Introduction to Tour Planning: Vehicle Routing and Related Problems; 2.1 General Task and Definitions

2.2 Representation of Requests and General Types of Routing Problems2.3 Node-Based Routing Problems; 2.3.1 The Traveling Salesman Problem (TSP); 2.3.2 The Vehicle Routing Problem (VRP and CVRP); The Capacitated VRP; 2.3.3 The General Pickup and Delivery Problem (GPDP) and Related Variants; 2.3.3.1 The General Pickup and Delivery Problem; 2.3.3.2 The Pickup and Delivery Problem (PDP); 2.3.3.3 The Dial-A-Ride Problem (DARP); 2.3.4 Complexity of Node-Based Routing Problems; 2.3.5 Solution Methods for Node-Based Routing Problems; 2.3.5.1 Exact Solution Methods; 2.3.5.2 Heuristic Solution Methods

2.4 Extensions to the Vehicle Routing Problem2.4.1 Time Windows; 2.4.2 Backhauls; 2.4.3 Simultaneous Pickup and Delivery; 2.4.4 Multi-Depot Problems; 2.4.5 Open Routing Problems; 2.4.6 Vehicle Scheduling; 2.4.7 Multiple Compartments; 2.4.8 Multiple Trips; 2.4.9 Time-Dependent Travel Times; 2.4.10 Legal Driving Time Regulations; 2.4.11 Heterogeneous Fleet; 2.4.12 Objective Functions in Vehicle Routing Problems; 2.4.12.1 Minimization of Travel-Dependent Parameters; 2.4.12.2 Minimization of the Number of Utilized Vehicles; 2.4.12.3 Minimization of the Sum of Tour Durations

2.4.12.4 Minimization of the Completion Time2.4.12.5 Minimization of Lateness Costs; 2.4.12.6 Minimization of the Number of Unserviced Customers; 2.4.12.7 Minimization of Customer Inconvenience and Request Response Time; 2.5 Information Revelation in Routing Problems; 2.5.1 Revelation of Relevant Information in Vehicle Routing Problems; 2.5.2 Approaches in the Literature for Characterizing Relevant Information and Distinguishing Between Static and Dynamic Routing Problems; 2.5.2.1 Characteristics of Relevant Information; 2.5.2.2 Static and Dynamic Routing Problems

2.5.2.3 Dynamism of the Problem, Model, and Application in Routing Problems2.5.3 A Unified Approach for Classifying Routing Problems with Regard to Characteristics and Processing of Relevant Information; 2.5.3.1 Routing Problems with Constant Relevant Information; 2.5.3.2 Routing Problems with Changing Relevant Information; 2.6 Dynamic Routing Problems Which Utilize a Centralized Coordination; 2.6.1 Typical Objectives in Dynamic Routing Problems; 2.6.2 Dynamic Events in Dynamic Routing Problems; 2.6.3 Technologies Utilized in Real-Time Control Approaches

2.6.3.1 Recent Advances in On-Board Technologies

10.1007/978-3-642-33472-6 [DOI]

ECONIS - Online Catalogue of the ZBW