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

Authors:
Enrico Angelelli;Martin W. P. Savelsbergh;M. Grazia Speranza
Affiliations:
Department of Quantitative Methods, University of Brescia, Italy;H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA;Department of Quantitative Methods, University of Brescia, Italy
Venue:
Operations Research Letters
Year:
2007

Citing 8
Cited 1

Amortized efficiency of list update and paging rules

Communications of the ACM
Online Dial-a-Ride Problems: Minimizing the Completion Time

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
News from the online traveling repairman

Theoretical Computer Science - Mathematical foundations of computer science
The Online TSP Against Fair Adversaries

INFORMS Journal on Computing
On-Line Algorithms for the Dynamic Traveling Repair Problem

Journal of Scheduling
Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios

Transportation Science
Competitive analysis for dynamic multiperiod uncapacitated routing problems

Networks
The online target date assignment problem

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms

Note: CLEVER or smart: Strategies for the online target date assignment problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze an on-line algorithm (dispatch policy) for a dynamic multi-period routing problem. The objective is to minimize the total cost over all periods. We show that the competitive ratio of this policy for instances with customers located on the non-negative real line is 32.