A Firefly Algorithm Based Optimization Model for Urban Residential Solid Waste Collection: Evidence from Damaturu, Nigeria

Authors

  • Ahmed T. Buba Department of Statistics, The Federal Polytechnic Damaturu, Nigeria. Author https://orcid.org/0000-0003-4170-6176
  • Mohammed A. Dauda Department of Applied Mathematics, Federal University of Technology, Babura, Nigeria. Author
  • Maigana A. Bakawu Department of Statistics, Mai Idris Alooma Polytechnic, Geidam, Nigeria. Author

DOI:

https://doi.org/10.62054/ijdm/0303.29

Abstract

Residential waste collection problem has over the decades received considerable attention in the literature of travelling salesman problem. The adverse effect of residential waste includes environmental degradation and health risks caused by daily waste quantities generated from the population. Some major challenges faced by authorities in waste management include but not restricted to financial resource limitations. Hence, there is an increasing trend towards developing waste collection system that is capable of addressing the different requirements in terms of global collection cost, tour scheduling, truck capacity, collection times, fuel consumption and the overall travel cost. In this paper, we tackled the TSP in relation to previous approaches and the waste collection problem in two layouts of Damaturu metropolis in Nigeria. Due to the NP-hard nature of this combinatorial optimization problem, a firefly based metaheuristic algorithm is used to provide useful solutions to the considered cases. In other words, the proposed algorithm is validated using some benchmark dataset obtained from the literature. Subsequently, it is calibrated on a real instance. The results indicate that the firefly based approach provides the minimum total traveled distance compared to the considered approaches in this study. Further, for the real instance, the proposed algorithm (existing layout configuration) yields 32% and 38% savings in travel cost for the case study, respectively.

Author Biography

  • Ahmed T. Buba, Department of Statistics, The Federal Polytechnic Damaturu, Nigeria.

    Initially, Chief Lecturer at The Federal Polytechnic Damaturu, Yobe State. Presently a senior lecturer, Department of Applied Mathematics, Federal University of Technology Babura, Jigawa State.

    Ph.D. in Operations Research with specialisation in Optimization, University Putra Malaysia, 2017.

References

Arora, S. (1998). Polynomial Time Approximation Schemes for Euclidean Travelling Salesman Problem and other Geometric Problems. Journal of the ACM (JACM), 45(5), 753-782. https://doi.org/10.1145/290179.290180

Beliën, J., De Boeck, L., & Van Ackere, J. (2014). Municipal solid waste collection and management problems: a literature review. Transportation Science, 48(1), 78-102. https://doi.org/10.1287/trsc.1120.0448

Bonomo, F., Durán, G., Larumbe, F., & Marenco, J. (2012). A method for optimizing waste collection using mathematical programming: a Buenos Aires case study. Waste Management & Research, 30(3), 311-324. https://doi.org/10.1177/0734242X11402870

Bouzidi, S., Riffi, M. E., & Bouzidi, A. (2017). Comparative analysis of three metaheuristics for solving the travelling salesman problem. Transactions on Machine Learning and Artificial Intelligence, 5(4).

Croes, G. A. (1958). A method for solving traveling-salesman problems. Operations research, 6(6), 791-812. https://doi.org/10.1287/opre.6.6.791

Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large-scale traveling-salesman problem. Journal of the operations research society of America, 2(4), 393-410. https://doi.org/10.1287/opre.2.4.393

Eisenstein, D. D., & Iyer, A. V. (1997). Garbage collection in Chicago: a dynamic scheduling model. Management Science, 43(7), 922-933. https://doi.org/10.1287/mnsc.43.7.922

Farrokhi-Asl, H., Tavakkoli-Moghaddam, R., Asgarian, B., & Sangari, E. (2017). Metaheuristics for a bi-objective location-routing-problem in waste collection management. Journal of Industrial and Production Engineering, 34(4), 239-252. https://doi.org/10.1080/21681015.2016.1253619

Fister, I., Fister Jr, I., Yang, X. S., & Brest, J. (2013). A comprehensive review of firefly algorithms. Swarm and evolutionary computation, 13, 34-46. https//doi.org/10.1016/j.swevo.2013.06.001

Geetha, R. R., Bouvanasilan, N., & Seenuvasan, V. (2009). A perspective view on travelling salesman problem using genetic algorithm. In 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), pp: 356-361. https://doi.org/10.1109/NABIC.2009.5393321

Kyessi, A., & Mwakalinga, V. (2009). GIS application in coordinating solid waste collection: the case of Sinza Neighbourhood in Kinondoni municipality, Dar es Salaam city, Tanzania. In FIG Working Week, pp: 3-8.

Manliguez C., Cuabo P., Gamot R. and Ligue K. (2017). Solid Waste Collection Routing Optimization using Hybridized Modified Discrete Firefly Algorithm and Simulated Annealing: A Case Study in Davao City, Philippines. In Proceedings of the 3rd International Conference on Geographical Information Systems Theory, Applications and Management (GISTAM 2017), pp: 50-61. https://doi.org/10.5220/0006322500500061

Manoharam, G., Ismail, M., Abir, I. A., & Majahar Ali, M. K. (2021). Efficient Solid Waste Management in Prai Industrial Area through GIS using Dijkstra and Travelling Salesman Problem Algorithms. Pertanika Journal of Science & Technology, 29(3), 1397 – 1418. https://doi.org/10.47836/pjst.29.3.02

Mat, N. A., Benjamin, A. M., & Abdul-Rahman, S. (2018). Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: A case study. The Journal of Social Sciences Research, (SPI6), 695-700. https://doi.org/10.32861/jssr.spi6.695.700

Mekamcha, K., Souier, M., Bessenouci, H. N., and Bennekrouf, M. (2021). Two Metaheuristic Approaches for Solving the Travelling Salesman Problem: An Algerian Waste Collection Case. Operational Research, 21(3), 1641-1661. https://doi.org//10.1007/s12351-019-00529-6

Mishra, H. K., Singh, P., and Tiwari, A. (2021). Solution of Travelling Salesman Problem based on Metaheuristic Approaches. Journal of Informatics Electrical and Electronics Engineering, 2(3), 1-9. https://doi.org/10.54060/jieee/002.03.004

Nevrlý, V., Šomplák, R., & Popela, P. (2019). Heuristics for Waste Collection Arc Routing Problem. MENDEL, 25(1), 15-22. https://doi.org/10.13164/mendel.2019.1.015

Ouaarab, A., Ahiod, B., & Yang, X. S. (2014). Discrete cuckoo search algorithm for the travelling salesman problem. Neural Computing and Applications, 24(7), 1659-1669. https://doi.org/10.1007/s00521-013-1402-2

Pepper, J. W., Golden, B. L., & Wasil, E. A. (2002). Solving the traveling salesman problem with annealing-based heuristics: a computational study. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, 32(1), 72-77. https://doi.org/10.1109/3468.995530

Rabbani, M., Tabrizi, F. H., and Farrokhi-Asl, H. (2016). A Hybrid Metaheuristic Algorithm for Solving a Roll-on Roll-off Waste Collection Vehicle Routing Problem Considering Waste Separation and Recycling. International Journal of Applied Operational Research, 6(2), 19-31. https://ijorlu.liau.ac.ir/article-1-514-en.pdf

Reinelt, G. (1991). TSPLIB—A traveling salesman problem library. ORSA journal on computing, 3(4), 376-384. https://doi.org/10.1287/ijoc.3.4.376

Siddam, S. (2012). Route Optimisation for Solid Waste Management using Geoinformatics. IOSR J. Mech. Civ. Eng. 2(1), 78–83. https://doi.org/10.9790/1684-0217883

Taillard, É. D., Gambardella, L. M., Gendreau, M., & Potvin, J. Y. (2001). Adaptive memory programming: A unified view of metaheuristics. European Journal of Operational Research, 135(1), 1-16. https://doi.org/10.1016/S0377-2217(00)00268-X

Thakur, G., Pal, A., Mittal, N., Yajid, M. S. A., & Gared, F. (2024). A significant exploration on meta-heuristic based approaches for optimization in the waste management route problems. Scientific reports, 14(1), 14853. https://doi.org/10.1038/s41598-024-64133-1

Toaza, B., & Esztergár-Kiss, D. (2023). A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems. Applied Soft Computing, 148, 110908. https://doi.org/10.1016/j.asoc.2023.110908

Tung, D. V., & Pinnoi, A. (2000). Vehicle routing–scheduling for waste collection in Hanoi. European Journal of Operational Research, 125(3), 449-468. https://doi.org/10.1016/S0377-2217(99)00408-7

Wolpert, D. H., & Macready, W. G. (2002). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67-82. https://doi.org/10.1109/4235.585893

Zhao, G., Luo, W., Nie, H., & Li, C. (2008). A genetic algorithm balancing exploration and exploitation for the travelling salesman problem. In 2008 Fourth International Conference on Natural Computation, vol. 01, pp: 505-509. https://doi.org/10.1109/ICNC.2008.421

Downloads

Published

2026-09-08

How to Cite

A Firefly Algorithm Based Optimization Model for Urban Residential Solid Waste Collection: Evidence from Damaturu, Nigeria. (2026). International Journal of Development Mathematics (IJDM), 3(3), 540-557. https://doi.org/10.62054/ijdm/0303.29