Advertisement

Ant Algorithms for Urban Waste Collection Routing

  • Joaquín Bautista
  • Jordi Pereira
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3172)

Abstract

Problems arising on Urban Waste Management are broad and varied. This paper is focused on designing collection routes for urban wastes, a problem existing in most European waste collection systems. The relationship between the real world problem and the Arc Routing literature is established, and the Capacitated Arc Routing Problem is extended to comply with traffic rules. Afterwards, an Ant Algorithm is designed to solve this problem, and its efficiency is tested using the instance sets from the CARP literature and a set of real life instances from the Metropolitan Area of Barcelona. Finally, the integration between the proposed algorithms and a Decision Support System for Urban Waste Management is shown.

Keywords

Vehicle Route Problem Candidate List Vehicle Route Local Search Procedure Urban Waste 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bautista, J.: Proyecto integral de gestión de residuos urbanos en el municipio de Sant Boi de Llobregat CPDA Barcelona (2001)Google Scholar
  2. 2.
    Belenger, J.M., Benavent, E.: A cutting plane algorithm for the capacitated arc routing problem. Computers and Operations Research 30, 705–728 (2003)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Beltrami, E., Bodin, L.: Networks and vehicle routing for municipal waste collection. Networks 4(1), 65–94 (1974)zbMATHCrossRefGoogle Scholar
  4. 4.
    Benavent, E., Campos, A., Corberán, A., Mota, E.: The capacitated arc routing problem: Lower bounds. Networks 22(4), 669–690 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Corberán, A., Martí, R., Martínez, E., Soler, D.: The Rural Postman Problem on Mixed Graphs with turn penalties. Computers and Operations Research 29, 887–903 (2002)zbMATHCrossRefGoogle Scholar
  6. 6.
    Christofides, N.: The optimum traversal of a graph. Omega 1(6), 719–732 (1973)CrossRefGoogle Scholar
  7. 7.
    Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Technical Report 91-016, Dip. Elettronica, Politecnico di Milano, Italy (1991)Google Scholar
  8. 8.
    Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man and Cybernetics - Part B 26(1), 29–41 (1996)CrossRefGoogle Scholar
  9. 9.
    Dror, M. (ed.): Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Dordrecht (2000)zbMATHGoogle Scholar
  10. 10.
    Fischer, M., Meier, B., Teich, T., Vogel, A.: Inner city disposal of waste with ant colony optimization. In: Dorigo, et al. (eds.) Proceedings of ANTS’2000 - From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms, Brussels, Belgium, September 7-9, pp. 51–58 (2000)Google Scholar
  11. 11.
    Golden, B.L., DeArmon, J.S., Baker, E.K.: Computational experiments with algorithms for a class of routing problems. Computers and Operations Research 11(1), 49–66 (1983)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Guntsch, M., Middendorf, M.: A population based approach for ACO. LNCS, vol. 2037, pp. 72–81 (2002)Google Scholar
  13. 13.
    Hertz, A., Laporte, G., Mittaz, M.: A Tabu Search heuristic for the capacitated arc routing problem. Operations Research 48(1), 129–135 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Hertz, A., Laporte, G., Nanchen, P.: Improvement procedures for the undirected rural postman problem. INFORMS Journal of Computing 11, 53–62 (1999)zbMATHCrossRefGoogle Scholar
  15. 15.
    Hirabayashi, R., Saruwatari, Y., Nishida, N.: Tour construction algorithm for the capacitated arc routing problems. Asia Pacific Journal of Operations Research 9(2), 155–175 (1992)zbMATHMathSciNetGoogle Scholar
  16. 16.
    Lacomme, P., Prins, C., Ramdane-Chérif, W.: A genetic algorithm for the capacitated arc routing problem and its extensions. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, p. 473. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  17. 17.
    Laporte, G., Mercure, H., Nobert, Y.: A branch and bound algorithm for a class of Assymmetrical Vehicle Routeing Problems. Journal of the Operational Research Society 43(5), 469–481 (1992)zbMATHGoogle Scholar
  18. 18.
    Li, L.Y.O., Eglese, R.W.: An interactive Algorithm for Vehicle Routing for Winter-Gritting. Journal of the Operational Research Society 47, 217–228 (1996)Google Scholar
  19. 19.
    Pearn, W.L.: Augment algorithms for the capacitated arc routing problem. Computers and Operations Research 18(2), 189–198 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Pereira, J.: Modelización y resolución de problemas de diseño de sistemas de recogida de residuos urbanos Unpublished Ph.D. Thesis, UPC (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Joaquín Bautista
    • 1
  • Jordi Pereira
    • 1
  1. 1.Escola Politècnica Superior d’Edificació de BarcelonaBarcelonaSpain

Personalised recommendations