Tight analysis of the lazy algorithm for open online dial-a-ride

DOI10.1007/978-3-031-38906-1_4arXiv2210.13850OpenAlexW4385317077MaRDI QIDQ6138988FDOQ6138988

Authors: Júlia Baligács, Y. Disser, Farehe Soheil, David Weckbecker 

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: In the open online dial-a-ride problem, a single server has to deliver transportation requests appearing over time in some metric space, subject to minimizing the completion time. We improve on the best known upper bounds on the competitive ratio on general metric spaces and on the half-line, for both the preemptive and non-preemptive version of the problem. We achieve this by revisiting the algorithm $extscLazy$ recently suggested in [WAOA, 2022] and giving an improved and tight analysis. More precisely, we show that it has competitive ratio $2.457$ on general metric spaces and $2.366$ on the half-line. This is the first upper bound that beats known lower bounds of 2.5 for schedule-based algorithms as well as the natural $extscReplan$ algorithm.

Full work available at URL: https://arxiv.org/abs/2210.13850

zbMATH Keywords

online algorithmscompetitive analysisdial-a-ride

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites Work

• Title not available (Why is that?)
• The online TSP against fair adversaries
• Algorithms for the on-line travelling salesman
• Algorithms for the on-line quota traveling salesman problem
• Online traveling salesman problems with service flexibility
• Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
• On-line single-server dial-a-ride problems
• News from the online traveling repairman.
• On-line dial-a-ride problems under a restricted information model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Online \(k\)-server routing problems
• Euler is standing in line dial-a-ride problems with precedence-constraints
• Online travelling salesman problem on a circle
• Online traveling salesman problems with rejection options
• Theory and Applications of Models of Computation
• Approximation and Online Algorithms
• Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
• Tight Bounds for Online TSP on the Line
• An improved online algorithm for the traveling repairperson problem on a line
• Competitive analysis of the online dial-a-ride problem
• Improved bounds for open online dial-a-ride on the line
• An improved algorithm for open online dial-a-ride

This page was built for publication: Tight analysis of the lazy algorithm for open online dial-a-ride

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138988)