IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v16y2024i13p5660-d1427699.html
   My bibliography  Save this article

A Heuristic Procedure for Improving the Routing of Urban Waste Collection Vehicles Using ArcGIS

Author

Listed:
  • Israel D. Herrera-Granda

    (Facultad de Ciencias Administrativas, Escuela Politécnica Nacional, Quito 170525, Ecuador
    Programa de Doctorado en Ingeniería y Producción Industrial, Escuela de Doctorado, Universitat Politècnica de València, Camino de Vera S/N 46022, 46022 València, Spain)

  • Jaime Cadena-Echeverría

    (Facultad de Ciencias Administrativas, Escuela Politécnica Nacional, Quito 170525, Ecuador)

  • Juan C. León-Jácome

    (Independant Researcher, Quito 170525, Ecuador)

  • Erick P. Herrera-Granda

    (Department of Mathematics, Escuela Politécnica Nacional, Ladrón de Guevara E11-235, Quito 170525, Ecuador)

  • Danilo Chavez Garcia

    (DACI, Departamento de Automatización y Control Industrial, Escuela Politécnica Nacional, Quito 170525, Ecuador)

  • Andrés Rosales

    (GIECAR, Departamento de Automatización y Control Industrial, Escuela Politécnica Nacional, Quito 170525, Ecuador
    Escuela de Ciencias Matemáticas y Computacionales, Universidad de Investigación de Tecnología Experimental Yachay, Urcuquí 100115, Ecuador)

Abstract

This paper proposes a heuristic procedure created to improve the collection routes obtained with the support of the ArcGIS software and its complement, Network Analyst. After a series of experiments, it was found that the software presents several inconsistencies with logistical and operational management concepts, such as the unnecessary realization of U-turns in a dead end and unnecessary access to areas with difficult access to a single customer. These are issues that a collection route planner must consider to make a good decision that considers the cost of visiting areas with difficult access and the benefits of reaching that area. In this sense, our heuristic procedure considers a set of best practices in operational and logistical strategies that could be programmed within the Network Analyst. As it is well known in the science of vehicle routing, U-turns and sub-tours in the routes travelled by vehicles increase distances and operating costs, so in our work, we propose a systematic heuristic procedure to reduce the number of U-turns performed by a municipal waste collection truck, while using the ArcGIS-Network Analyst add-on to reduce the number of sub-tours in the route under the Directed-Capacitated Arc Routing Problem approach. It is then shown how the routes improved using our conceptual heuristic procedure, which provides better quality than the original routes obtained with ArcGIS and Network Analyst. Specifically, reducing the total distances travelled by the vehicle fleet, increasing the coverage of sidewalks visited by the truck in the urban perimeter of a city, and minimizing the time used in municipal solid waste collection operations. The importance of our work lies in the fact that effective MSW management is an essential municipal service whose regulation can drive innovation, sustainability, and efficiency in the MSW sector.

Suggested Citation

  • Israel D. Herrera-Granda & Jaime Cadena-Echeverría & Juan C. León-Jácome & Erick P. Herrera-Granda & Danilo Chavez Garcia & Andrés Rosales, 2024. "A Heuristic Procedure for Improving the Routing of Urban Waste Collection Vehicles Using ArcGIS," Sustainability, MDPI, vol. 16(13), pages 1-23, July.
  • Handle: RePEc:gam:jsusta:v:16:y:2024:i:13:p:5660-:d:1427699
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/16/13/5660/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/16/13/5660/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. H. A. Eiselt & Michel Gendreau & Gilbert Laporte, 1995. "Arc Routing Problems, Part II: The Rural Postman Problem," Operations Research, INFORMS, vol. 43(3), pages 399-414, June.
    2. Surya Sahoo & Seongbae Kim & Byung-In Kim & Bob Kraas & Alexander Popov, 2005. "Routing Optimization for Waste Management," Interfaces, INFORMS, vol. 35(1), pages 24-36, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lin, Hung-Yueh & Chen, Guan-Hwa & Lee, Pei-Hao & Lin, Chun-Hsu, 2010. "An interactive optimization system for the location of supplementary recycling depots," Resources, Conservation & Recycling, Elsevier, vol. 54(10), pages 615-622.
    2. Pearce, Joshua M. & Johnson, Sara J. & Grant, Gabriel B., 2007. "3D-mapping optimization of embodied energy of transportation," Resources, Conservation & Recycling, Elsevier, vol. 51(2), pages 435-453.
    3. Corberan, A. & Sanchis, J. M., 1998. "The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra," European Journal of Operational Research, Elsevier, vol. 108(3), pages 538-550, August.
    4. Xiaoguang Bao & Xinhao Ni, 2024. "Approximation algorithms for two clustered arc routing problems," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-12, July.
    5. John Sniezek & Lawrence Bodin, 2006. "Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles," Annals of Operations Research, Springer, vol. 144(1), pages 33-58, April.
    6. Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.
    7. Vincent F. Yu & Panca Jodiawan & Shih-Wei Lin & Winy Fara Nadira & Anna Maria Sri Asih & Le Nguyen Hoang Vinh, 2024. "Using Simulated Annealing to Solve the Multi-Depot Waste Collection Vehicle Routing Problem with Time Window and Self-Delivery Option," Mathematics, MDPI, vol. 12(3), pages 1-22, February.
    8. Arbib, Claudio & Servilio, Mara & Archetti, Claudia & Speranza, M. Grazia, 2014. "The directed profitable location Rural Postman Problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 811-819.
    9. Akbari, Vahid & Salman, F. Sibel, 2017. "Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity," European Journal of Operational Research, Elsevier, vol. 257(2), pages 625-640.
    10. Benjamin T. Hazen & Joseph B. Skipper & Christopher A. Boone & Raymond R. Hill, 2018. "Back in business: operations research in support of big data analytics for operations and supply chain management," Annals of Operations Research, Springer, vol. 270(1), pages 201-211, November.
    11. Barbara De Rosa & Gennaro Improta & Gianpaolo Ghiani & Roberto Musmanno, 2002. "The Arc Routing and Scheduling Problem with Transshipment," Transportation Science, INFORMS, vol. 36(3), pages 301-313, August.
    12. Qing Li & Xiaoli Wu & Ki Ling Cheung, 2009. "Optimal Policies for Inventory Systems with Separate Delivery-Request and Order-Quantity Decisions," Operations Research, INFORMS, vol. 57(3), pages 626-636, June.
    13. Ghiani, Gianpaolo & Improta, Gennaro, 2000. "An efficient transformation of the generalized vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 11-17, April.
    14. Lawrence Bodin & Aristide Mingozzi & Roberto Baldacci & Michael Ball, 2000. "The Rollon–Rolloff Vehicle Routing Problem," Transportation Science, INFORMS, vol. 34(3), pages 271-288, August.
    15. Dewil, R. & Vansteenwegen, P. & Cattrysse, D. & Van Oudheusden, D., 2015. "A minimum cost network flow model for the maximum covering and patrol routing problem," European Journal of Operational Research, Elsevier, vol. 247(1), pages 27-36.
    16. Abdelkader Sbihi & Richard Eglese, 2010. "Combinatorial optimization and Green Logistics," Annals of Operations Research, Springer, vol. 175(1), pages 159-175, March.
    17. Angel Corberán & Gustavo Mejía & José M. Sanchis, 2005. "New Results on the Mixed General Routing Problem," Operations Research, INFORMS, vol. 53(2), pages 363-376, April.
    18. Jesica Armas & Peter Keenan & Angel A. Juan & Seán McGarraghy, 2019. "Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 135-162, February.
    19. Markov, Iliya & Varone, Sacha & Bierlaire, Michel, 2016. "Integrating a heterogeneous fixed fleet and a flexible assignment of destination depots in the waste collection VRP with intermediate facilities," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 256-273.
    20. Srimathy Mohan & Michel Gendreau & Jean-Marc Rousseau, 2008. "The Stochastic Eulerian Tour Problem," Transportation Science, INFORMS, vol. 42(2), pages 166-174, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:16:y:2024:i:13:p:5660-:d:1427699. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.