Improved Bounds for Open Online Dial-a-Ride on the Line

Alexander Birx, Yann Disser, Kevin Schewior*

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review


We consider the open, non-preemptive online Dial-a-Ride problem on the real line, where transportation requests appear over time and need to be served by a single server. We give a lower bound of 2.0585 on the competitive ratio, which is the first bound that strictly separates open online Dial-a-Ride on the line from open online TSP on the line in terms of competitive analysis, and is the best currently known lower bound even for general metric spaces. On the other hand, we present an algorithm that improves the best known upper bound from 2.9377 to 2.6662. The analysis of our algorithm is tight.

Original languageEnglish
Issue number5
Pages (from-to)1372-1414
Publication statusPublished - May 2023


  • Competitive analysis
  • Competitive ratio
  • Dial-a-ride on the line
  • Elevator problem
  • Online algorithms
  • Smartstart


Dive into the research topics of 'Improved Bounds for Open Online Dial-a-Ride on the Line'. Together they form a unique fingerprint.

Cite this