The orienteering problem with variable profits

Networks

Volumn 61, Issue 2, 2013, Pages 104-116

  Erdoǧan, Güneş ^a   Laporte, Gilbert ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b HEC MONTRÉAL   (Canada)

Author keywords

branch and cut; integer programming; linearization; orienteering problem

Indexed keywords

BRANCH-AND-CUT; COLLECTION PARAMETERS; ORIENTEERING PROBLEM; TIME SPENT; UNDIRECTED GRAPH;

INTEGER PROGRAMMING; LINEARIZATION; PROFITABILITY;

GRAPH THEORY;

EID: 84874000086     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.21496     Document Type: Conference Paper

References (22)

1. C. Archetti, A. Hertz, M. Speranza, Metaheuristics for the team orienteering problem, J Heuristics 13 (2007), 49-76.
2. C. Archetti, D. Feillet, A. Hertz, M. G. Speranza, The capacitated team orienteering and profitable tour problems, J Oper Res Soc 60 (2009), 831-842.
3. J.-F. Bérubé, M. Gendreau, J.-Y. Potvin, An exact ε -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits, Eur J Oper Res 194 (2009a), 39-50.
4. J.-F. Bérubé, M. Gendreau, J.-Y. Potvin, A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem, Networks 54 (2009b), 56-67.
5. I-M. Chao, B. L. Golden, E. A. Wasil, A fast and effective heuristic for the orienteering problem, Eur J Oper Res 88 (1996), 475-489.
6. S.S. Chauhan, J.M. Proth, The concave cost supply problem, Eur J Oper Res 148 (2003), 374-383.
7. M.S. Daskin, A Maximum Expected Covering Location Model: Formulation, Properties, and Heuristic Solution, Transport Sci 17 (1983), 48-70.
8. G. Erdoǧan, J.-F. Cordeau, G. Laporte, The Attractive Traveling Salesman Problem, J Oper Res Soc Ja 31 (1988), 515-530.
9. D. Feillet, P. Dejax, M. Gendreau, Traveling Salesman Problems With Profits, Transport Sci 39 (2005), 188-205.
10. M. Gendreau, G. Laporte, F. Semet, The Covering Tour Problem, Oper Res 45 (1997), 568-576.
11. M. Gendreau, G. Laporte, F. Semet, A branch-and-cut algorithm for the undirected selective travelling salesman problem, Networks 32 (1998), 263-273.
12. B. L. Golden, L. Levy, R. Vohra, The Orienteering Problem, Nav Res Log 34 (1987), 307-318.
13. S. Kataoka, and, S. Morito, An algorithm for the single constraint maximum collection problem, J Oper Res Soc Ja 31 (1988), 515-530.
14. L. Ke, C. Archetti, Z. Feng, Ants can solve the team orienteering problem, Comput Ind Eng 54 (2008), 648-665.
15. G. Laporte, S. Martello, The Selective Traveling Salesman Problem, Discrete Appl Math 26 (1990), 193-207.
16. I. Quesada, I.E. Grossman, An LP/NLP based branch and bound algorithm for convex MINLP optimization problems, Comput Chem Eng 16 (1992), 937-947.
17. G. Reinelt, TSPLIB-A Traveling Salesman Problem Library, ORSA J Comput 3 (1991), 376-384.
18. W. Souffriau, P. Vansteenwegen, J. Vertommen, G. Vanden Berghe, D. Van Oudheusden, A Personalized Tourist Trip Design Algorithm For Mobile Tourist Guides, Appl Artif Intell 22 (2008), 964-985.
19. W. Souffriau, P. Vansteenwegen, G. Vanden Berghe, D. Van Oudheusden, A path Relinking Approach for the Team Orienteering Problem, Comput Oper Res 37 (2010), 1853-1859.
20. H. Tang, E. Miller-Hooks, A TABU search heuristic for the team orienteering problem, Comput Oper Res 32 (2005), 1379-1407.
21. P. Vansteenwegen, W. Souffriau, G. Vanden Berghe, D. Van Oudheusden, A guided local search metaheuristic for the team orienteering problem, Eur J Oper Res 196 (2009), 118-127.
22. P. Vansteenwegen, W. Souffriau, D. Van Oudheusden, The orienteering problem: A survey, Eur J Oper Res 209 (2011), 1-10.