An Improved Ant Colony Optimisation Algorithm to a Real World Application in Solid Waste Collection; a Case of Tafo Pankrono, Kumasi, Ghana

D. Otoo; S. K. Amponsah; C. Sebil

doi:https://doi.org/10.14445/22315373/IJMTT-V29P515

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 29 | Number 2 | Year 2016 | Article Id. IJMTT-V29P515 | DOI : https://doi.org/10.14445/22315373/IJMTT-V29P515

An Improved Ant Colony Optimisation Algorithm to a Real World Application in Solid Waste Collection; a Case of Tafo Pankrono, Kumasi, Ghana

D. Otoo, S. K. Amponsah, C. Sebil

Abstract

Solid waste collection is an important issue in vehicle routing problem especially in the developing countries where most of the road network in the residential areas is very poor. A well planned path routing will go a long way to help waste management agencies to cut down cost of operations. This paper proposes a new vehicle routing path planning problem that assigns a tricycle to collect waste from individual household and dispose off into a skip bin within a defined cluster zone. The paper presents an Ant Colony optimisation algorithm that incorporates some new factors of selecting nodes such as weight, angle, saving and visibility to solve the vehicle routing path problem. The study is motivated by a real case in Ghana with the aim to optimize the collection of solid waste. The implementation of our improved algorithm gave about 18% reduction in distance travel compared with the traditional Ant Colony algorithm for vehicle routing path planning method.

Keywords

Solid waste, Waste management, Vehicle routing, Algorithm, Path routing, visibility.

References

[1] Ogwueleka, T.Ch. (2009). Municipal solid waste characteristics and management in Nigeria. Iranian Journal of Environmental Health Science & Engineering, 6(3), 173-180.
[2] Mourão, M. C., & Almeida, M. T. (2000). Lower- bounding and heuristic methods for a refuse collection vehicle routing problem. European Journal of Operational Research, 121(2), 420-434. doi:10.1016/S0377- 2217(99) 00045-4
[3] Mourão, M. C., & Amado, L. (2005). Heuristic method for a mixed capacitated arc routing problem: A refuse collection application. European Journal of Operational Research, 160(1), 139-153. doi:10.1016/j.ejor.2004.01.023
[4] Mourao, M. C., Nunes, A. C., & Prins, C. (2009). Heuristic methods for the sectoring arc routing problem. European Journal of Operational Research, 196(3), 856-868. doi:10.1016/j.ejor.2008.04.025
[5] Chang, N. B., Lu, H. Y., & Wei, Y. L. (1997). GIS technology for vehicle routing and scheduling in solid waste collection systems. Journal of Environmental Engineering-Asce, 123(9), 901-910.
[6] Bautista, J., Fernandez, E., & Pereira, J. (2008). Solving an urban waste collection problem using ants heuristics. Computers & Operations Research, 35(9), 3020-3033. doi:10.1016/j.cor.2007.01.029
[7] E. F. Zulvia, R. J. Kuo, and T.-L. Hu, “Solving CVRP with time window, fuzzy travel time and demand via a hybrid ant colony optimization and genetic algorithm,” in Proceedings of the IEEE World Congress on Computational Intelligence (WCCI ’2012), Brisbane, Australia.
[8] J. F. Cordeau and G. Laporte, “Tabu search heuristics for the vehicle routing problem,” Metaheuristic Optimization Via Memory and Evolution, vol. 30, pp. 145–163, 2005.

Citation :

D. Otoo, S. K. Amponsah, C. Sebil, "An Improved Ant Colony Optimisation Algorithm to a Real World Application in Solid Waste Collection; a Case of Tafo Pankrono, Kumasi, Ghana," International Journal of Mathematics Trends and Technology (IJMTT), vol. 29, no. 2, pp. 96-104, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V29P515