IDEAS home Printed from https://ideas.repec.org/a/gam/jlogis/v7y2023i3p54-d1218769.html
   My bibliography  Save this article

Waste Collection Optimisation: A Path to a Green and Sustainable City of Makkah

Author

Listed:
  • Haneen Algethami

    (Computer Science Department, College of Computers and Information Technology, Taif University, Taif 21944, Saudi Arabia
    These authors contributed equally to this work.)

  • Ghada Talat Alhothali

    (Marketing Department, College of Business, University of Jeddah, Jeddah 23218, Saudi Arabia
    These authors contributed equally to this work.)

Abstract

Background : Saudi Arabia is a leading country endorsing a sustainable future, from policymaking and investment to infrastructure development. One of the rising concerns in Saudi Arabia's Vision 2030 is solid waste management, especially in Makkah. The Solid Waste Collection Problem (SWCP) refers to the route optimisation of waste collection trucks visiting containers across various locations. Manually generated routes might contain some mistakes, and constructing and revising designed solutions can take a long time. Thus, there is a need to find optimal and fast solutions to this problem. Solving this problem demands tackling numerous routing constraints while aiming to minimise the operational cost. Since solid waste has a significant impact on the environment, reducing fuel consumption must be an objective. Methods : Thus, a mixed-integer programming model is proposed in this paper while using the time-oriented nearest neighbour heuristic. The goal is to investigate their performance on nine existing instances of SWCP in the city of Makkah. The proposed model is implemented in the Gurobi solver. The time-oriented nearest neighbour heuristic constructs the initial solution and is then re-optimised using Google OR-tools. Results : Using the greedy method to construct a solution for this problem generated better solutions when compared to the results obtained without the greedy method. Computational times are also improved by 55.7% on the problem instances. Conclusions : The findings confirm the competitive performance of the proposed method in terms of computational times and solution quality.

Suggested Citation

  • Haneen Algethami & Ghada Talat Alhothali, 2023. "Waste Collection Optimisation: A Path to a Green and Sustainable City of Makkah," Logistics, MDPI, vol. 7(3), pages 1-10, August.
    • Handle: RePEc:gam:jlogis:v:7:y:2023:i:3:p:54-:d:1218769
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2305-6290/7/3/54/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2305-6290/7/3/54/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Hailin Wu & Fengming Tao & Bo Yang, 2020. "Optimization of Vehicle Routing for Waste Collection and Transportation," IJERPH, MDPI, vol. 17(14), pages 1-26, July.
    2. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    3. Gayialis, Sotiris P. & Tatsiopoulos, Ilias P., 2004. "Design of an IT-driven decision support system for vehicle routing and scheduling," European Journal of Operational Research, Elsevier, vol. 152(2), pages 382-398, January.
    4. Brian Kallehauge & Jesper Larsen & Oli B.G. Madsen & Marius M. Solomon, 2005. "Vehicle Routing Problem with Time Windows," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 67-98, Springer.
    5. Samanlioglu, Funda, 2013. "A multi-objective mathematical model for the industrial hazardous waste location-routing problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 332-340.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ghada Talat Alhothali & Felix T. Mavondo & Bader A. Alyoubi & Haneen Algethami, 2024. "Consumer Acceptance of Drones for Last-Mile Delivery in Jeddah, Saudi Arabia," Sustainability, MDPI, vol. 16(13), pages 1-21, June.
    2. Marco Boresta & Anna Livia Croella & Claudio Gentile & Laura Palagi & Diego Maria Pinto & Giuseppe Stecca & Paolo Ventura, 2024. "Optimal Network Design for Municipal Waste Management: Application to the Metropolitan City of Rome," Logistics, MDPI, vol. 8(3), pages 1-15, August.
    3. Adriana Scrioșteanu & Maria Magdalena Criveanu, 2024. "Green and Reserve Logistics of Packaging and Plastic Packaging Waste under the Conditions of Circular Economy at the Level of the European Union Member States," Energies, MDPI, vol. 17(12), pages 1-19, June.
    4. Józef Ciuła & Elżbieta Sobiecka & Tomasz Zacłona & Paulina Rydwańska & Aneta Oleksy-Gębczyk & Tomasz P. Olejnik & Sławomir Jurkowski, 2024. "Management of the Municipal Waste Stream: Waste into Energy in the Context of a Circular Economy—Economic and Technological Aspects for a Selected Region in Poland," Sustainability, MDPI, vol. 16(15), pages 1-25, July.

    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. Danışment Vural & Robert F. Dell & Erkan Kose, 2021. "Locating unmanned aircraft systems for multiple missions under different weather conditions," Operational Research, Springer, vol. 21(1), pages 725-744, March.
    2. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.
    3. Eric Prescott-Gagnon & Guy Desaulniers & Michael Drexl & Louis-Martin Rousseau, 2010. "European Driver Rules in Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 44(4), pages 455-473, November.
    4. Theodore Athanasopoulos & Ioannis Minis, 2013. "Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework," Annals of Operations Research, Springer, vol. 206(1), pages 1-22, July.
    5. Guy Desaulniers & François Lessard & Ahmed Hadjar, 2008. "Tabu Search, Partial Elementarity, and Generalized k -Path Inequalities for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 42(3), pages 387-404, August.
    6. S. Irnich, 2008. "A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 270-287, May.
    7. Edirisinghe, N.C.P. & James, R.J.W., 2014. "Fleet routing position-based model for inventory pickup under production shutdown," European Journal of Operational Research, Elsevier, vol. 236(2), pages 736-747.
    8. Gondzio, Jacek & González-Brevis, Pablo & Munari, Pedro, 2013. "New developments in the primal–dual column generation technique," European Journal of Operational Research, Elsevier, vol. 224(1), pages 41-51.
    9. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti, 2011. "New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1269-1283, October.
    10. J. Arturo Castillo-Salazar & Dario Landa-Silva & Rong Qu, 2016. "Workforce scheduling and routing problems: literature survey and computational study," Annals of Operations Research, Springer, vol. 239(1), pages 39-67, April.
    11. Christian Fikar & Patrick Hirsch, 2018. "Evaluation of trip and car sharing concepts for home health care services," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 78-97, June.
    12. Mads Jepsen & Bjørn Petersen & Simon Spoorendonk & David Pisinger, 2008. "Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows," Operations Research, INFORMS, vol. 56(2), pages 497-511, April.
    13. Arroyo, Federico, 2024. "Cost Allocation in Vehicle Routing Problems with Time Windows," Junior Management Science (JUMS), Junior Management Science e. V., vol. 9(1), pages 1241-1268.
    14. Yi-Kuei Lin & Cheng-Fu Huang & Yi-Chieh Liao, 2019. "Reliability of a stochastic intermodal logistics network under spoilage and time considerations," Annals of Operations Research, Springer, vol. 277(1), pages 95-118, June.
    15. Zhang, Ying & Qi, Mingyao & Miao, Lixin & Liu, Erchao, 2014. "Hybrid metaheuristic solutions to inventory location routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 305-323.
    16. Michal Košíček & Radek Tesař & František Dařena & Roman Malo & Arnošt Motyčka, 2012. "Route planning module as a part of Supply Chain Management system," Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, Mendel University Press, vol. 60(2), pages 135-142.
    17. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    18. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    19. Cheng, Chun & Adulyasak, Yossiri & Rousseau, Louis-Martin, 2020. "Drone routing with energy function: Formulation and exact algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 364-387.
    20. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.

    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:jlogis:v:7:y:2023:i:3:p:54-:d:1218769. 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.