Skip to main content
SpringerLink
Log in

Ant Algorithms for Urban Waste Collection Routing

  • Conference paper
Book cover Ant Colony Optimization and Swarm Intelligence (ANTS 2004)

Part of the book series: Lecture Notes in Computer Science ((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.

This research has been partially funded by BEC2003-03809 Grant.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Belenger, J.M., Benavent, E.: A cutting plane algorithm for the capacitated arc routing problem. Computers and Operations Research 30, 705–728 (2003)

    Article  MathSciNet  Google Scholar 

  3. Beltrami, E., Bodin, L.: Networks and vehicle routing for municipal waste collection. Networks 4(1), 65–94 (1974)

    Article  MATH  Google Scholar 

  4. Benavent, E., Campos, A., Corberán, A., Mota, E.: The capacitated arc routing problem: Lower bounds. Networks 22(4), 669–690 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  6. Christofides, N.: The optimum traversal of a graph. Omega 1(6), 719–732 (1973)

    Article  Google Scholar 

  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. 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)

    Article  Google Scholar 

  9. Dror, M. (ed.): Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Dordrecht (2000)

    MATH  Google Scholar 

  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. 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)

    Article  MathSciNet  Google Scholar 

  12. Guntsch, M., Middendorf, M.: A population based approach for ACO. LNCS, vol. 2037, pp. 72–81 (2002)

    Google Scholar 

  13. Hertz, A., Laporte, G., Mittaz, M.: A Tabu Search heuristic for the capacitated arc routing problem. Operations Research 48(1), 129–135 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  14. Hertz, A., Laporte, G., Nanchen, P.: Improvement procedures for the undirected rural postman problem. INFORMS Journal of Computing 11, 53–62 (1999)

    Article  MATH  Google Scholar 

  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)

    MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    MATH  Google Scholar 

  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. Pearn, W.L.: Augment algorithms for the capacitated arc routing problem. Computers and Operations Research 18(2), 189–198 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Escola Politècnica Superior d’Edificació de Barcelona, Avda. Grergorio Marañón 44, 08028, Barcelona, Spain

    Joaquín Bautista & Jordi Pereira

Authors
  1. Joaquín Bautista
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jordi Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium

    Marco Dorigo  & Mauro Birattari  & 

  2. ALBCOM, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain

    Christian Blum

  3. Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA), Lugano, Switzerland

    Luca Maria Gambardella

  4. LSRO, Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

    Francesco Mondada

  5. IRIDIA, CoDE, Université Libre de Bruxelles, Avenue F. Roosevelt 50 CP 194/6, 1050, Brussels, Belgium

    Thomas Stützle

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bautista, J., Pereira, J. (2004). Ant Algorithms for Urban Waste Collection Routing. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2004. Lecture Notes in Computer Science, vol 3172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28646-2_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28646-2_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22672-7

  • Online ISBN: 978-3-540-28646-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation