On-Line Algorithms for the Dynamic Traveling Repair Problem

Authors:
Sandy Irani;Xiangwen Lu;Amelia Regan
Affiliations:
Information and Computer Science Department, UC Irvine, USA 92697;Institute of Transportation Studies, UC Irvine, USA 92697;Department of Civil and Environmental Engineering, UC Irvine, USA 92697
Venue:
Journal of Scheduling
Year:
2004

Citing 8
Cited 7

A priori solution of a travelling salesman problem in which a random subset of the customers are visited

Operations Research
Competitive algorithms for server problems

Journal of Algorithms
Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles

Operations Research
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen

SIAM Journal on Computing
On-line single-server dial-a-ride problems

Theoretical Computer Science
The k-client problem

Journal of Algorithms
Euler is standing in line dial-a-ride problems with precedence-constraints

Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Linear Time Approximation Schemes for Vehicle Scheduling

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory

How to whack moles

Theoretical Computer Science - Approximation and online algorithms
Note: An adversarial queueing model for online server routing

Theoretical Computer Science
New policies for the dynamic traveling salesman problem

Optimization Methods & Software
Online decision making and automatic decision model adaptation

Computers and Operations Research
A survey on metaheuristics for stochastic combinatorial optimization

Natural Computing: an international journal
ANWB Automates and Improves Service Personnel Dispatching

Interfaces
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the dynamic traveling repair problem in which requests with deadlines arrive through time on points in a metric space. Servers move from point to point at constant speed. The goal is to plan the motion of servers so that the maximum number of requests are met by their deadline. We consider a restricted version of the problem in which there is a single server and the length of time between the arrival of a request and its deadline is constant. We give upper bounds for the competitive ratio of two very natural algorithms as well as several lower bounds for any deterministic algorithm. Most of the results in this paper are expressed as a function of β, the diameter of the metric space. In particular, we prove that the upper bound given for one of the two algorithms is within a constant factor of the best possible competitive ratio.