Article ID Journal Published Year Pages File Type
1143145 Operations Research Letters 2007 9 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
Authors
, , ,