The capacitated arc routing problem with intermediate facilities

Networks

Volumn 37, Issue 3, 2001, Pages 134-143

  Ghiani, Gianpaolo ^a   Improta, Gennaro ^b   Laporte, Gilbert ^c  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^c HEC MONTRÉAL   (Canada)

Author keywords

Capacitated arc routing problem; Intermediate facilities

Indexed keywords

EID: 0035343135     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.3     Document Type: Article

References (23)

1. [1] A.A. Assad and B.L. Golden, "Arc routing methods and applications," Network routing, Handbooks in operations research and management science, Vol. 8, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), North-Holland, Amsterdam, pp. 375-483.
2. [2] J.E. Beasley, Route first-cluster second methods for vehicle routing, Omega 11 (1983), 403-408.
3. [3] J.M. Belenguer and E. Benavent, The capacitated arc routing problem: Valid inequalities and facets, Comput Optim Appl 10 (1997), 165-187.
4. [4] J.M. Belenguer and E. Benavent, A cutting plane algorithm for the capacitated arc routing problem, Working paper, Departamento de Estadistica e Investigacion Operativa, Universidad de Valencia, 1997.
5. [5] E. Benavent, V. Campos, A. Corberán, and E. Mota, The capacitated arc routing problem: Lower bounds, Networks 22 (1992), 669-690.
6. [6] A. Corberán and J.M. Sanchis, A polyhedral approach to the rural postman problem, Eur J Oper Res 79 (1994), 95-114.
7. [7] CPLEX Optimization Inc., Using the CPLEX callable library and CPLEX mixed integer library, 1998.
8. [8] J. DeArmon, A comparison of heuristics for the capacitated Chinese postman problem, Master Thesis, University of Maryland at College Park, 1981.
9. [9] R.W. Eglese and L.Y.O. Li, Efficient routing for winter gritting, J Oper Res Soc 43 (1992), 1031-1034.
10. [10] H.A. Eiselt, M. Gendreau, and G. Laporte, Arc routing problems, Part I: The Chinese postman problem, Oper Res 43 (1995), 231-242.
11. [11] H.A. Eiselt, M. Gendreau, and G. Laporte, Arc routing problems, Part II: The rural postman problem, Oper Res 43 (1995), 399-414.
12. [12] M. Fischetti, J.J. Salazar, and P. Toth, A branch and cut algorithm for the symmetric generalized traveling salesman problem, Oper Res 45 (1997), 378-394.
13. [13] G.N. Frederickson, Approximation algorithms for some postman problems, SIAM J Comput 7 (1979), 178-193.
14. [14] G. Ghiani and G. Laporte, A branch-and-cut algorithm for the undirected rural postman problem, Math Program Ser A 87 (2000), 467-481.
15. [15] B.L. Golden and R.T. Wong, Capacitated arc routing problems, Networks 11 (1981), 305-315.
16. [16] M. Grötschel, L. Lovàsz, and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, Berlin, 1993.
17. [17] A. Hertz, G. Laporte, and M. Mittaz, A tabu search heuristic for the capacitated arc routing problem, Oper Res 48 (2000), 129-135.
18. [18] A. Hertz, G. Laporte, and P. Nanchen-Hugo, Improvement procedures for the undirected rural postman problem, IN-FORMS J Comput 11 (1999), 53-62.
19. [19] K. Jansen, Bounds for the general capacitated routing problem, Networks 23 (1993), 165-173.
20. [20] M. Jünger, G. Reinelt, and G. Rinaldi, "The traveling salesman problem," Network models, Handbooks in operations research and management science, M.O. Ball, T.L. Magnanti, C.L. Momna, and G.L. Nemhauser (Editors), NorthHolland, Amsterdam, 1995, pp. 225-230.
21. [21] P.F. Lemieux and L. Campagna, The snow plowing problem solved by a graph theory algorithm, Civil Eng Syst 1 (1984), 337-341.
22. [22] M.W. Padberg and M.R. Rao, Odd minimum cut-sets and b-matchings, Math Oper Res 7 (1982), 67-80.
23. [23] C. Wirasinghe and N.M. Waters, An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region, Eur J Oper Res 12(1983), 105-111.