A LOCATION BASED HEURISTIC FOR GENERAL ROUTING-PROBLEMS
成果类型：
Article
署名作者：
BRAMEL, J; SIMCHILEVI, D
署名单位：
Northwestern University
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.43.4.649
发表日期：
1995
页码：
649-660
关键词：
摘要：
We present a general framework for modeling routing problems based on formulating them as a traditional location problem called the capacitated concentrator location problem. We apply this framework to two classical routing problems: the capacitated vehicle routing problem and the inventory routing problem. In the former case, the heuristic is proven to be asymptotically optimal for any distribution of customer demands and locations. Computational experiments show that the heuristic performs well for both problems and, in most cases, outperforms all published heuristics on a set of standard test problems.