Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem

  • Wasin Padungwech
  • Jonathan Thompson
  • Rhyd Lewis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9668)


This paper presents two ideas to guide a tabu search algorithm for the Capacitated Arc Routing Problem to a promising region of the solution space. Both ideas involve edge-reordering, although they work in different ways. One of them aims to directly tackle deadheading cycles, and the other tries to reorder edges with the aim of extending a scope of solutions that can be reached from a given solution. Experiments were performed on 134 benchmark instances of various sizes, and the two ideas were shown to have an ability to guide the search to good solutions. Possible issues that may arise when implementing these ideas are also discussed.


  1. 1.
    Beullens, P., Muyldermans, L., Cattrysse, D., Van Oudheusden, D.: A guided local search heuristic for the capacitated arc routing problem. Eur. J. Oper. Res. 147(3), 629–643 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Brandão, J., Eglese, R.: A deterministic tabu search algorithm for the capacitated arc routing problem. Comput. Oper. Res. 35(4), 1112–1126 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, Part II: the rural postman problem. Oper. Res. 43(3), 399–414 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Frederickson, G.N.: Approximation algorithms for some postman problems. J. ACM (JACM) 26(3), 538–554 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Fu, H., Mei, Y., Tang, K., Zhu, Y.: Memetic algorithm with heuristic candidate list strategy for capacitated arc routing problem. In: 2010 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE (2010)Google Scholar
  7. 7.
    Golden, B.L., DeArmon, J.S., Baker, E.K.: Computational experiments with algorithms for a class of routing problems. Comput. Oper. Res. 10(1), 47–59 (1983)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Golden, B.L., Wong, R.T.: Capacitated arc routing problems. Networks 11(3), 305–315 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Greistorfer, P.: A tabu scatter search metaheuristic for the arc routing problem. Comput. Ind. Eng. 44(2), 249–266 (2003)CrossRefGoogle Scholar
  10. 10.
    Hertz, A., Laporte, G., Mittaz, M.: A tabu search heuristic for the capacitated arc routing problem. Oper. Res. 48(1), 129–135 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Kolmogorov, V.: Blossom V: a new implementation of a minimum cost perfect matching algorithm. Math. Program. Comput. 1(1), 43–67 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Lacomme, P., Prins, C., Ramdane-Cherif, W.: Competitive memetic algorithms for arc routing problems. Ann. Oper. Res. 131(1–4), 159–185 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Polacek, M., Doerner, K.F., Hartl, R.F., Maniezzo, V.: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J. Heuristics 14(5), 405–423 (2008)CrossRefzbMATHGoogle Scholar
  14. 14.
    Santos, L., Coutinho-Rodrigues, J., Current, J.R.: An improved ant colony optimization based algorithm for the capacitated arc routing problem. Transp. Res. Part B Methodol. 44(2), 246–266 (2010)CrossRefGoogle Scholar
  15. 15.
    Tang, K., Mei, Y., Yao, X.: Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Trans. Evol. Comput. 13(5), 1151–1166 (2009)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Wasin Padungwech
    • 1
  • Jonathan Thompson
    • 1
  • Rhyd Lewis
    • 1
  1. 1.School of MathematicsCardiff UniversityCardiffUK

Personalised recommendations