A variable neighborhood search method for the orienteering problem with hotel selection

International Journal of Production Economics

Volumn 145, Issue 1, 2013, Pages 150-160

  Divsalar, A ^a,b   Vansteenwegen, P ^a,c   Cattrysse, D ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b BABOL NOSHIRVANI UNIVERSITY OF TECHNOLOGY   (Iran)

^c GHENT UNIVERSITY   (Belgium)

Author keywords

Hotel selection; Orienteering problem; Variable neighborhood search

Indexed keywords

COMPUTATION TIME; HOTEL SELECTIONS; INITIALIZATION PROCEDURES; NEIGHBORHOOD SEARCH; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; ORIENTEERING PROBLEM; VARIABLE NEIGHBORHOOD SEARCH;

ALGORITHMS; BENCHMARKING; OPTIMAL SYSTEMS;

HOTELS;

EID: 84880918342     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2013.01.010     Document Type: Conference Paper

References (17)

1. C. Archetti, A. Hertz, and M.G. Speranza Metaheuristics for the team orienteering problem Journal of Heuristics 13 1 2006 49 76
2. Arkin, E.; Mitchell, J. Narasimhan, G.; 1998. Resource-constrained geometric network optimization. In: Proceedings of the 14th ACM Symposium on Computational Geometry, pp. 307-316.
3. S. Butt, and T. Cavalier A heuristic for the multiple tour maximum collection problem Computers and Operations Research 21 1 1994 101 111
4. I.-M. Chao, B.L. Golden, and E.A. Wasil Theory and methodology - the team orienteering problem European Journal of Operational Research 88 3 1996 464 474
5. I.-M. Chao, B.L. Golden, and E.A. Wasil Theory and methodology - a fast and effective heuristic for the orienteering problem European Journal of Operational Research 88 3 1996 475 489
6. M. Gendreau, G. Laporte, and F. Semet A branch and cut algorithm for the undirected selective traveling salesman problem Networks 32 4 1998 263 273
7. P. Hansen, and N. Mladenović Variable neighborhood search: principles and applications European Journal of Operational Research 130 3 2001 449 467
8. N. Labadie, R. Mansini, J. Melechovský, and R. Wolfler Calvo The team orienteering problem with time windows: an LP-based granular variable neighborhood search European Journal of Operational Research 220 1 2012 15 27
9. C.E. Miller, W. Tucker, and R. a. Zemlin Integer programming formulation of traveling salesman problems Journal of the ACM 7 4 1960 326 329
10. M. Schilde, K.F. Doerner, R.F. Hartl, and G. Kiechle Metaheuristics for the bi-objective orienteering problem Swarm Intelligence 3 3 2009 179 201
11. Z. Sevkli, and F.E. Sevilgen Variable neighborhood search for the orienteering Lecture Notes in Computer Science 4263/2006 2006 134 143
12. F. Tricoire, M. Romauch, K.F. Doerner, and R.F. Hartl Heuristics for the multi-period orienteering problem with multiple time windows Computers & Operations Research 37 2 2010 351 367
13. T. Tsiligirides Heuristic methods applied to orienteering Journal of the Operational Research Society 35 9 1984 797 809
14. P. Vansteenwegen, W. Souffriau, G. Berghe, and D. Oudheusden A guided local search metaheuristic for the team orienteering problem European Journal of Operational Research 196 1 2009 118 127
15. P. Vansteenwegen, W. Souffriau, G. Berghe, and D. Oudheusden Metaheuristics for tourist trip planning Lecture Notes in Economics and Mathematical Systems 624 2009 15 31
16. P. Vansteenwegen, W. Souffriau, and D. Oudheusden The orienteering problem: a survey European Journal of Operational Research 209 1 2011 1 10
17. P. Vansteenwegen, W. Souffriau, and K. Sörensen The travelling salesperson problem with hotel selection Journal of the Operational Research Society 63 2012 207 217