The generalized covering salesman problem

INFORMS Journal on Computing

Volumn 24, Issue 4, 2012, Pages 534-553

  Golden, Bruce ^a   Naji Azimi, Zahra ^b,c   Raghavan, S ^a   Salari, Majid ^b,c   Toth, Paolo ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c FERDOWSI UNIVERSITY OF MASHHAD   (Iran)

Author keywords

Covering salesman problem; Generalized covering salesman problem; Generalized traveling salesman problem; Heuristic algorithms; Local search

Indexed keywords

DATA SETS; GENERALIZED TRAVELING SALESMAN PROBLEM; GRAPH G; HIGH-QUALITY SOLUTIONS; LOCAL SEARCH; LOCAL SEARCH HEURISTICS; SALESMAN PROBLEM;

HEURISTIC ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

EID: 84873206174     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1110.0480     Document Type: Article

References (28)

1. Arkin, E. M., R. Hassin. 1994. Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55(3) 197-218.
2. Balas, E., A. Ho. 1980. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. Math. Programming 12 37-60.
3. Cacchiani, V., A. E. F. Muritiba, M. Negreiros, P. Toth. 2011. A multistart heuristic for the equality generalized traveling salesman problem. Networks 57(3) 231-239.
4. Chisman, J. A. 1975. The clustered traveling salesman problem. Comput. Oper. Res. 2(2) 115-119.
5. Current, J. R. 1981. Multi-objective design of transportation networks. Ph.D. thesis, Department of Geography and Environmental Engineering, Johns Hopkins University, Baltimore.
6. Current, J. R., D. A. Schilling. 1989. The covering salesman problem. Transportation Sci. 23(3) 208-213.
7. Dantzig, G. B., R. Fulkerson, S. M. Johnson. 1954. Solution of a large-scale traveling salesman problem. Oper. Res. 2(4) 393-410.
8. Dongarra, J. J. 2004. Performance of various computers using standard linear equations software. Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville.
9. Feillet, D., P. Dejax, M. Gendreau. 2005. Traveling salesman problems with profits. Transportation Sci. 39(2) 188-205. (Pubitemid 40748589)
10. Fischetti, M., P. Toth. 1988. An additive approach for the optimal solution of the prize-collecting traveling salesman problem.
11. B. L. Golden, A. A. Assad, eds. Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, 319-343.
12. Fischetti, M., J. J. Salazar González, P. Toth. 1997. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3) 378-394. (Pubitemid 127684716)
13. Gendreau, M., A. Hertz, G. Laporte. 1992. New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40(6) 1086-1094.
14. Gendreau, M., G. Laporte, F. Semet. 1997. The covering tour problem. Oper. Res. 45(4) 568-576. (Pubitemid 127684731)
15. Gutin, G., A. P. Punnen, eds. 2002. The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht, The Netherlands.
16. Helsgaun, K. 2000. An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1) 106-130.
17. ILOG. 2007. CPLEX 11.0 User's Manual and Reference Manual. ILOG, S.A., Gentilly, France.
18. Laporte, G., S. Martello. 1990. The selective traveling salesman problem. Discrete Applied. Math. 26 193-207.
19. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2) 498-516.
20. Mennell, W. 2009. Heuristics for solving three routing problems: Close enough traveling salesman problem, close-enough vehicle routing problem, sequence-dependent team orienteering problem. Ph.D. thesis, University of Maryland, College Park.
21. Noon, C. E. 1988. The generalized traveling salesman problem. Ph.D. thesis, University of Michigan, Ann Arbor.
22. Pintea, C. M., P. C. Pop, C. Chira. 2007. The generalized traveling salesman problem solved with ant algorithms. J. Universal Comput. Sci. 13(7) 1065-1075.
23. Reinelt, G. 1991. TSPLIB-A traveling salesman problem library. ORSA J. Comput. 3(4) 376-384.
24. Renaud, J., F. F. Boctor. 1998. An efficient composite heuristic for the symmetric generalized traveling salesman problem. Eur. J. Oper. Res. 108(3) 571-584. (Pubitemid 128392106)
25. Silberholz, J., B. Golden. 2007. The generalized traveling salesman problem: A new genetic algorithm approach. E. K. Baker, A. Joseph, A. Mehrotra, M. A. Trick, eds. Extending the Horizons: Advances in Computing, Optimization Decision Technologies. Springer, New York, 165-181.
26. Snyder, L. V., M. S. Daskin. 2006. A random-key genetic algorithm for the generalized traveling salesman problem. Eur. J. Oper. Res. 174(1) 38-53. (Pubitemid 44883185)
27. Vogt, L., C. A. Poojari, J. E. Beasley. 2007. A tabu search algorithm for the single vehicle routing allocation problem. J. Oper. Res. Soc. 58(4) 467-480. (Pubitemid 46449941)
28. Wilcoxon, F. 1945. Individual comparisons by ranking methods. Biometrics 1(6) 80-83.