Article (Scientific journals)
The time-consistent dial-a-ride problem
Tellez Sanchez, Oscar Augusto; Vercraene, Samuel; Lehuédé, Fabien et al.
2021In Networks
Peer reviewed
 

Files


Full Text
conDARP__Revision2.pdf
Author preprint (890.25 kB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
Dial-a-ride problem ; Vehicle routing ; Consistency ; Healthcare logistics ; Set partitioning ; Large neighborhood search
Abstract :
[en] In the context of door-to-door transportation of people with disabilities, service quality considerations such as maximum ride time and service time consistency are critical requirements. To identify a good trade-off between these considerations and economic objectives, we define a new variant of the multiperiod dial-a-ride problem called the time-consistent dial-a-ride problem. A transportation planning is supposed to be time consistent if for each passenger, the same service time is used all along the planning horizon. However, considering the numerous variations in transportation demands over a week, designing consistent plan for all passengers can be too expensive. It is therefore necessary to find a compromise solution between costs and time-consistency objectives. The time-consistent dial-a-ride problem is solved using an epsilon-constraint approach to illustrate the trade-off between these two objectives. It computes an approximation of the Pareto front, using a matheuristic framework that combines a large neighbourhood search with the solution of set partitioning problems. This approach is benchmarked on time-consistent vehicle routing problem literature instances. Experiments are also conducted in the context of door-to-door transportation for people with disabilities, using real data. These experiments support managerial insights regarding the inter-relatedness of costs and quality of service.
Disciplines :
Computer science
Author, co-author :
Tellez Sanchez, Oscar Augusto  ;  Université de Liège - ULiège > HEC Liège : UER > UER Opérations : Supply Chain Management
Vercraene, Samuel
Lehuédé, Fabien
Péton, Olivier
Monteiro, Thibaud
Language :
English
Title :
The time-consistent dial-a-ride problem
Publication date :
2021
Journal title :
Networks
Peer reviewed :
Peer reviewed
Available on ORBi :
since 15 February 2021

Statistics


Number of views
75 (12 by ULiège)
Number of downloads
76 (2 by ULiège)

Scopus citations®
 
4
Scopus citations®
without self-citations
2
OpenCitations
 
2

Bibliography


Similar publications



Contact ORBi