Information Technology Reference
In-Depth Information
feasibility of the algorithm is demonstrated by a numerical example. The study of this
problem is beneficial for decision-makers to choose the right route, locations and de-
parture time according to their own situation in limited time budget. Further study
will consider more realistic factors such as the time windows and capacity constraints
of locations.
Acknowledgments. This work was supported by Natural Foundation of China (NSFC
70432001) and Shanghai Leading Academic Discipline Project (B210).
References
1 Butt, S., Cavalier, T.: A heuristic for the multiple tour maximum collection problem.
Comput. Oper. Res. 21, 101-111 (1994)
2 Chao, I.M., Golden, B., Wasil, E.: The team orienteering problem. Eur. J. Oper. Res. 88,
464-474 (1996)
3 Butt, S., Cavalier, T.: A heuristic for the multiple tour maximum collection problems.
Computers and Operations Research 21, 101-111 (1994)
4 Tang, H., Miller-Hooks, E.: A tabu search heuristic for the team orienteering problem.
Comput. Oper. Res. 32, 1379-1407 (2005)
5 Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp.
Sci. 39(2), 188-205 (2005)
6 Butt, S., Ryan, D.: An optimal solution procedure for the multiple tour maximum collec-
tion problem using column generation. Computer and Operations Research 26, 427-441
(1999)
7 Boussier, S., Feillet, D., Gendreau, M.: An exact algorithm for the team orienteering prob-
lem. 4OR 5, 211-230 (2007)
8 Chao, I., Golden, B., Wasil, E.: Theory and methodology—the team orienteering problem.
European Journal of Operational Research 88, 464-474 (1996)
9 Archetti, C., Hertz, A., Speranza, M.: Metaheuristics for the team orienteering problem.
Journal of Heuristics 13, 49-76 (2007)
10 Ke, L., Archetti, C., Feng, Z.: Ants can solve the team orienteering problem. Computers &
Industrial Engineering 54, 648-665 (2008)
11 Vansteenwegen, P., Souffriau, W., et al.: Metaheuristics for tourist trip planning. Metaheu-
ristics in the Service Industry. LNEMS, vol. 624. Springer, Berlin (2009) (to appear)
ISBN: 978-3-642-00938-9
12 Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: A guided lo-
cal search metaheuristic for the team orienteering problem. European Journal of Opera-
tional Research 196(1), 118-127 (2009)
13 Souffriau, W., Vansteenwegen, P., et al.: A path relinking approach for the team orienteer-
ing problem. Computers & Operations Research 37(11), 1853-1859 (2010)
14 Bouly, H., Dang, D.C., Moukrim, A.: A memetic algorithm for the team orienteering prob-
lem. 4OR-QJ Oper. Res 8, 49-70 (2010)
 
Search WWH ::




Custom Search