A constructive and improvement heuristic for the dial a ride problem
Thomas, Frédérick
Promoteur(s) :
Paquay, Célia
Date de soutenance : 24-jan-2022/28-jan-2022 • URL permanente : http://hdl.handle.net/2268.2/13737
Détails
Titre : | A constructive and improvement heuristic for the dial a ride problem |
Titre traduit : | [fr] Heuristic de construction and d'amélioration pour le dial a ride problem |
Auteur : | Thomas, Frédérick ![]() |
Date de soutenance : | 24-jan-2022/28-jan-2022 |
Promoteur(s) : | Paquay, Célia ![]() |
Membre(s) du jury : | Maharani, Anisha ![]() |
Langue : | Anglais |
Nombre de pages : | 84 |
Mots-clés : | [en] Vehicle routing problem [en] Dial a ride problem [en] Optimisation [en] Hybrid metaheuristic [en] Bee algorithm [fr] Deterministic Annealing |
Discipline(s) : | Sciences économiques & de gestion > Production, distribution & gestion de la chaîne logistique Ingénierie, informatique & technologie > Sciences informatiques |
Public cible : | Chercheurs Professionnels du domaine |
Institution(s) : | Université de Liège, Liège, Belgique |
Diplôme : | Master en ingénieur de gestion, à finalité spécialisée en Supply Chain Management and Business Analytics |
Faculté : | Mémoires de la HEC-Ecole de gestion de l'Université de Liège |
Résumé
[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
Fichier(s)
Document(s)


Description:
Taille: 827.21 kB
Format: Adobe PDF
Annexe(s)
Citer ce mémoire
APA
Thomas, F. (2022). A constructive and improvement heuristic for the dial a ride problem. (Unpublished master's thesis). Université de Liège, Liège, Belgique. Retrieved from https://matheo.uliege.be/handle/2268.2/13737
Chicago
L'Université de Liège ne garantit pas la qualité scientifique de ces travaux d'étudiants ni l'exactitude de l'ensemble des informations qu'ils contiennent.