A simple and effective metaheuristic for the Minimum Latency Problem

European Journal of Operational Research

Volumn 221, Issue 3, 2012, Pages 513-520

  Silva, Marcos Melo ^a   Subramanian, Anand ^a,b   Vidal, Thibaut ^c,d   Ochi, Luiz Satoru ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b FEDERAL UNIVERSITY OF PARAÍBA   (Brazil)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

^d UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

GRASP; Iterated Local Search; Metaheuristics; Minimum Latency Problem

Indexed keywords

ARRIVAL TIME; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL TIME; DATA RETRIEVAL; GRASP; ITERATED LOCAL SEARCH; LATENCY PROBLEM; META HEURISTICS; METAHEURISTIC; OPTIMAL SOLUTIONS; RANDOMIZED APPROACH;

TRAVELING SALESMAN PROBLEM;

BENCHMARKING;

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

References (41)

1. Abeledo, H.; Fukasawa, R.; Pessoa, A.; Uchoa, E.; 2010a. The Time Dependent Traveling Salesman Problem: Polyhedra and Algorithm. Tech. Rep. RPEP, vol. 10 no. 15. Universidade Federal Fluminense, Brasil.
2. Abeledo, H.G.; Fukasawa, R.; Pessoa, A.A.; Uchoa, E.; 2010b. The time dependent traveling salesman problem: polyhedra and branch-cut-and-price algorithm. In: Proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010, pp. 202-213.
3. Archer, A.; Blasiak, A.; 2010. Improved approximation algorithms for the minimum latency problem via prize-collecting strolls. In: Proceedings of the 21th Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 429-447.
4. Archer, A.; Williamson, D.P.; 2003. Faster approximation algorithms for the minimum latency problem. In: Proceedings of the 40th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 88-96.
5. S. Arora, and G. Karakostas Approximation schemes for minimum latency problems SIAM Journal on Computing 32 5 2003 1317 1337
6. Ausiello, G.; Leonardi, S.; Marchetti-Spaccamela, A.; 2000. On salesmen, repairmen, spiders, and other traveling agents. In: Proceedings of the 4th Italian Conference on Algorithms and Complexity, pp. 1-16.
7. L. Bianco, A. Mingozzi, and S. Ricciardelli The traveling salesman problem with cumulative costs Networks 23 2 1993 81 91
8. L.-P. Bigras, M. Gamache, and G. Savard The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times Discrete Optimization 5 4 2008 685 699
9. Blum, A.; Chalasanit, P.; Pulleyblankt, B.; Raghavan, P.; Sudan, M.; 1994. The minimum latency problem. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pp. 163-171.
10. A. Campbell, D. Vandenbussche, and W. Hermann Routing for relief efforts Transportation Science 42 2 2008 127 145
11. Chaudhuri, K.; Godfrey, B.; Rao, S.; Talwar, K.; 2003. Paths, trees, and minimum latency tours. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, pp. 36-45.
12. Dewilde, T.; Cattrysse, D.; Coene, S.; Spieksma, F.C.R.; Vansteenwegen, P.; 2010. Heuristics for the traveling repairman problem with profits. In: Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2010, pp. 34-44.
13. Dongarra, J.J.; 2011. Performance of Various Computers using Standard Linear Equations Software. Tech. Rep. CS-89-85. Computer Science Department, University of Tennessee, Knoxville, TN, USA.
14. Ezzine, I.O.; Semet, F.; Chabchoub, H.; 2010. New formulations for the traveling repairman problem. In: Proceedings of the 8th International Conference of Modeling and Simulation.
15. J. Fakcharoenphol, C. Harrelson, and S. Rao The k-traveling repairmen problem ACM Transactions on Algorithms 3 4 2007 40+
16. T.A. Feo, and M.G.C. Resende Greedy randomized adaptive search procedures Journal of Global Optimization 6 2 1995 109 133
17. M. Fischetti, G. Laporte, and S. Martello The delivery man problem and cumulative matroids Operations Research 41 6 1993 1055 1064
18. A. García, P. Jodrá, and J. Tejel A note on the traveling repairman problem Networks 40 1 2002 27 31
19. M.X. Goemans, and J.M. Kleinberg An improved approximation ratio for the minimum latency problem Mathematical Programming 82 1 1998 111 124
20. L. Gouveia, and S. Voss A classification of formulations for the (time-dependent) traveling salesman problem European Journal of Operational Research 83 1 1995 69 82
21. G. Heilporn, J.-F. Cordeau, and G. Laporte The delivery man problem with time windows Discrete Optimization 7 4 2010 269 282
22. G. Kindervater, and M. Savelsbergh Vehicle routing: handling edge exchanges E. Aarts, J. Lenstra, Local Search in Combinatorial Optimization 1997 Wiley New York 337 360
23. H. Lourenço, O. Martin, and T. Stützle Iterated local search F. Glover, G. Kochenberger, Handbook of Metaheuristics 2003 Kluwer Academic Publishers 320 353
24. A. Lucena time-dependent traveling salesman problem - the deliveryman case Networks 20 6 1990 753 763
25. O. Martin, S.W. Otto, and E.W. Felten Large-step Markov chains for the traveling salesman problem Complex Systems 5 3 1991 299 326
26. I. Méndez-Díaz, P. Zabala, and A. Lucena A new formulation for the traveling deliveryman problem Discrete Applied Mathematics 156 17 2008 3223 3237
27. N. Mladenović, and P. Hansen Variable neighborhood search Computers & Operations Research 24 11 1997 1097 1100
28. Nagarajan, V.; Ravi, R.; 2008. The directed minimum latency problem. In: Proceedings of the 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, pp. 193-206.
29. S. 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
30. J.-C. Picard, and M. Queyranne The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling Operations Research 26 1 1978 86 110
31. G. Reinelt TSPLIB - a traveling salesman problem library INFORMS Journal on Computing 3 4 1991 376 384
32. G. Ribeiro, and G. Laporte An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem Computers & Operations Research 39 3 2012 728 735
33. S. Sahni, and T. Gonzalez P-complete approximation problems Journal of the ACM 23 3 1976 555 565
34. A. Salehipour, K. Sörensen, P. Goos, and O. Bräysy Efficient GRASP + VND and GRASP + VNS metaheuristics for the traveling repairman problem 4OR: A Quarterly Journal of Operations Research 9 2 2011 189 209
35. M. Savelsbergh Local search in routing problems with time windows Annals of Operations Research 4 1 1985 285 305
36. Sitters, R.; 2002. The minimum latency problem is NP-hard for weighted trees. In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002, pp. 230-239.
37. A. Subramanian, L.M.A. Drummond, C. Bentes, L.S. Ochi, and R. Farias A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery Computers & Operations Research 37 11 2010 1899 1911
38. J.N. Tsitsiklis Special cases of traveling salesman and repairman problems with time windows Networks 22 3 1992 263 282
39. Van Eijl, C.A.; 1995. A Polyhedral Approach to the Delivery Man problem. Tech. Rep. COSOR 95-19. Eindhoven University of Technology.
40. Vidal, T.; Crainic, T.; Gendreau, M.; Prins, C.; 2011. A Unifying View on Timing Problems and Algorithms. Tech. Rep. CIRRELT.
41. 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