Competitive analysis of a dispatch policy for a dynamic multi-period routing problem |
| |
Authors: | Enrico Angelelli M. Grazia Speranza |
| |
Affiliation: | a Department of Quantitative Methods, University of Brescia, Italy b H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA |
| |
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 . |
| |
Keywords: | Dynamic vehicle routing Dispatch policies Competitive analysis |
本文献已被 ScienceDirect 等数据库收录! |