Master Thesis Online
A constructive and improvement heuristic for the dial a ride problem
Thomas, Frédérick 
Promotor(s) :
Paquay, Célia
Date of defense : 24-Jan-2022/28-Jan-2022 • Permalink : http://hdl.handle.net/2268.2/13737
All files (archive ZIP)Details
| Title : | A constructive and improvement heuristic for the dial a ride problem |
| Translated title : | [fr] Heuristic de construction and d'amélioration pour le dial a ride problem |
| Author : | Thomas, Frédérick
|
| Date of defense : | 24-Jan-2022/28-Jan-2022 |
| Advisor(s) : | Paquay, Célia
|
| Committee's member(s) : | Maharani, Anisha
|
| Language : | English |
| Number of pages : | 84 |
| Keywords : | [en] Vehicle routing problem [en] Dial a ride problem [en] Optimisation [en] Hybrid metaheuristic [en] Bee algorithm [fr] Deterministic Annealing |
| Discipline(s) : | Business & economic sciences > Production, distribution & supply chain management Engineering, computing & technology > Computer science |
| Target public : | Researchers Professionals of domain |
| Institution(s) : | Université de Liège, Liège, Belgique |
| Degree: | Master en ingénieur de gestion, à finalité spécialisée en Supply Chain Management and Business Analytics |
| Faculty: | Master thesis of the HEC-Ecole de gestion de l'Université de Liège |
Abstract
[en] The dial a ride problem (DARP) is a specific transportation problem. The objective is to optimise the planning of a collection of trips made by a fleet of vehicles. Those trips aim to satisfy requests from users while meeting various constraints. The cleared example is the transportation of the elderly or disabled people. The problem has received increase interest in recent years as the demand for services that can be solved through DARP is rising. Due to the aging of the population, this demand will be even bigger in the future. Good optimisation tools are needed to respond to it.
In this thesis, I review the different heuristics to solve DARP before implementing a hybrid Bee Algorithm with Deterministic Annealing. The different creation steps are described before the algorithm is tested on several instances. The results are then used to explore possible improvements to the algorithm. Several real-life problems are discussed along the way
File(s)
Document(s)
Frédérick THOMAS -A CONSTRUCTIVE AND IMPROVEMENT HEURISTIC FOR THE DIAL-A-RIDE PROBLEM.pdf
Description:
Size: 827.21 kB
Format: Adobe PDF
Annexe(s)
Cite this master thesis
The University of Liège does not guarantee the scientific quality of these students' works or the accuracy of all the information they contain.