Artificial Intelligence for Picking Up Recycling Bins: A Practical Application

  • Maria Luisa Pérez-Delgado
  • Juan C. Matos-Franco
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 55)


In this paper we address the problem of waste recycling in the province of Zamora. The recycling process requires the collection of the waste in an efficient way. This leads to the mathematical problem of vehicle routing, or some particular case of it, to define the optimal paths to collect the waste. This paper presents the application of artificial ants to plan the path to empty the recycling bins of a town called Toro, in the province of Zamora.


Recycling Mixed Rural Postman Problem Artificial Ants 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    World Bank home page,
  2. 2.
    Steiner, M., Wiegel, U.: The book of rubbish... A guide to the basics of waste management. Report: Waste training projectGoogle Scholar
  3. 3.
    Plan para la gestión y tratamiento integral de residuos de la provincia de Zamora. Memoria Divulgativa. Diputación de ZamoraGoogle Scholar
  4. 4.
    Deneubourg, J.L., Aron, S., Goss, S., Pasteels, J.M.: The self-organizing exploratory pattern of the argentine ant. J. Insect Behav. 3, 159–168 (1990)CrossRefGoogle Scholar
  5. 5.
    Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)zbMATHGoogle Scholar
  6. 6.
    Dorigo, M., Gambardella, L.M.: Ant Colony System: A cooperative learning approach to the Travelling Salesman Problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)CrossRefGoogle Scholar
  7. 7.
    Reinelt, G.: The Traveling Salesman. LNCS, vol. 840. Springer, Heidelberg (1994)zbMATHGoogle Scholar
  8. 8.
    Toth, P., Vigo, D.: The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Society for Industrial & Applied Mathematics, Philadelphia (2001)Google Scholar
  9. 9.
    Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP completeness. W.H.Freeman & Co., New York (1979)zbMATHGoogle Scholar
  10. 10.
    Bullnheimer, B., Hartl, R., Strauss, C.: Applying the Ant System to the vehicle routing problem. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 285–296. Kluwer Academic Publisher, Dordrecht (1999)Google Scholar
  11. 11.
    Karadimas, N., Kouzas, G., Anagnostopoulos, I., Loumos, V.: Urban solid waste collection and routing: The ant colony strategic approach. International Journal of Simulation: Systems, Science, Technology 6, 45–53 (2005)Google Scholar
  12. 12.
    Karadimas, N., Papatzelou, K., Loumos, V.: Optimal solid waste collection routes identified by the ant colony system algorithm. Waste Management & Research 25, 139–147 (2007)CrossRefGoogle Scholar
  13. 13.
    Beltrani, E., Bodin, L.: Networks and vehicle routing for municipal waste collection. J. Networks 4(1), 6–94 (1974)Google Scholar
  14. 14.
    Orloff, C.S.: A fundamental problem in vehicle routing. Networks 4, 35–64 (1974)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Lenstra, J.K., Rinnooy-Kan, A.H.G.: On the general routing problem. Networks 6(3), 273–280 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Pérez-Delgado, M.L.: A Solution to the Rural Postman Problem Based on Artificial Ant Colonies. In: Borrajo, D., Castillo, L., Corchado, J.M. (eds.) CAEPIA 2007. LNCS (LNAI), vol. 4788, pp. 220–228. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Maria Luisa Pérez-Delgado
    • 1
  • Juan C. Matos-Franco
    • 1
  1. 1.Departamento Informática y AutomáticaUniversidad de Salamanca, Escuela Politécnica Superior de ZamoraZamoraSpain

Personalised recommendations