Citation
A Fixed Route Dial-a-Ride Problem. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 313-324, 2015.
Paper
Abstract
Dial-a-ride (DARP) is a transportation solution with ?exible routes and ?exible schedules. The DARP challenge is to optimally ful?ll a set of pickup and delivery ride requests using a given vehicle ?eet. We hereby present a DARP variant for which the route is known in advance. The problem is then to set up the schedules according to the requests. For a given operation cost, the aim is to maximize user satisfaction, by minimizing the sum of passengers’ waiting times. We introduce algorithms for solving two variants of the ?xed route DARP – one for a ?eet of in?nite capacity vehicles, and one for the more general case of vehicles with heterogeneous capacities. Contrary to general DARP which is NP-hard, the presented algorithms are polynomial in the number of ride requests.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2015-313-324-P, author = {H. Ilani and E. Shufan and T. Grinshpoun},
title = {A Fixed Route Dial-a-Ride Problem},
booktitle = {In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic},
year = {2015},
editor = {Z. Hanzalek and G. Kendall and B. McCollum and P. Sucha},
pages = {313--324},
note = {Paper},
abstract = { Dial-a-ride (DARP) is a transportation solution with ?exible routes and ?exible schedules. The DARP challenge is to optimally ful?ll a set of pickup and delivery ride requests using a given vehicle ?eet. We hereby present a DARP variant for which the route is known in advance. The problem is then to set up the schedules according to the requests. For a given operation cost, the aim is to maximize user satisfaction, by minimizing the sum of passengers’ waiting times. We introduce algorithms for solving two variants of the ?xed route DARP – one for a ?eet of in?nite capacity vehicles, and one for the more general case of vehicles with heterogeneous capacities. Contrary to general DARP which is NP-hard, the presented algorithms are polynomial in the number of ride requests.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-313-324-P.pdf} }