Feedback

HEC-Ecole de gestion de l'Université de Liège
HEC-Ecole de gestion de l'Université de Liège
MASTER THESIS
VIEW 12 | DOWNLOAD 12

A constructive and improvement heuristic for the dial a ride problem

Download
Thomas, Frédérick ULiège
Promotor(s) : Paquay, Célia ULiège
Date of defense : 24-Jan-2022/28-Jan-2022 • Permalink : http://hdl.handle.net/2268.2/13737
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 ULiège
Date of defense  : 24-Jan-2022/28-Jan-2022
Advisor(s) : Paquay, Célia ULiège
Committee's member(s) : Maharani, Anisha ULiège
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)

Annexe(s)

File
Access Hybrid Bee algorithm with Deterministic Annealing.jl
Description:
Size: 76.41 kB
Format: Unknown

Author

  • Thomas, Frédérick ULiège Université de Liège > Master ingé. gest., à fin.

Promotor(s)

Committee's member(s)

  • Total number of views 12
  • Total number of downloads 12










All documents available on MatheO are protected by copyright and subject to the usual rules for fair use.
The University of Liège does not guarantee the scientific quality of these students' works or the accuracy of all the information they contain.