Vehicle Routeing with Multiple Use of Vehicles
研究了同一辆车在规划期内可执行多条路线的车辆路径问题，并开发了禁忌搜索启发式算法，在测试问题上得到高质量解。
The vehicle routeing problem with multiple use of vehicles is a variant of the standard vehicle routeing problem in which the same vehicle may be assigned to several routes during a given planning period. A tabu search heuristic is developed for this problem. It is shown to produce high quality solutions on a series of test problems.