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

We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of orders arrive that have to be served either in that time period or in the next. The objective of the problem is to minimize the average routing cost per time period. We show that the competitive ratio of this on-line algorithm for instances with customers on the non-negative real line is 3 2 .

• Type: Journal
• Year: 2007
• Where: ORL
• Authors: Enrico Angelelli, Martin W. P. Savelsbergh, Maria Grazia Speranza
• Keywords: Natural On-line Algorithm, On-line Algorithm, ORL 2007, Time Period