Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions

Abstract

This paper deals with the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions(CLARPIF), a variant of the classical Capacitated Arc Routing Problem(CARP), in which vehicles may unload or replenish at intermediate facilities and the length of any route may not exceed a specified upper bound. Three heuristics are developed for the CLARPIF: the first is a constructive procedure based on a partitioning approach while the second and the third are tailored Tabu Search procedures. Computational results on a set of benchmark instances with up to 50 vertices and 92 required edges are presented and analyzed.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    Assad, A. A. and Golden, B. L.: Arc routing methods and applications, in M. O. Ball, T. L. Magnanti, C. L. Monma and G. L. Nemhauser (eds), Handbook of Operations Research and Management Science: Networks, North-Holland, Amsterdam, 1995, pp. 375–483.

    Google Scholar 

  2. 2.

    Beasley, J. E.: Route first-Cluster second methods for vehicle routing, Omega11 (1983), 403–408.

    Google Scholar 

  3. 3.

    Benavent, E., Campos, V., Corberán, A. and Mota, E.: The capacitated arc routing problem: Lower bounds, Networks22 (1992), 669–690.

    Google Scholar 

  4. 4.

    DeArmon, J. A.: A comparison of heuristics for the capacitated Chinese postman problem, Master Thesis, University of Maryland at College Park, 1981.

  5. 5.

    De Rosa, B., Ghiani, G., Improta, G. and Musmanno, R.: The arc routing and scheduling problem with transshipment, Transport. Sci. 36 (2001), 301–313.

    Google Scholar 

  6. 6.

    Edmonds, J. and Johnson, E. L.: Matching, Euler tours and the Chinese postman problem, Math. Programming5 (1973), 88–124.

    Google Scholar 

  7. 7.

    Eglese, R.W. and Li, L. Y. O.: Efficient routing for winter gritting, J. Oper. Res. Soc.43 (1992), 1031–1034.

    Google Scholar 

  8. 8.

    Eiselt, H. A., Gendreau, M. and Laporte, G.: Arc routing problems, Part 1: The Chinese postman problem, Oper. Res.43 (1995), 231–242.

    Google Scholar 

  9. 9.

    Eiselt, H. A., Gendreau, M. and Laporte, G.: Arc routing problems, Part 2: The rural postman problem, Oper. Res.43 (1995), 399–414.

    Google Scholar 

  10. 10.

    Frederickson, G. N.: Approximation algorithms for some postman problems, SIAM J. Comput.7 (1979), 178–193.

    Google Scholar 

  11. 11.

    Ghiani, G., Hertz, A. and Laporte, G.: Recent algorithmic results for arc routing problems, E. Kozan and A. Ohuchi (eds), Putting Theory into Practice, Kluwer Acad. Publ., New York, 2001, pp. 1–20.

    Google Scholar 

  12. 12.

    Ghiani, G., Improta, G. and Laporte, G.: The capacitated arc routing problem with intermediate facilities, Networks37 (2001), 134–143.

    Google Scholar 

  13. 13.

    Ghiani, G., Guerriero, F., Improta, G. and Musmanno, R.: Solving a complex public waste collection problem in Southern Italy, Internat. Trans. Oper. Res.(2004), forthcoming.

  14. 14.

    Glover, F. and Laguna, M.: Tabu Search, Kluwer Acad. Publ., New York, 1997.

    Google Scholar 

  15. 15.

    Golden, B. L. and Wong, R. T.: Capacitated arc routing problems, Networks11 (1981), 305–315.

    Google Scholar 

  16. 16.

    Gendreau, M., Hertz, A. and Laporte, G.: A tabu search heuristic for the vehicle routing problem, Management Sci.40 (1994), 1276–1290.

    Google Scholar 

  17. 17.

    Hertz, A., Laporte, G. and Mittaz, M.: A tabu search heuristic for the capacitated arc routing problem, Oper. Res.48 (2000), 129–135.

    Google Scholar 

  18. 18.

    Jansen, K.: Bounds for the general capacitated routing problem, Networks23 (1993), 165–173.

    Google Scholar 

  19. 19.

    Lenstra, J. K. and Rinnooy Kan, A. H. G.: On general routing problems, Networks6 (1976), 273–280.

    Google Scholar 

  20. 20.

    Lemieux, P. F. and Campagna, L.: The snow plowing problem solved by a graph theory algorithm, Civil Eng. Systems1 (1984), 337–341.

    Google Scholar 

  21. 21.

    Taillard, É. D.: Robust taboo search for the quadratic assignment problem, Parallel Comput.17 (1991), 433–445.

    Google Scholar 

  22. 22.

    Wirasinghe, S. C. and Waters, N. M.: An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region, European J. Oper. Res.12 (1983), 105–111.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ghiani, G., Guerriero, F., Laporte, G. et al. Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions. Journal of Mathematical Modelling and Algorithms 3, 209–223 (2004). https://doi.org/10.1023/B:JMMA.0000038618.37710.f8

Download citation

  • capacitated arc routing problem
  • intermediate facilities
  • capacity and distance restrictions