The travelling salesperson problem with hotel selection

Journal of the Operational Research Society

Volumn 63, Issue 2, 2012, Pages 207-217

  Vansteenwegen, P ^a,b   Souffriau, W ^b   Sorensen K ^c  

^a GHENT UNIVERSITY   (Belgium)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

heuristic; hotel selection; travelling salesperson problem

Indexed keywords

BENCHMARKING; HOTELS;

HEURISTIC; HOTEL SELECTIONS; INITIALIZATION PROCEDURES; MATHEMATICAL FORMULATION; NEIGHBOURHOOD SEARCH; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; TRAVELLING SALESPERSON PROBLEMS;

OPTIMIZATION;

EID: 84855668585     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2011.18     Document Type: Article

References (19)

1. Applegate DL, Bixby RE, Chvatal V and Cook WJ (2007). The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics. Princeton University Press: Princeton, NJ, USA.
2. Bektas T (2006). The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega 34(3): 209-219. (Pubitemid 41600559)
3. Cordeau JF, Gendreau M and Laporte G (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2): 105-119. (Pubitemid 127360996)
4. Cordeau JF, Laporte G and Mercier A (2001). A unified tabu search heuristic for vehicle routing problems with time windows. J Opl Res Soc 52: 928-936. (Pubitemid 32720268)
5. Lin CKY, Chow CK and Chen A (2002). A location-routingloading problem for bill delivery services. Comput Indust Eng: 43(1-2): 5-25. (Pubitemid 34551900)
6. Lin S (1965). Computer solutions of the traveling salesman problem. Bell System Tech J 44: 2245-2269.
7. Miller CE, Tucker AW and Zemlin RA (1960). Integer programming formulation of traveling salesman problems. J ACM 7(4): 326-329.
8. Nagy G and Salhi S (2007). Location-routing: Issues, models and methods. Eur J Opl Res 177(2): 649-672. (Pubitemid 44647670)
9. Or I. (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Northwestern University, Evanston, IL.
10. Polacek M, Hartl RF, Doerner K and Reimann M (2004). A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10(6): 613-627. (Pubitemid 40356746)
11. Prins C (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Opns Res 31(12): 1985-20021.
12. Savelsbergh M (1992). The vehicle routing problem with time windows: Minimizing route duration. J Comput 4: 146-154.
13. Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Opns Res 35(2): 254-265.
14. Souffriau W, Vansteenwegen P, Vertommen J, Vanden Berghe G and Van Oudheusden D (2008). A personalized tourist trip design algorithm for mobile tourist guides. Appl Artif Intell 22(10): 964-985.
15. Toth P and Vigo D (2002). The vehicle routing problem. SIAM monographs on discrete mathematics and applications, SIAM.
16. Tsiligirides T (1984). Heuristic methods applied to orienteering. J Opl Res Soc 35: 797-809.
17. Vansteenwegen P, Souffriau W and Sörensen K (2010). Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows. Comput Opns Res (in press).
18. Vansteenwegen P, Souffriau W and Oudheusden D (2011). The orienteering problem: A survey. Eur J Opl Res 209(1): 1-10.
19. Wu TH, Low C and Bai JW (2002). Heuristic solutions to multidepot location-routing problems. Comput Opns Res 29(10): 1393-1415. (Pubitemid 34409654)