论文信息 - The team orienteering problem

The team orienteering problem

In the team orienteering problem, start and end points are specified along with other locations which have associated scores. Given a fixed amount of time for each of the M members of the team, the goal is to determine M paths from the start point to the end point through a subset of locations in order to maximize the total score. In this paper, a fast and effective heuristic is presented and tested on 353 problems ranging in size from 21 to 102 points. The computational results are presented in detail.

[1] Bruce L. Golden,et al. Algorithms and solutions to multi-level vehicle routing problems , 1993 .

[2] Bruce L. Golden,et al. Analysis of a large scale vehicle routing problem with an inventory component , 1984 .

[3] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .

[4] Tom M. Cavalier,et al. A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..

[5] T. Tsiligirides,et al. Heuristic Methods Applied to Orienteering , 1984 .

[6] G. Dueck. New optimization heuristics , 1993 .

[7] Bruce L. Golden,et al. A fast and effective heuristic for the orienteering problem , 1996 .

[8] R. Vohra,et al. The Orienteering Problem , 1987 .