Abstract
The transportation of elderly and impaired people is commonly solved as a Dial-A-Ride Problem (DARP). The DARP aims to design pick-up and delivery vehicle routing schedules. Its main objective is to accommodate as many users as possible with a minimum operation cost. It adds realistic precedence and transit time constraints on the pairing of vehicles and customers. This paper tackles the DARP with time windows (DARPTW) from a new and innovative angle as it combines hybridization techniques with an adaptive large neighborhood search heuristic algorithm. The main objective is to improve the overall real-life performance of vehicle routing operations. Real-life data are refined and fed to a hybrid adaptive large neighborhood search (Hybrid-ALNS) algorithm which provides a near-optimal routing solution. The computational results on real-life instances, in the Canadian city of Vancouver and its region, and DARPTW benchmark instances show the potential improvements achieved by the proposed heuristic and its adaptability.
| Original language | English |
|---|---|
| Article number | 39 |
| Journal | Algorithms |
| Volume | 12 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Feb 2019 |
Bibliographical note
Publisher Copyright:© 2019 by the authors.
Keywords
- Adaptive large neighborhood search
- Dial-A-Ride problem
- Genetic algorithms
- Impaired and elderly transportation
- Time windows
ASJC Scopus subject areas
- Theoretical Computer Science
- Numerical Analysis
- Computational Theory and Mathematics
- Computational Mathematics
Fingerprint
Dive into the research topics of 'A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver