Research on team orienteering problem with dynamic travel times

Journal of Software

Volumn 7, Issue 2, 2012, Pages 249-255

  Li, Jin ^a  

^a ZHEJIANG GONGSHANG UNIVERSITY   (China)

Author keywords

Optimal algorithm; Team orienteering problem; Time dependent network; Travel time

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; FIXED NUMBERS; MIXED INTEGER PROGRAMMING MODEL; NETWORK PLANNING; NUMERICAL EXAMPLE; OPTIMAL ALGORITHM; OPTIMAL DYNAMICS; ORIENTEERING PROBLEM; TIME CONSTRAINTS; TIME-DEPENDENT NETWORKS; TRAVEL COSTS;

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; OPTIMIZATION; TRAVEL TIME;

ALGORITHMS;

EID: 84863292538     PISSN: 1796217X     EISSN: None     Source Type: Journal    
DOI: 10.4304/jsw.7.2.249-255     Document Type: Article

References (23)

1. S. Butt, T. Cavalier, "A heuristic for the multiple tour maximum collection problem," Comput. Oper. Res. vol.21, pp.101-111, 1994.
2. I.M. Chao, B. Golden, E. Wasil, "The team orienteering problem," Eur. J. Oper. Res, vol. 88, pp.464-474, 1996.
3. G. Laporte, S. Martello, "The selective travelling salesman problem," Discrete Applied Mathematics, vol.26, pp.193-207, 1990.
4. R. Ramesh, Y. Yoon, M. Karwan, "An optimal algorithm for the orienteering tour problem," ORSA Journal on Computing, vol.4, pp.155-165, 1992.
5. M. Fischetti, J. Salazar, P. Toth, "Solving the orienteering problem through branch-and-cut," INFORMS Journal on Computing, vol.10, pp.133-148, 1998.
6. M. Gendreau, G. Laporte, F. Semet, "A branch-and-cut algorithm for the undirected selective travelling salesman problem," Networks,vol.32, pp.263-273, 1998.
7. Y. Liang, S. Kulturel-Konak, A. Smith, "Meta heuristics for the orienteering problem," In: Proceedings of the 2002 congress on evolutionary computation, Honolulu, Hawai, pp. 384-389, 2002.
8. M. Tasgetiren, "A genetic algorithm with an adaptive penalty function for the orienteering problem," Journal of Economic and Social Research, vol.4-2, pp.1-26, 2001.
9. Q. Wang, X. Sun, B. Golden, J. Jia, "Using artificial neural networks to solve the orienteering problem," Annals of Operations Research, vol.61, pp.111-120, 1995.
10. I.M. Chao, B. Golden, E. Wasil, "A fast and effective heuristic for the orienteering problem," European Journal of Operational Research, vol.88-3, pp.475-489, 1996.
11. B. Golden, L. Levy, R. Vohra, "The orienteering problem," Naval Research Logistics, vol.34, pp.307-318, 1987.
12. S. Butt, T. Cavalier, "A heuristic for the multiple tour maximum collection problems," Computers and Operations Research, vol.21, pp.101-111, 1994.
13. H. Tang, E. Miller-Hooks, "A tabu search heuristic for the team orienteering problem," Comput. Oper. Res. vol. 32, pp.1379-1407, 2005.
14. D. Feillet, P. Dejax, M. Gendreau, "Traveling salesman problems with profits," Transp. Sci. vol.39-2, pp.188-205, 2005.
15. S. Butt, D. Ryan, "An optimal solution procedure for the multiple tour maximum collection problem using column generation," Computer and Operations Research, vol.26, pp.427-441, 1999.
16. S. Boussier, D. Feillet, M. Gendreau, "An exact algorithm for the team orienteering problem," 4OR. Vol.5, pp.211-230, 2007.
17. I. Chao, B. Golden, E. Wasil, "Theory and methodology-the team orienteering problem," European Journal of Operational Research, vol.88, pp.464-474, 1996.
18. C. Archetti, A. Hertz, M. Speranza, "Metaheuristics for the team orienteering problem," Journal of Heuristics, vol.13, pp.49-76, 2007.
19. L. Ke, C. Archetti, Z. Feng, "Ants can solve the team orienteering problem," Computers & Industrial Engineering, vol.54, pp.648-665, 2008.
20. P. Vansteenwegen, W. Souffriau, et al. "Metaheuristics for tourist trip planning," Metaheuristics in the Service Industry. In: Lecture notes in economics and mathematical systems, vol. 624. Berlin: Springer, to appear (ISBN: 978-3-642-00938-9), 2009.
21. P. Vansteenwegen, W. Souffriau, G. Vanden Berghe, D. Van Oudheusden, "A guided local search metaheuristic for the team orienteering problem," European Journal of Operational Research, vol.196/1, pp.118-127, 2009.
22. W. Souffriau, P. Vansteenwegen, et al. "A path relinking approach for the team orienteering problem," Computers & Operations Research, vol.37-11, pp.1853-1859, 2010.
23. H. Bouly, D.C. Dang, A. Moukrim, "A memetic algorithm for the team orienteering problem," 4OR-QJ Oper. Res.vol. 8, pp.49-70, 2010.