IDEAS home Printed from https://ideas.repec.org/a/arp/tjssrr/2018p695-700.html
   My bibliography  Save this article

Efficiency of Heuristic Algorithms in Solving Waste Collection Vehicle Routing Problem: A Case Study

Author

Listed:
  • Nur Azriati Mat*

    (Institute of Strategic Industrial Decision Modelling, School of Quantitative Sciences, College of Arts and Sciences, Universiti Utara Malaysia, Kedah, Malaysia)

  • Aida Mauziah Benjamin

    (Institute of Strategic Industrial Decision Modelling, School of Quantitative Sciences, College of Arts and Sciences, Universiti Utara Malaysia, Kedah, Malaysia)

  • Syariza Abdul-Rahman

    (Institute of Strategic Industrial Decision Modelling, School of Quantitative Sciences, College of Arts and Sciences, Universiti Utara Malaysia, Kedah, Malaysia)

Abstract

This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. In fact, these heuristics have been employed to solve several routing problems in past studies, but the performance of each heuristic has never been compared. Hence, this paper looked into the efficiency of these heuristics by testing them on a real case study of waste collection problem in a district located at the north of Peninsular Malaysia. Several solutions obtained from these heuristics were compared with solutions implemented by the waste collection company, especially in terms of the total distance travelled. As a result, the computational results exhibited that DIC generated the best solutions, when compared to other heuristics, with a 12% reduction of the total travel distance.

Suggested Citation

  • Nur Azriati Mat* & Aida Mauziah Benjamin & Syariza Abdul-Rahman, 2018. "Efficiency of Heuristic Algorithms in Solving Waste Collection Vehicle Routing Problem: A Case Study," The Journal of Social Sciences Research, Academic Research Publishing Group, pages 695-700:6.
    • Handle: RePEc:arp:tjssrr:2018:p:695-700
    as

    Download full text from publisher

    File URL: https://www.arpgweb.com/pdf-files/spi6.28.695-700.pdf
    Download Restriction: no
    File URL: https://www.arpgweb.com/journal/7/special_issue/12-2018/6/4
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Zanakis, Stelios H. & Evans, James R. & Vazacopoulos, Alkis A., 1989. "Heuristic methods and applications: A categorized survey," European Journal of Operational Research, Elsevier, vol. 43(1), pages 88-110, November.
    2. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    3. Robert M. Clark & James I. Gillean, 1975. "Analysis of Solid Waste Management Operations in Cleveland, Ohio: A Case Study," Interfaces, INFORMS, vol. 6(1-part-2), pages 32-42, November.
    4. Ribas, Imma & Companys, Ramon & Tort-Martorell, Xavier, 2011. "An iterated greedy algorithm for the flowshop scheduling problem with blocking," Omega, Elsevier, vol. 39(3), pages 293-301, June.
    5. Yalçın Akçay & Haijun Li & Susan Xu, 2007. "Greedy algorithm for the general multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 150(1), pages 17-29, March.
    6. Augerat, P. & Belenguer, J. M. & Benavent, E. & Corberan, A. & Naddef, D., 1998. "Separating capacity constraints in the CVRP using tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 546-557, April.
    7. Billy E. Gillett & Leland R. Miller, 1974. "A Heuristic Algorithm for the Vehicle-Dispatch Problem," Operations Research, INFORMS, vol. 22(2), pages 340-349, April.
    8. G Ioannou & M Kritikos & G Prastacos, 2001. "A greedy look-ahead heuristic for the vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(5), pages 523-537, May.
    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. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    2. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    3. Forma, Iris A. & Raviv, Tal & Tzur, Michal, 2015. "A 3-step math heuristic for the static repositioning problem in bike-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 230-247.
    4. Julia Rieck & Jürgen Zimmermann & Matthias Glagow, 2007. "Tourenplanung mittelständischer Speditionsunternehmen in Stückgutkooperationen: Modellierung und heuristische Lösungsverfahren," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 17(4), pages 365-388, January.
    5. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    6. César Rego, 1998. "A Subpath Ejection Method for the Vehicle Routing Problem," Management Science, INFORMS, vol. 44(10), pages 1447-1459, October.
    7. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    8. Uchoa, Eduardo & Pecin, Diego & Pessoa, Artur & Poggi, Marcus & Vidal, Thibaut & Subramanian, Anand, 2017. "New benchmark instances for the Capacitated Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 257(3), pages 845-858.
    9. Tânia Rodrigues Pereira Ramos & Maria Isabel Gomes & Ana Paula Barbosa-Póvoa, 2020. "A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 75-110, March.
    10. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    11. Sleman Saliba, 2006. "Heuristics for the lexicographic max-ordering vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 14(3), pages 313-336, September.
    12. Okitonyumbe Y.F., Joseph & Ulungu, Berthold E.-L. & Kapiamba Nt., Joel, 2015. "Cobweb Heuristic for solving Multi-Objective Vehicle Routing Problem," MPRA Paper 66121, University Library of Munich, Germany.
    13. Javier Faulin & Pablo Sarobe & Jorge Simal, 2005. "The DSS LOGDIS Optimizes Delivery Routes for FRILAC’s Frozen Products," Interfaces, INFORMS, vol. 35(3), pages 202-214, June.
    14. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    15. Kritikos, Manolis N. & Ioannou, George, 2010. "The balanced cargo vehicle routing problem with time windows," International Journal of Production Economics, Elsevier, vol. 123(1), pages 42-51, January.
    16. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    17. Briseida Sarasola & Karl F. Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
    18. C D Tarantilis & G Ioannou & C T Kiranoudis & G P Prastacos, 2005. "Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 588-596, May.
    19. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    20. Petr Kučera & Igor Krejčí, 2013. "Contribution of simple heuristics for the vehicle routing problem - A case study of a small brewery," Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, Mendel University Press, vol. 61(7), pages 2393-2401.

    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:arp:tjssrr:2018:p:695-700. 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: Managing Editor (email available below). General contact details of provider: http://arpgweb.com/?ic=journal&journal=7&info=aims .

    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.