Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/18781
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | MOLENBRUCH, Yves | - |
dc.contributor.author | BRAEKERS, Kris | - |
dc.contributor.author | CARIS, An | - |
dc.date.accessioned | 2015-04-24T08:03:59Z | - |
dc.date.available | 2015-04-24T08:03:59Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | Odysseus 2015, Ajaccio, 01/06/2015 - 05/06/2015 | - |
dc.identifier.uri | http://hdl.handle.net/1942/18781 | - |
dc.description.abstract | A dial-a-ride system is an application of demand-dependent, collective people transportation. Each user requests a trip between an origin and a destination of choice, to which a number of service level requirements are linked. The service provider attempts to develop efficient routing schedules, respecting these requirements and the technical constraints of a pickup and delivery problem. The balancing of human and economic perspectives involved in solving such a dial-a-ride problem (DARP) explains why these systems are particularly useful for organizing quality-oriented, but efficient transportation for users having special needs, such as door-to-door transportation for elderly and disabled. Since demand for dial-a-ride systems is generally increasing, service providers need efficient planning algorithms to safeguard quality and cost efficiency. The objective of this paper is to solve a bi-objective problem variant in which the conflicting interests of users and service providers are both incorporated as an objective. Contrary to single-objective methods, which usually minimize operational costs while ensuring a minimum quality level imposed by the service level requirements, the fundamental nature of the DARP is emphasized by explicitly minimizing user inconvenience. To this end, a multi-directional local search (MDLS) metaheuristic is developed, in which a variable neighborhood search (VNS) framework is embedded to guide the local search part. Initially, this metaheuristic is applied on a problem having standard characteristics, but its applicability can be extended by incorporating additional real-life features. | - |
dc.language.iso | en | - |
dc.subject.other | dial-a-ride; demand-responsive transportation; vehicle routing; bi-objective optimization; multi-directional local search; variable neighborhood search | - |
dc.title | A Multi-Directional Local Search Metaheuristic for a Bi-Objective Dial-a-Ride Problem | - |
dc.type | Conference Material | - |
local.bibliographicCitation.conferencedate | 01/06/2015 - 05/06/2015 | - |
local.bibliographicCitation.conferencename | Odysseus 2015 | - |
local.bibliographicCitation.conferenceplace | Ajaccio | - |
local.bibliographicCitation.jcat | C2 | - |
local.type.refereed | Refereed | - |
local.type.specified | Presentation | - |
item.fullcitation | MOLENBRUCH, Yves; BRAEKERS, Kris & CARIS, An (2015) A Multi-Directional Local Search Metaheuristic for a Bi-Objective Dial-a-Ride Problem. In: Odysseus 2015, Ajaccio, 01/06/2015 - 05/06/2015. | - |
item.contributor | MOLENBRUCH, Yves | - |
item.contributor | BRAEKERS, Kris | - |
item.contributor | CARIS, An | - |
item.accessRights | Open Access | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
150423 - Extended Abstract Odysseus2015 Revised.pdf | Conference material | 230.57 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.