392
Views
13
CrossRef citations to date
0
Altmetric
Articles

A memetic algorithm with iterated local search for the capacitated arc routing problem

, &
Pages 3075-3084 | Received 17 May 2012, Accepted 21 Nov 2012, Published online: 26 Feb 2013

References

  • Benavent , E. , Campos , V. , Corberán , A. and Mota , E. 1990 . The capacitated arc routing problem. A heuristic algorithm . Qüestiió , 14 ( 1–3 ) : 107 – 122 .
  • Beullens , P. , Muyldermans , L. , Cattrysse , D. and Van Oudheusden , D. 2003 . A guided local search heuristic for the capacitated arc routing problem . European Journal of Operational Research , 147 ( 3 ) : 629 – 643 .
  • Brandão , J. and Eglese , R. 2008 . A deterministic tabu search algorithm for the capacitated arc routing problem . Computers & Operations Research , 35 ( 4 ) : 1112 – 1126 .
  • Chapleau , L. , Ferland , J.A. , Lapalme , G. and Rousseau , J.M. 1984 . A parallel insert method for the capacitated arc routing problem . Operations Research Letters , 3 ( 2 ) : 95 – 99 .
  • Chiang , T.C. and Fu , L.C. 2008 . A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop . International Journal of Production Research , 46 ( 24 ) : 6913 – 6931 .
  • Corberán , A. and Prins , C. 2010 . Recent results on arc routing problems: An annotated bibliography . Networks , 56 ( 1 )
  • Eglese , R.W. 1994 . Routeing winter gritting vehicles . Discrete Applied Mathematics , 48 ( 3 ) : 231 – 244 .
  • Franca , P.M. , Tin , G. Jr and Buriol , L.S. 2006 . Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions . International Journal of Production Research , 44 ( 5 ) : 939 – 957 .
  • Frederickson , G. 1979 . Approximation algorithms for some postman problems . Journal of the ACM , 26 ( 3 ) : 538 – 554 .
  • Fung, R.Y.K., Liu, R. & Z. Jiang. 2013. “A memetic algorithm for the open capacitated arc routing problem.” Transportation Research Part E: Logistics and Transportation Review. doi: 10.1016/j.tre.2012.11.003
  • Golden , B.L. and Wong , R.T. 1981 . Capacitated arc routing problems . Networks , 11 ( 3 ) : 305 – 315 .
  • Golden , J.S. , Dearmon , J.S. and Baker , E.K. 1983 . Computational experiments with algorithms for a class of routing problems . Computers & Operations Research , 10 ( 1 ) : 47 – 59 .
  • Hertz , A. , Laporte , G. and Mittaz , M. 2000 . A tabu search heuristic for the capacitated arc routing problem . Operations Research , 48 ( 1 ) : 129 – 135 .
  • Hertz , A. and Mittaz , M. 2001 . A variable neighborhood descent algorithm for the undirected capacitated arc routing problem . Transportation Science , 35 ( 4 ) : 425 – 434 .
  • Lacomme, P., C. Prins, and W. Ramdane-Cherif. 2001. A genetic algorithm for the capacitated arc routing problem and its extensions. In Boers, E.J.W. ed. Applications of evolutionary computing. Springer, 473–483.
  • Lacomme , P. , Prins , C. and Ramdane-Cherif , W. 2004 . Competitive memetic algorithms for arc routing problems . Annals of Operations Research , 131 ( 1 ) : 159 – 185 .
  • Liu, T., Jiang, Z., Chen, F., Liu, R. & S. Liu. 2008. Combined location-arc routing problems: A survey and suggestions for future researched.^eds. 2008 IEEE International Conference on Service Operations and Logistics, and Informatics(SOLI'2008), Beijing: IEEE, 2336–2341.
  • Lourenço , H. , Martin , O. and Stützle , T. 2003 . “ Iterated local search ” . In Handbook of metaheuristics , Edited by: Glover , F. and Kochenberger , G. 320 – 353 . Boston : Kluwer .
  • Mendoza , J.E. , Castanier , B. , Guéret , C. , Medaglia , A.L. and Velasco , N. 2010 . A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands . Computers & Operations Research , 37 ( 11 ) : 1886 – 1898 .
  • Moscato , P. 1989 . On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms . Caltech Concurrent Computation Program, C3P. Report , 826 : 1989
  • Naderi , B. , Zandieh , M. and Ghomi , S.M.T.F. 2009 . Scheduling job shop problems with sequence-dependent setup times . International Journal of Production Research , 47 ( 21 ) : 5959 – 5976 .
  • Nagata , Y. , Bräysy , O. and Dullaert , W. 2010 . A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows . Computers & Operations Research , 37 ( 4 ) : 724 – 737 .
  • Pearn , W. 1989 . Approximate solutions for the capacitated arc routing problem . Computers & Operations Research , 16 ( 6 ) : 589 – 600 .
  • Pearn , W. 1991 . Augment-insert algorithms for the capacitated arc routing problem . Computers & Operations Research , 18 ( 2 ) : 189 – 198 .
  • Polacek , M. , Doerner , K.F. , Hartl , R.F. and Maniezzo , V. 2008 . A variable neighborhood search for the capacitated arc routing problem with intermediate facilities . Journal of Heuristics , 14 ( 5 ) : 405 – 423 .
  • Prins , C. 2004 . A simple and effective evolutionary algorithm for the vehicle routing problem . Computers & Operations Research , 31 ( 12 ) : 1985 – 2002 .
  • Santos , L. , Coutinho-Rodrigues , J. and Current , J. 2010 . An improved ant colony optimization based algorithm for the capacitated arc routing problem . Transportation Research Part B: Methodological , 44 ( 2 ) : 246 – 266 .
  • Ulusoy , G. 1985 . The fleet size and mix problem for capacitated arc routing . European Journal of Operational Research , 22 ( 3 ) : 329 – 337 .
  • Usberti, F.L., P.M. França and A.L.M. França. 2012. “Grasp with evolutionary path-relinking for the capacitated arc routing problem.” Computers & Operations Research. doi: 10.1016/j.cor.2011.10.014.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.