Optimization of garbage removal within a territorial community

Authors

DOI:

https://doi.org/10.15587/1729-4061.2022.252001

Keywords:

optimization of garbage collection route, clustering, task of the traveling salesman, development of territorial communities

Abstract

This paper proposes an algorithm for optimizing the garbage collection route in a local community (or a separate settlement). The study was conducted for one garbage truck. To achieve the maximum efficiency of the algorithm, it has been assumed that the points of discharge of collected waste by a garbage truck could be arranged along the way between the proposed clusters of garbage collection points. The optimization of the built routes has been proven, taking into consideration the above assumptions. The study's results could be used to reduce the budget expenditures by territorial community authorities for the collection and disposal of waste. The reported solutions could significantly shorten the garbage collection time, which would improve the environmental and aesthetic situation within the study area. The use of a new algorithm makes it possible to display the results both in quantitative and qualitative forms.

An improved k-means algorithm with a maximum cluster size was selected for clustering. Each cluster was built on the basis of the maximal value of garbage truck tonnage. That means that the size of the cluster would be determined by the value of the maximum amount of waste that can be removed by a garbage truck in one run.

A task of the traveling salesman was applied to find the shortest path between representatives of one cluster (garbage collection points) calling at all its points and to establish the optimal path between all the clusters formed for a territorial community.

The issue related to efficient waste disposal in local communities tends to aggravate rapidly while the task to optimize garbage collection and removal is becoming increasingly acute. This is because at present, along with the increase in the global population, all types of production are increasing their volumes, which, in turn, leads to an increase in the amount of waste, in particular, household.

Supporting Agency

  • Висловлюємо подяку Бігун Ніколєтті Ярославівні за участь у написанні комп’ютерної програми для оптимізації вивозу сміття у територіальних громадах.

Author Biographies

Roman Bihun, Lviv Polytechnic National University

Postgraduate Student

Department of Information Systems and Networks

Vasyl Lytvyn, Lviv Polytechnic National University

Doctor of Technical Sciences, Professor

Department of Information Systems and Networks

References

  1. Gómez, J. R., Pacheco, J., Gonzalo-Orden, H. (2013). A Tabu Search Method for a Bi-Objective Urban Waste Collection Problem. Computer-Aided Civil and Infrastructure Engineering, 30 (1), 36–53. doi: https://doi.org/10.1111/mice.12031
  2. Liang, Y.-C., Minanda, V., Gunawan, A. (2021). Waste collection routing problem: A mini-review of recent heuristic approaches and applications. Waste Management & Research: The Journal for a Sustainable Circular Economy, 0734242X2110039. doi: https://doi.org/10.1177/0734242x211003975
  3. Buhrkal, K., Larsen, A., Ropke, S. (2012). The Waste Collection Vehicle Routing Problem with Time Windows in a City Logistics Context. Procedia - Social and Behavioral Sciences, 39, 241–254. doi: https://doi.org/10.1016/j.sbspro.2012.03.105
  4. Gruler, A., Juan, A. A., Contreras-Bolton, C., Gatica, G. (2018). A Biased-Randomized Heuristic for the Waste Collection Problem in Smart Cities. Advances in Intelligent Systems and Computing, 255–263. doi: https://doi.org/10.1007/978-3-319-75792-6_19
  5. Campos, A. A., Arroyo, J. E. C. (2017). An ILS Heuristic for the Waste Collection Vehicle Routing Problem with Time Windows. Intelligent Systems Design and Applications, 889–899. doi: https://doi.org/10.1007/978-3-319-53480-0_88
  6. Son, L. H. (2014). Optimizing Municipal Solid Waste collection using Chaotic Particle Swarm Optimization in GIS based environments: A case study at Danang city, Vietnam. Expert Systems with Applications, 41 (18), 8062–8074. doi: https://doi.org/10.1016/j.eswa.2014.07.020
  7. Sulemana, A., Donkor, E. A., Forkuo, E. K., Oduro-Kwarteng, S. (2019). Effect of optimal routing on travel distance, travel time and fuel consumption of waste collection trucks. Management of Environmental Quality: An International Journal, 30 (4), 803–832. doi: https://doi.org/10.1108/meq-07-2018-0134
  8. Assaf, R., Saleh, Y. (2017). Vehicle-Routing Optimization for Municipal Solid Waste Collection Using Genetic Algorithm: The Case of Southern Nablus City. Civil and Environmental Engineering Reports, 26 (3), 43–57. doi: https://doi.org/10.1515/ceer-2017-0034
  9. Geetha, S., Poonthalir, G., Vanathi, P. T. (2009). Improved K-Means Algorithm for Capacitated Clustering Problem. INFOCOMP Journal of Computer Science, 8 (4), 52–59. Available at: https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.414.2123&rep=rep1&type=pdf
  10. Bartish, M., Dudzianyi, I. (2007). Doslidzhennia operatsiy. Chastyna 1. Liniyni modeli. Lviv: Vydavnychyi tsentr LNU imeni Ivana Franka, 168.
  11. Lytvyn, V., Vysotska, V., Pukach, P., Brodyak, O., Ugryn, D. (2017). Development of a method for determining the keywords in the slavic language texts based on the technology of web mining. Eastern-European Journal of Enterprise Technologies, 2 (2 (86)), 14–23. doi: https://doi.org/10.15587/1729-4061.2017.98750
  12. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B. (1985). The Travelling salesman problem: A guided tour of combinatorial optimization. John Wiley & Sons, 473.

Downloads

Published

2022-02-28

How to Cite

Bihun, R., & Lytvyn, V. (2022). Optimization of garbage removal within a territorial community. Eastern-European Journal of Enterprise Technologies, 1(3(115), 24–30. https://doi.org/10.15587/1729-4061.2022.252001

Issue

Vol. 1 No. 3(115) (2022): Control processes

Section

Control processes

License

Copyright (c) 2022 Roman Bihun, Vasyl Lytvyn

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.