Citation
Transfers in the on-demand transportation: the DARPT Dial-a-Ride Problem with transfers allowed. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 185-205, 2013.
Paper
Abstract
Today, the on-demand transportation is used for elderly and disabled people for short distances. Each user provides a specific demand: a particular ride from an origin to a destination with hard time constraints like time windows, maximum user ride time, maximum route duration limits and precedence. This paper deals with the resolution of these problems (Dial-a-Ride Problems – DARP), including the possibility of one transshipment from a transfer point by request. We propose an algorithm based on insertion techniques and constraints propagation.
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{2013-185-205-P, author = {S. Deleplanque and A. Quilliot },
title = {Transfers in the on-demand transportation: the DARPT Dial-a-Ride Problem with transfers allowed },
booktitle = {In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium},
year = {2013},
editor = {G. Kendall and B. McCollum and G. {Venden Berghe}},
pages = {185--205},
note = {Paper},
abstract = { Today, the on-demand transportation is used for elderly and disabled people for short distances. Each user provides a specific demand: a particular ride from an origin to a destination with hard time constraints like time windows, maximum user ride time, maximum route duration limits and precedence. This paper deals with the resolution of these problems (Dial-a-Ride Problems – DARP), including the possibility of one transshipment from a transfer point by request. We propose an algorithm based on insertion techniques and constraints propagation. },
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-185-205-P.pdf} }