Minimizing the waiting time for a one-way shuttle service
Laurent Daudet () and
Frédéric Meunier ()
Additional contact information
Laurent Daudet: Université Paris Est
Frédéric Meunier: Université Paris Est
Journal of Scheduling, 2020, vol. 23, issue 1, No 5, 95-115
Abstract:
Abstract Consider a terminal in which users arrive continuously over a finite period of time at a variable rate known in advance. A fleet of shuttles has to carry them over a fixed trip. What is the shuttle schedule that minimizes their waiting time? This is the question addressed in the present paper. We consider several versions that differ according to whether the shuttles come back to the terminal after their trip or not, and according to the objective function (maximum or average of the waiting times). We propose efficient algorithms with proven performance guarantees for almost all versions, and we completely solve the case where all users are present in the terminal from the beginning, a result which is already of some interest. The techniques used are of various types (convex optimization, shortest paths, ...). The paper ends with numerical experiments showing that most of our algorithms behave also well in practice.
Keywords: Convex optimization; Shortest paths; Timetabling; Transportation; Waiting time; MSC; 90B35 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10951-019-00604-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:23:y:2020:i:1:d:10.1007_s10951-019-00604-y
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951
DOI: 10.1007/s10951-019-00604-y
Access Statistics for this article
Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo
More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().