Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/21986

Title: Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
Authors: Molenbruch, Yves
Braekers, Kris
Caris, An
Vanden Berghe, Greet
Issue Date: 2017
Abstract: This paper considers a generalization of a bi-objective dial-a-ride problem, incorporating real-life characteristics of patient transportation. It studies the impact of combination restrictions, preventing particular user combinations and limiting the set of drivers to which particular users can be assigned. The academic literature currently lacks insights into the effect of these restrictions on the cost structure of a service provider. A multi-directional local search algorithm is developed to solve this problem, taking into account the fundamental tradeoff between operational efficiency and service quality. Local search is integrated into a variable neighborhood descent framework that applies an intelligent candidate list principle to reduce computation time. Moreover, a new scheduling procedure is proposed, constructing time schedules that minimize total user ride time. It proves faster and more efficient than existing scheduling procedures. Overall, computational experiments on existing benchmark data extended with combination restrictions reveal a general pattern in the effect of the combination restrictions. Such insights are essential for service providers in order to support policy choices, e.g. related to service quality or medical education of drivers.
Notes: Molenbruch, Y (reprint author), Hasselt Univ, RG Logist, BE-3590 Diepenbeek, Belgium. yves.molenbruch@uhasselt.be
URI: http://hdl.handle.net/1942/21986
DOI: 10.1016/j.cor.2016.07.020
ISI #: 000384855000006
ISSN: 0305-0548
Category: A1
Type: Journal Contribution
Validation: ecoom, 2017
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Published version476.19 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.