Using Ant Colony Optimization to solve Periodic Arc Routing Problem with Refill Points

References

• Ahr, D. and G. Reinelt, “A tabu search algorithm for the min-max k-Chinese postman problem,” Computers & Operations Research, 33, 3403–3422 (2006).
   Web of Science ®Google Scholar
• Aminu, U. F. and R. W. Eglese, “A constraint programming approach to the Chinese postman problem with time windows,” Computers & Operations Research, 33, 3423–3431 (2006).
   Web of Science ®Google Scholar
• Angelelli, E. and M. G. Grazia Speranza, “The periodic vehicle routing problem with intermediate facilities,” European Journal of Operational Research, 137, 233–247 (2002).10.1016/S0377-2217(01)00206-5
   Web of Science ®Google Scholar
• Assad, A. A. and B. L. Golden, “Arc routing methods and applications,” in Ball, M., T. Magnanti, C. Monma and G. Nemhauser (eds), Handbooks in Operations Research and Management Science, 8: Network Routing, Elsevier, Amsterdam, 375–483 (1995).
   Google Scholar
• Balseiro, S. R., I. Loiseau and J. Ramonet, “An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows,” Computers & Operations Research, 38, 954–966 (2011).
   Web of Science ®Google Scholar
• Bautista, J. and J. Pereira, “Ant algorithms for urban waste collection routing,” Lecture Notes in Computer Science, 3172, 302–309 (2004).10.1007/b99492
   Google Scholar
• Bautista, J., E. Fernández and J. Pereira, “Solving an urban waste collection problem using ants heuristics,” Computers & Operations Research, 35, 3020–3033 (2008).
   Web of Science ®Google Scholar
• Belenguer, J. M. and E. Benavent, “A cutting plane algorithm for the capacitated arc routing problem,” Computers & Operations Research, 30, 705–728 (2003).
   Web of Science ®Google Scholar
• Chu, F., N. Labadi and C. Prins, “A scatter search for the periodic capacitated arc routing problem,” European Journal of Operational Research, 169, 586–605 (2006).10.1016/j.ejor.2004.08.017
   Web of Science ®Google Scholar
• Chu, F., N. Labadi and C. Prins, “Heuristics for the periodic capacitated arc routing problem,” Journal of Intelligent Manufacturing, 16, 243–251 (2005).10.1007/s10845-004-5892-8
   Web of Science ®Google Scholar
• DeArmon, J., A Comparison of Heuristics for the Capacitated Chinese Postman Problem, MSc thesis, University of Maryland, College Park, MD, USA (1981).
   Google Scholar
• Doerner, K., R. F. Hartl, V. Maniezzo and M. Reimann, “An ant system metaheuristic for the capacitated arc routing problem”, presented at the fifth Metaheuristics International Conference, Kyoto, Japan (2003).
   Google Scholar
• Doerner, K. F., R. F. Hartl, V. Maniezzo and M. Reimann, “Applying ant colony optimization to the capacitated arc routing problem,” Lecture Notes in Computer Science, 3172, 420–421 (2004).10.1007/b99492
   Google Scholar
• Dorigo, M. and C. Blum, “Ant colony optimization theory: A survey,” Theoretical Computer Science, 344, 243–278 (2005).10.1016/j.tcs.2005.05.020
   Web of Science ®Google Scholar
• Dorigo, M. and T. Stützle, Ant Colony Optimization, MIT Press, Cambridge, MA (2004).10.1007/b99492
   Google Scholar
• Dorigo, M., Optimization, Learning and Natural Algorithms (in Italian), PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, (1992).
   Google Scholar
• Dorigo, M., V. Maniezzo and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 26, 29–41 (1996).10.1109/3477.484436
   PubMed Web of Science ®Google Scholar
• Eiselt, H. A., M. Gendreau and G. Laporte, “Arc routing problems, part I: The Chinese postman problem,” Operations Research, 43, 231–242 (1995).10.1287/opre.43.2.231
   Web of Science ®Google Scholar
• Eiselt, H. A., M. Gendreau and G. Laporte, “Arc routing problems, part II: The rural postman problem,” Operations Research, 43, 399–414 (1995).10.1287/opre.43.3.399
   Web of Science ®Google Scholar
• Gambardella, L. M., E. Taillard and G. Agazzi, “MACS-VRPTW: A multiple colony system for vehicle routing problems with time windows,” in Corne, D., M. Dorigo and F. Glover (eds), New Ideas in Optimization, McGraw-Hill, London, 63–76 (1999).
   Google Scholar
• Ghiani, G., D. Lagana and R. Musmanno, “A constructive heuristic for the undirected rural postman problem,” Computers & Operations Research, 33, 3450–3457 (2006).
   Web of Science ®Google Scholar
• Ghiani, G., D. Lagana, G. Laporte and F. Mari, “Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions,” Journal of Heuristics, 16, 211–233 (2010).10.1007/s10732-008-9097-8
   Web of Science ®Google Scholar
• Ghiani, G., F. Guerriero, G. Laporte and R. Musmanno, “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).10.1023/B:JMMA.0000038618.37710.f8
   Google Scholar
• Ghiani, G., R. Musmanno, G. Paletta and C. Triki, “A heuristic for the periodic rural postman problem,” Computers & Operations Research, 32, 219–228 (2005).
   Web of Science ®Google Scholar
• Golden, B. L. and R. Wong, “Capacitated arc routing problems,” Networks, 11, 305–315 (1981).10.1002/(ISSN)1097-0037
   Web of Science ®Google Scholar
• Golden, B. L., J. S. DeArmon and E. K. Baker, “Computational experiments with algorithms for a class of routing problems,” Computers & Operations Research, 10, 47–59 (1983).
   Web of Science ®Google Scholar
• Hertz, A., G. Laporte and M. Mittaz, “A tabu search heuristic for the capacitated arc routing problem,” Operations Research, 48, 129–135 (2000).10.1287/opre.48.1.129.12455
   Web of Science ®Google Scholar
• Hirabayashi, R., N. Nishida and Y. Saruwatari, “Tour construction algorithm for the capacitated arc routing problem,” Asia-Pacific Journal of Operational Research, 9, 155–175 (1992).
   Web of Science ®Google Scholar
• Huang, S. H. and P. C. Lin, “A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty,” Transportation Research Part E: Logistics and Transportation Review, 46, 598–611 (2010).10.1016/j.tre.2010.01.006
   Web of Science ®Google Scholar
• Kwan, M. K., “Graphic programming using odd or even points,” Chinese Mathematics, 1, 273–277 (1962).
   Google Scholar
• Lacomme, P., C. Prins and A. Tanguy, “First competitive ant colony scheme for the CARP,” Lecture Notes in Computer Science, 3172, 426–427 (2004).10.1007/b99492
   Google Scholar
• Lacomme, P., C. Prins and W. Ramdane-Cherif, “Evolutionary algorithms for periodic arc routing problems,” European Journal of Operational Research, 165, 535–553 (2005).10.1016/j.ejor.2004.04.021
   Web of Science ®Google Scholar
• Laporte, G., “Modeling and solving several classes of arc routing problems as traveling salesman problems,” Computers & Operations Research, 24, 1057–1061 (1997).
   Web of Science ®Google Scholar
• Longo, H., M. P. de Aragão and E. Uchoa, “Solving capacitated arc routing problems using a transformation to the CVRP,” Computers & Operations Research, 33, 1823–1837 (2006).
   Web of Science ®Google Scholar
• Mei, Y., K. Tang and X. Yao, “A memetic algorithm for periodic capacitated arc routing problem,” IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 41, 1654–1667 (2011).10.1109/TSMCB.2011.2158307
   Web of Science ®Google Scholar
• Pearn, W. L., A. A. Assad and B. L. Golden, “Transforming arc routing into node routing problems,” Computers & Operations Research, 14, 285–288 (1987).
   Web of Science ®Google Scholar
• Polacek, M., K. F. Doerner, R. F. Hartl and V. Maniezzo, “A variable neighborhood search for the capacitated arc routing problem with intermediate facilities,” Journal of Heuristics, 14, 405–423 (2008).10.1007/s10732-007-9050-2
   Web of Science ®Google Scholar
• Wølk, S., “A decade of capacitated arc routing,” in Golden, B. L., S. Raghavan and E. A. Wasil (eds), The Vehicle Routing Problem: Latest Advances and New Challenges, Springer, New York, NY, 29–48 (2007).
   Google Scholar
• Yu, B. and Z. Z. Yang, “An ant colony optimization model: The period vehicle routing problem with time windows,” Transportation Research Part E: Logistics and Transportation Review, 47, 166–181 (2011).10.1016/j.tre.2010.09.010
   Web of Science ®Google Scholar