Strategies for the dynamic Dial-a-Ride Problem

Ka-Io Wong*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In the Dial-a-Ride Problem (DARP), passengers specific their transportation requests between origins and destinations with desired departure or arrival time, and the operator is responsible to provide transportation with a fleet of vehicles. The objective of the scheduler is to design a set of routes which minimizes the total service cost, capable of providing service to all requests. Existing approaches on the DARP focus on the static version of the problem. The objective of this paper is to develop an efficient strategy for the dynamic dial-a-ride problem to describe how the operator should response to the requests and manage the vehicles, taking into account the real-time characteristics and stochastic effects. In contrast to the heuristics used in the static problems which emphasize in the routing component, we identify that the core of the strategy in the dynamic approach is in the scheduling component.

Original languageEnglish
Title of host publicationTransportation and the Economy - Proceedings of the 10th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2005
EditorsWHK Lam, J Yan
PublisherHONG KONG UNIVERSITY SCIENCE
Pages551-559
Number of pages9
ISBN (Print)9889884712, 9789889884710
StatePublished - 1 Dec 2005
Event10th International Conference of Hong Kong Society for Transportation Studies: Transportation and the Economy, HKSTS 2005 - Kowloon, Hong Kong
Duration: 10 Dec 200510 Dec 2005

Publication series

NameTransportation and the Economy - Proceedings of the 10th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2005

Conference

Conference10th International Conference of Hong Kong Society for Transportation Studies: Transportation and the Economy, HKSTS 2005
CountryHong Kong
CityKowloon
Period10/12/0510/12/05

Keywords

  • DESIRED DELIVERY TIMES
  • TO-MANY OPERATIONS
  • HEURISTIC ALGORITHM

Fingerprint Dive into the research topics of 'Strategies for the dynamic Dial-a-Ride Problem'. Together they form a unique fingerprint.

Cite this