论文信息 - Competitive analysis of a dispatch policy for a dynamic multi-period routing problem

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

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.

Martin W. P. Savelsbergh | Maria Grazia Speranza | Enrico Angelelli

[1] Martin W. P. Savelsbergh,et al. Competitive analysis for dynamic multiperiod uncapacitated routing problems , 2007 .

[2] Sven Oliver Krumke,et al. Online Dial-a-Ride Problems: Minimizing the Completion Time , 2000, STACS.

[3] Patrick Jaillet,et al. Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios , 2006, Transp. Sci..

[4] Leen Stougie,et al. The Online-TSP against Fair Adversaries , 2000, CIAC.

[5] Sandy Irani,et al. On-Line Algorithms for the Dynamic Traveling Repair Problem , 2002, SODA '02.

[6] Leen Stougie,et al. Algorithms for the On-Line Travelling Salesman1 , 2001, Algorithmica.

[7] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.

[8] Leen Stougie,et al. News from the online traveling repairman , 2003, Theor. Comput. Sci..

[9] Nicole Megow,et al. The Online Target Date Assignment Problem , 2005, WAOA.