Waiting strategies for the dynamic dial-a-ride problem Online publication date: Mon, 13-Apr-2009
by C.W. Yuen, K.I. Wong, Anthony F. Han
International Journal of Environment and Sustainable Development (IJESD), Vol. 8, No. 3/4, 2009
Abstract: The dial-a-ride service is a form of demand responsive transport that delivers passenger requests from their specified origins to destinations with desired time windows. It is usually used as a mean to provide transport for people who are not able to access a private transportation conveniently, or as a transport policy to encourage share rides and reduce driving. In this study, the authors consider the dynamic problem, which receives real-time requests during the day of operation. In the scheduling of the services, there may exist waiting for vehicles along the route at stops. This paper proposes three waiting strategies, namely, drive first (DF), wait first (WF) and modified dynamic wait (MDW), to allocate this waiting time along the stops by holding the vehicles so as to minimise the cost in accepting future calls. Simulation experiments show that the MDW is superior to DF and WF.
Online publication date: Mon, 13-Apr-2009
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Environment and Sustainable Development (IJESD):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org