Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/21986
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | MOLENBRUCH, Yves | - |
dc.contributor.author | BRAEKERS, Kris | - |
dc.contributor.author | CARIS, An | - |
dc.contributor.author | Vanden Berghe, Greet | - |
dc.date.accessioned | 2016-09-09T10:31:02Z | - |
dc.date.available | 2016-09-09T10:31:02Z | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | COMPUTERS & OPERATIONS RESEARCH, 77, p. 58-71 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/1942/21986 | - |
dc.description.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. | - |
dc.description.sponsorship | Research Foundation Flanders (FWO) | - |
dc.language.iso | en | - |
dc.rights | © 2016 Elsevier Ltd. All rights reserved. | - |
dc.subject.other | dial-a-ride problem; patient transportation; combination restrictions; bi-objective optimization; multi-directional local search; scheduling procedure | - |
dc.title | Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 71 | - |
dc.identifier.spage | 58 | - |
dc.identifier.volume | 77 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Molenbruch, Y (reprint author), Hasselt Univ, RG Logist, BE-3590 Diepenbeek, Belgium. yves.molenbruch@uhasselt.be | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.identifier.doi | 10.1016/j.cor.2016.07.020 | - |
dc.identifier.isi | 000384855000006 | - |
item.fulltext | With Fulltext | - |
item.contributor | MOLENBRUCH, Yves | - |
item.contributor | BRAEKERS, Kris | - |
item.contributor | CARIS, An | - |
item.contributor | Vanden Berghe, Greet | - |
item.fullcitation | MOLENBRUCH, Yves; BRAEKERS, Kris; CARIS, An & Vanden Berghe, Greet (2017) Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation. In: COMPUTERS & OPERATIONS RESEARCH, 77, p. 58-71. | - |
item.validation | ecoom 2017 | - |
item.accessRights | Restricted Access | - |
crisitem.journal.issn | 0305-0548 | - |
crisitem.journal.eissn | 1873-765X | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MDLS for a bi-objective DARP in patient transportation - publication (160720).pdf Restricted Access | Published version | 476.19 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
18
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
53
checked on Aug 13, 2024
Page view(s)
80
checked on Sep 7, 2022
Download(s)
48
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.