Skip to main content
Book Chapter

Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors

  • Fabri A
  • Recht P
Springer Berlin Heidelberg, (2007), 445-450
DOI: 10.1007/978-3-540-69995-8_71
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Dial-A-Ride Problem (DARP) has often been used to organize transport of elderly and handicapped people, assuming that these people can book their transport in advance. But the DARP can also be used to organize usual passenger or goods transportation in real online scenarios with time window constraints. This paper presents an efficient exact algorithm with significantly reduced calculation times.

Cite

CITATION STYLE

APA

Fabri, A., & Recht, P. (2007). Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors. In Operations Research Proceedings 2006 (pp. 445–450). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_71

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free