Heuristics for the traveling repairman problem with profits

Computers and Operations Research

Volumn 40, Issue 7, 2013, Pages 1700-1707

  Dewilde, T ^a   Cattrysse, D ^a   Coene, S ^a   Spieksma, F C R ^a   Vansteenwegen, P ^a,b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b GHENT UNIVERSITY   (Belgium)

Author keywords

Latency; Tabu search; Traveling repairman

Indexed keywords

EUCLIDEAN PLANES; LATENCY; MULTIPLE NEIGHBORHOODS; SINGLE SERVER; TABU SEARCH ALGORITHMS; TIME-DEPENDENT; TRAVELING REPAIRMAN; UPPER BOUND;

GEOMETRY; LEARNING ALGORITHMS; MATHEMATICAL MODELS; TABU SEARCH;

PROFITABILITY;

EID: 84875949596     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.01.003     Document Type: Article

References (22)

1. E. Aarts, and J.K. Lenstra Local search in combinatorial optimization 1997 Princeton University Press New Jersey
2. F. Afrati, S. Cosmadakis, C.H. Papadimitriou, G. Papageorgiou, and N. Papakostantinou The complexity of the travelling repairman problem Informatique Théorique et Applications 20 1 1986 79 87
3. D.L. Applegate, R.E. Bixby, V. Chvátal, and W.J. Cook The traveling salesman problem a computational study 2006 Princeton University Press New Jersey
4. G. Ausiello, V. Bonifaci, S. Leonardi, and A. Marchetti-Spaccamela Prize-collecting traveling salesman and related problems T.F. Gonzalez, Handbook of approximation algorithms and metaheuristics 2007 Chapman & Hall, CRC Boca Raton 40.1 40.13
5. Blum A, Chalasani P, Coppersmith D, Pulleyblank B, Raghavan P, Sudan M. The minimum latency problem. In: Proceedings of the 26th annual ACM symposium on the theory of computing. Montreal, ACM; 1994. p. 163-71.
6. A.M. Campbell, D. Vandenbussche, and W. Hermann Routing for relief efforts Transportation Science 42 2 2008 127 145
7. S. Coene, and F.C.R. Spieksma Profit-based latency problems on the line Operations Research Letters 36 3 2008 333 337
8. Dewilde T. Het profit-based latency probleem. Masters thesis, University of Leuven, Leuven, Belgium; 2009 [in Dutch].
9. E. Erkut, and J. Zhang The maximum collection problem with time-dependent rewards Naval Research Logistics 43 5 1996 749 763
10. D. Feillet, P. Dejax, and M. Gendreau Traveling salesman problems with profits Transportation Science 39 2 2005 188 205
11. F. Glover, and G.A. Kochenberger Handbook of metaheuristics 2003 Kluwer Academic Publishers Massachusetts
12. M. Goemans, and J. Kleinberg An improved approximation ratio for the minimum latency problem Mathematical Programming 82 1-2 1998 111 124
13. A. Lucena Time-dependent traveling salesman problem - the delivery man case Networks 20 6 1990 753 763
14. Melvin J, Keskinocak P, Koenig S, Tovey C, Ozkaya BY. Multi-robot routing with rewards and disjoint time windows. In: Proceedings of the IEEE international conference on intelligent robots and systems, San Diego; 2007. p. 2332-7.
15. N. Mladenovic, and P. Hansen Variable neighbourhood search Computers & Operations Research 24 11 1997 1097 1100
16. S.U. Ngueveu, C. Prins, and R. Wolfler-Calvo An effective memetic algorithm for the cumulative capacitated vehicle routing problem Computers & Operations Research 37 11 2010 1877 1885
17. D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis An analysis of several heuristics for the traveling salesman problem S.S. Ravi, S.K. Shukla, Fundamental problems in computing 2009 Springer Science New York 45 68
18. A. Salehipour, K. Sörensen, P. Goos, and O. Bräysy An efficient GRASP+VND metaheuristic for the traveling repairman problem 4OR 9 2 2011 189 209
19. Talbi EG. Metaheuristics: from design to implementation. New Jersey, Wiley; 2009.
20. H. Tang, E. Miller-Hooks, and R. Tomastik Scheduling technicians for planned maintenance of geographically distributed equipment Transportation Research Part E 43 2007 591 609
21. P. Vansteenwegen, W. Souffriau, and D. Van Oudheusden The orienteering problem a survey European Journal of Operational Research 209 1 2011 1 10
22. B.Y. Wu, Z.-N. Huang, and F.-J. Zhan Exact algorithms for the minimum latency problem Information Processing Letters 92 6 2004 303 309