Scatter search methods for the covering tour problem

Operations Research/ Computer Science Interfaces Series

Volumn 30, Issue , 2005, Pages 59-91

  Baldacci, Roberto ^a   Boschetti, Marco A ^b   Maniezzo, Vittorio ^b   Zamboni, Marco ^b  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Covering tour problem; Cutting planes; Scatter search algorithms

Indexed keywords

EID: 84863981808     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/0-387-23667-8_3     Document Type: Article

References (27)

1. Arkin, E.M., M.M. Halldorsson and R. Hassin (1993) Approximating the Tree and Tour Covers of a Graph, Information Processing Letters, 47:275-282.
2. Arkin, E.M. and R. Hassin (1994) Approximation Algorithms for the Geometric Covering Salesman Problem, Discrete Appl Math., 55:197-218.
3. Balas, E. (1989) The Prize Collecting Traveling Salesman Problem, Networks, 19:621-636.
4. Balas, E. and A. Ho (1980) Set Covering Algorithms Using Cutting Planes, Heuristic, and Subgradient Optimisation: A Computational Study, Mathematical Programming Study, 12:3 7-60.
5. Baldacci, R. (1999) Algorithms for Location and Routing Problems in Distribution Systems, Ph.D. Thesis, Management Science Dept., Imperial College, London.
6. Baldacci, R., A. Mingozzi and E. Hadjiconstantinou (1999) An Exact Algorithm for the Capacitated Vehicle Routing Problem based on a Two- Commodity Network Flow Formulation, Working Paper, Department of Mathematics, University of Bologna.
7. CPLEX Optimization Inc. (1996) Using the Cplex Callable Library and Cplex Mixed Integer Library. 930 Tahoe Blvd 802-297, Incline Viallge, NV89451, U.S.A.
8. Current, J.R. and D.A. Schilling (1989) The Covering Salesman Problem, Transp. Sci., 23:208-213.
9. Current, J.R. and D.A Schilling (1994) The Median Tour and Maximal Covering Problems, European Journal of Operational Research, 73:114-126.
10. Finke, G., A. Claus and E. Gunn (1984) A Two-Commodity Network Flow Approach to the Traveling Salesman Problem, Congress. Numerantium, 41:167-178.
11. Fischetti, M., J.J. Salazar and P. Toth (1997) A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem, Operations Research, 45:378-394.
12. Fischetti, M. and P. Toth (1988) An Additive Approach for the Optimal Solution of the Prize Collecting Traveling Salesman Problem. In Vehicle Routing: Methods and Studies, B.L. Golden and A.A. Assad (eds.), North-Holland, Amsterdam, 319-343.
13. Gendreau, M., A. Hertz and G. Laporte (1992) New Intersection and Postoptimization Procedures for the Traveling Salesman Problem, Operations Research, 40:1086-1094.
14. Gendreau, M., G. Laporte and F. Semet (1995) The Covering Tour Problem, Operations Research, 45:568-576.
15. Glover, F. (1977) Heuristics for Integer Programming using Surrogate Constraints, Decision Sciences, 8:156-166.
16. Glover, F. (1995) Scatter Search and Star Paths: Beyond the Genetic Metaphor, ORSpektrum, 17:125-137.
17. Glover, F. (1997) A Template for Scattersearch and Path Relinking. Lecture Notes in Computer Science, J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, D.Snyers (Eds.).
18. Glover, F. and M. Laguna (1997) Tabu Search, Kluwer Academic Publishers.
19. Kourtz, P. (1987) The Need for Improved Forest Fire Detection, The Forestry Chronicle, 272-277.
20. Labbe, M. and G. Laporte (1986) Maximizing User Convenience and Postal Service Efficiency in Post Box Location, Belgian J. Opns. res. Statist, and Computer Sci., 26:21-35.
21. Langevin, A., M. Desrochers, J. Desrosiers, S. Gelinas and F. Soumis (1993) A Two-Commodity Flow Formulation for the Traveling Salesman and the Makespan Problems with Time Windows, Networks, 23:631-640.
22. Laporte, G. and S. Martello (1990) The Selective Traveling Salesman Problem, Discrete Appl. Math., 26:193-207.
23. Lucena, A. (1986) Exact Solution Approaches for the Vehicle Routing Problem, Ph.D. Thesis, Management Science Dept, Imperial College, London.
24. Ntafos, S. (1992) Watchman Routes under Limited Visibility, Computational Geometry, 1:149-209.
25. Oppong, J.R. and MJ. Hodgson (1994) "Spatial Accessibility to Health Care Facilities in Suhum District, Ghana," Professional Geographer, 46:199-209.
26. Reinelt, G. (1991) Tsplib - a Traveling Salesman Problem Library, ORSA Journal on Computing, 3:376-384.
27. ReVelle, C.S. and G. Laporte (1993) New Directions in Plant Location, Studies in Locational Analysis, 5:31-58.