Free Access
RAIRO-Oper. Res.
Volume 55, Number 2, March-April 2021
Page(s) 639 - 652
Published online 31 March 2021
  • R.K. Arakaki and F.L. Usberti, Hybrid genetic algorithm for the open capacitated arc routing problem. Comput. Oper. Res. 90 (2018) 221–231. [Google Scholar]
  • E. Benavent, V. Campos, A. Corberán and E. Mota, The capacitated arc routing problem: lower bounds. Networks 22 (1992) 669–690. [Google Scholar]
  • A. Colorni, M. Dorigo and V. Maniezzo, Distributed optimization by ant colonies (1991) 134–142. [Google Scholar]
  • T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 3rd edition. The MIT Press (2009). [Google Scholar]
  • M. Dorigo, V. Maniezzo and A. Colorni, Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 26 (1996) 29–41. [Google Scholar]
  • R.W. Eglese, Routing winter gritting vehicles. Disc. Appl. Math. 48 (1994) 231–244. [Google Scholar]
  • B.L. Golden and R.T. Wong, Capacitated arc routing problems. Networks 11 (1981) 305–315. [Google Scholar]
  • B.L. Golden, J.S. Dearmon and E.K. Baker, Computational experiments with algorithms for a class of routing problems. Comput. Oper. Res. 10 (1983) 47–59. [Google Scholar]
  • S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing. Science 220 (1983) 671–680. [Google Scholar]
  • P. Lacomme, C. Prins and W. Ramdane-Ch′erif, Evolutionary algorithms for periodic arc routing problems. Eur. J. Oper. Res. 165 (2005) 535–553. Project Management and Scheduling. [Google Scholar]
  • L. Muyldermans and G. Pang, A guided local search procedure for the multi-compartment capacitated arc routing problem. Comput. Oper. Res. 37 (2010) 1662–1673. [Google Scholar]
  • I.H. Osman and C.N. Potts, Simulated annealing for permutation flow-shop scheduling. Omega 17 (1989) 551–557. [Google Scholar]
  • L. Santos, J. Coutinho-Rodrigues and J.R. Current, An improved ant colony optimization based algorithm for the capacitated arc routing problem. Trans. Res. B: Methodol. 44 (2010) 246–266. [Google Scholar]
  • H.I. Stern and M. Dror, Routing electric meter readers. Comput. Oper. Res. 6 (1979) 209–223. [Google Scholar]
  • T. Stutzle and M. Dorigo, A short convergence proof for a class of ant colony optimization algorithms. IEEE Trans. Evol. Comput. 6 (2002) 358–365. [Google Scholar]
  • G. Ulusoy, The fleet size and mix problem for capacitated arc routing. Eur. J. Oper. Res. 22 (1985) 329–337. [Google Scholar]
  • F.L. Usberti, P.M. França and A.L.M. França, The open capacitated arc routing problem. Comput. Oper. Res. 38 (2011) 1543–1555. [Google Scholar]
  • F.L. Usberti, P.M. França and A.L.M. França, Branch-and-bound algorithm for an arc routing problem. Annals XLIV SBPO, Rio de Janeiro (2012). [Google Scholar]
  • F.L. Usberti, P.M. França and A.L.M. França, Grasp with evolutionary path-relinking for the capacitated arc routing problem. Comput. Oper. Res. 40 (2013) 3206–3217. [Google Scholar]
  • P.J.M. van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing. Oper. Res. 40 (1992) 113–125. [Google Scholar]
  • J. Wunderlich, M. Collette, L. Levy and L. Bodin, Scheduling meter readers for Southern California gas company. INFORMS J. Appl. Anal. 22 (1992) 22–30. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.