An iterative three-component heuristic for the team orienteering problem with time windows

European Journal of Operational Research

Volumn 232, Issue 2, 2014, Pages 276-286

  Hu, Qian ^a   Lim, Andrew ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Heuristic; Routing; Team orienteering problem with time; windows

Indexed keywords

COMPUTATIONAL RESULTS; HEURISTIC; HIGH-QUALITY SOLUTIONS; ITERATIVE FRAMEWORK; NUMBER OF VEHICLES; ROUTING; SET OF CUSTOMERS; TEAM ORIENTEERING PROBLEMS;

PROFITABILITY; SALES; SIMULATED ANNEALING; VEHICLE ROUTING; WINDOWS;

PROBLEM SOLVING;

EID: 84883746504     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.06.011     Document Type: Article

References (33)

1. I.M. Chao, B.L. Golden, and E.A. Wasil A fast and effective heuristic for the orienteering problem European Journal of Operational Research 88 3 1996 475 489
2. I.M. Chao, B.L. Golden, and E.A. Wasil The team orienteering problem European Journal of Operational Research 88 3 1996 464 474
3. W. Chiang, and R. Russell Simulated annealing metaheuristics for the vehicle routing problem with time windows Annals of Operations Research 63 1 1996 3 27
4. J. Cordeau, M. Gendreau, and G. Laporte A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 2 1997 105 119
5. R. Eglese Simulated annealing: A tool for operational research European Journal of Operational Research 46 3 1990 271 281
6. M. Fischetti, J. Salazar Gonzalez, and P. Toth Solving the orienteering problem through branch-and-cut INFORMS Journal on Computing 10 1998 133 148
7. L. Gambardella, R. Montemanni, and D. Weyland Coupling ant colony systems with strong local searches European Journal of Operational Research 220 3 2012 831 843
8. M. Gendreau, and J. Potvin Handbook of metaheuristics 2010 Springer
9. B. Golden, L. Levy, and R. Vohra The orienteering problem Naval Research Logistics (NRL) 34 3 1987 307 318
10. M. Kantor, and M. Rosenwein The orienteering problem with time windows Journal of the Operational Research Society 1992 629 635
11. C. Koulamas, S. Antony, and R. Jaen A survey of simulated annealing applications to operations research problems Omega 22 1 1994 41 56
12. N. Labadie, J. Melechovský, and R. Wolfler Calvo Hybridized evolutionary local search algorithm for the team orienteering problem with time windows Journal of Heuristics 17 6 2011 729 753
13. N. Labadie, R. Mansini, J. Melechovsk, and R.W. 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
14. N. Labadi, J. Melechovskỳ, and R. Calvo An effective hybrid evolutionary local search for orienteering and team orienteering problems with time windows Parallel Problem Solving from Nature - PPSN XI 2011 219 228
15. S. Lin, and V. Yu A simulated annealing heuristic for the team orienteering problem with time windows European Journal of Operational Research 217 1 2012 94 107
16. S. Lin, V. Yu, and S. Chou Solving the truck and trailer routing problem based on a simulated annealing heuristic Computers and Operations Research 36 5 2009 1683 1692
17. M. Malek, M. Guruswamy, M. Pandya, and H. Owens Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem Annals of Operations Research 21 1 1989 59 84
18. R. Montemanni, and L. Gambardella Ant colony system for team orienteering problems with time windows Foundations of Computing and Decision Sciences 34 2009 287 306
19. R. Montemanni, D. Weyland, and L. Gambardella An enhanced ant colony system for the team orienteering problem with time windows 2011 International symposium on computer science and society (ISCCS) 2011 IEEE 381 384
20. G. Righini, and M. Salani Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming Computers and Operations Research 36 4 2009 1191 1203
21. M. Schilde, K. Doerner, R. Hartl, and G. Kiechle Metaheuristics for the bi-objective orienteering problem Swarm Intelligence 3 3 2009 179 201
22. M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 2 1987 254 265
23. W. Souffriau, P. Vansteenwegen, J. Vertommen, G. Berghe, and D. Oudheusden A personalized tourist trip design algorithm for mobile tourist guides Applied Artificial Intelligence 22 10 2008 964 985
24. W. Souffriau, P. Vansteenwegen, G. Berghe, and D. Van Oudheusden The multiconstraint team orienteering problem with multiple time windows Transportation Science 47 1 2013 53 63
25. B. Suman, and P. Kumar A survey of simulated annealing as a tool for single and multiobjective optimization Journal of the Operational Research Society 57 10 2006 1143 1160
26. H. Tang, and E. Miller-Hooks A tabu search heuristic for the team orienteering problem Computers and Operations Research 32 6 2005 1379 1407
27. F. Tricoire, M. Romauch, K. Doerner, and R. Hartl Heuristics for the multi-period orienteering problem with multiple time windows Computers and Operations Research 37 2 2010 351 367
28. T. Tsiligirides Heuristic methods applied to orienteering Journal of the Operational Research Society 35 9 1984 797 809
29. A. Van Breedam Improvement heuristics for the vehicle routing problem based on simulated annealing European Journal of Operational Research 86 3 1995 480 490
30. P. Vansteenwegen, W. Souffriau, and D. Van Oudheusden A detailed analysis of two metaheuristics for the team orienteering problem, engineering stochastic local search algorithms Designing, Implementing and Analyzing Effective Heuristics 2009 110 114
31. P. Vansteenwegen, W. Souffriau, G. Vanden Berghe, and D. Van Oudheusden Iterated local search for the team orienteering problem with time windows Computers and Operations Research 36 12 2009 3281 3290
32. P. Vansteenwegen, W. Souffriau, and D. Oudheusden The orienteering problem: A survey European Journal of Operational Research 209 1 2011 1 10
33. V. Yu, S. Lin, W. Lee, and C. Ting A simulated annealing heuristic for the capacitated location routing problem Computers and Industrial Engineering 58 2 2010 288 299