Exact and heuristic methods for dial-a-ride problems / vorgelegt von Daniela Gaul. Wuppertal, Dezember 2023
Content
- Contents
- Introduction
- Basic Concepts
- The Dial-a-Ride Problem
- Related Work on DARP Models and Algorithms
- Applications
- Problem Description and Notation
- Location-based MILP Models
- Multiple Objectives
- Related Problems
- Event-Based MILP Models for the Static Dial-a-Ride Problem
- Location-Augmented-Event-Based MILP Models: A Tight Formulation for the Static Dial-a-Ride Problem
- Location-Augmented-Event-Based MILP Models
- Theoretical Analysis
- Preprocessing and Branch-and-Cut Methods
- Numerical Results
- Summary
- Rolling-Horizon Event-Based MILP for the Dynamic Dial-a-Ride Problem
- Solution Strategy
- Event-Based Graph Model for a Rolling-Horizon
- Event-Based MILP Model for a Rolling-Horizon
- A Rolling-Horizon Algorithm
- Numerical Results
- Summary
- Ridepooling and Public Bus Services: A Comparative Case-Study
- Case Study Outline
- Statistical Modeling and Simulation of Transportation Data
- Feasible-Path Heuristic
- Numerical Results
- Summary
- Conclusion
- Nomenclature
- Bibliography