On minimizing the maximum flow time in the online dial-a-ride problem

  • Authors:

  • Sven O. Krumke;Willem E. de Paepe;Diana Poensgen;Maarten Lipmann;Alberto Marchetti-Spaccamela;Leen Stougie

  • Affiliations:

  • Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany;Combinatorial Optimization Group, Technical University of Eindhoven, Eindhoven, The Netherlands;Department Optimization, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin, Germany;Combinatorial Optimization Group, Technical University of Eindhoven, Eindhoven, The Netherlands;Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Rome, Italy;Combinatorial Optimization Group, Technical University of Eindhoven, Eindhoven, The Netherlands

  • Venue:
  • WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the online dial-a-ride problem (OlDarp), objects must be transported by a server between points in a metric space. Transportation requests (“rides”) arrive online, specifying the objects to be transported and the corresponding source and destination. We investigate the OlDarp for the objective of minimizing the maximum flow time. It has been well known that there can be no strictly competitive online algorithm for this objective and no competitive algorithm at all on unbounded metric spaces. However, the question whether on metric spaces with bounded diameter there are competitive algorithms if one allows an additive constant in the definition competitive ratio, had been open for quite a while. We provide a negative answer to this question already on the uniform metric space with three points. Our negative result is complemented by a strictly 2-competitive algorithm for the Online Traveling Salesman Problem on the uniform metric space, a special case of the problem.