Waste Collection Vehicle Routing Problem with TimeWindows for Route Optimization of Garbage Transport Vehicles
Abstract
The waste collection vehicle routing problem with time windows is an optimization problem on the route of the waste transport vehicle which aims to determine the route of the vehicle by considering the travel time and windows. Garbage transport vehicles transport garbage in several work areas. This affects the optimal time and distance. The working hours of the garbage collectors are divided into two parts. The first working hours are 07.00 - 11.00 West Indonesian Time (WIT) and 16.00-20.00 WIT. The cleaning staff has a break of 5 hours. This study aims to optimize the route of waste transportation vehicles in the problem of transporting waste so as to minimize travel time and distance. Waste collection vehicle routing problem with time windows on determining the route of a garbage transport vehicle which is simulated on the problem of transporting garbage in the city of Palembang. The waste collection vehicle routing problem with the time windows model is solved with an exact approach using LINGO software. The results of this study indicate that the proposed optimization model provides optimization of the route of the garbage transport vehicle, the total travel time, and break time of the cleaning staff.
References
Atefi, R., M. Salari, L. C. Coelho, and J. Renaud (2018). The Open Vehicle Routing Problem with Decoupling Points. European Journal of Operational Research, 265(1); 316–327
Azad, T. and M. A. A. Hasin (2019). Capacitated Vehicle Routing Problem using Genetic Algorithm: A Case of Cement Distribution. International Journal of Logistics Systems and Management, 32(1); 132–146
Borcinova, Z. (2017). Two Models of the Capacitated Vehicle Routing Problem. Croatian Operational Research Review, 8; 463–469
Braekers, K., K. Ramaekers, and I. Van Nieuwenhuyse (2016). The Vehicle Routing Problem: State of the Art Classification and Review. Computers & Industrial Engineering, 99; 300–313
Desaulniers, G., O. B. Madsen, and S. Ropke (2014). Chapter 5: The Vehicle Routing Problem with Time Windows. In Vehicle Routing: Problems, Methods, and Applications, Second Edition. SIAM; 119–159
El-Sherbeny, N. A. (2010). Vehicle Routing with Time Windows: An Overview of Exact, Heuristic and Metaheuristic Methods. Journal of King Saud University-Science, 22(3); 123–131
Gounaris, C. E., W. Wiesemann, and C. A. Floudas (2013). The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty. Operations Research, 61(3); 677–693
Hartono, Y., F. M. Puspita, D. I. Permatasari, and B. Arisha (2018). LINGO-Based on Robust Counterpart Open Capacitated Vehicle Routing Problem (RC-OCVRP) Model of Waste Transportation in Palembang. International Conference on Information and Communications Technology (ICOIACT), 18; 429–435
Ibrahim, A. A., N. Lo, R. Abdulaziz, and J. Ishaya (2019). Capacitated Vehicle Routing Problem. International Journal of Research-Granthaalayah, 7(3); 310–327
Izar, S., S. Suwilo, and S. Sutarman (2016). Multi-Depot Vehicle Routing Problem with Split Delivery and Time Windows. Bulletin of Mathematics, 8(02); 169–177
Jepsen, M. K. and D. Pisinger (2011). Branch-and-Cut and Branch-and-Cut-and-Price Algorithms for Solving Vehicle Routing Problems. Technical University of Denmark
Korcyl, A., R. Książek, and K. Gdowska (2019). A MILP Model for the Municipal Solid Waste Selective Collection Routing Problem. Decision Making in Manufacturing and Services, 13(1-2); 17–35
Lahyani, R., M. Khemakhem, and F. Semet (2015). Rich Vehicle Routing Problems: From a Taxonomy to a Definition. European Journal of Operational Research, 241(1); 1–14
Lu, J. W., N. B. Chang, L. Liao, and M. Y. Liao (2015). Smart and Green Urban Solid Waste Collection Systems: Advances, Challenges, and Perspectives. IEEE Systems Journal, 11(4); 2804–2817
Mamat, N. J. Z., S. H. Jaaman, and R. R. Ahmad (2016). Vehicle Routing Problem and Capacitated Vehicle Routing Problem Frameworks in Fund Allocation Problem. AIP Conference Proceedings, 1784(1); 050001
Markovic, D., G. Petrovic, Z. Cojbasic, and D. Marinkovic (2019). A Metaheuristic Approach to the Waste Collection Vehicle Routing Problem with Stochastic Demands and Travel Times. Acta Polytechnica Hungarica, 16(7); 45–60
Munari, P., A. Moreno, J. De La Vega, D. Alem, J. Gondzio, and R. Morabito (2019). The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method. Transportation Science, 53(4); 1043–1066
Natalia, C., V. Triyanti, G. Setiawan, and M. Haryanto (2021). Completion of Capacitated Vehicle Routing Problem (CVRP) and Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) using Bee Algorithm Approach to Optimize Waste Picking Transportation Problem. Journal of Modern Manufacturing Systems and Technology, 5(2); 69–77
Nazari, M., A. Oroojlooy, L. Snyder, and M. Takác (2018). Reinforcement Learning for Solving the Vehicle Routing Problem. Advances in Neural Information Processing Systems, 31; 1–11
Perea, F., R. Ruiz, K. Katragjini, and G. d. S. de Optimización Aplicada (2016). Integer Programming, Clustering, and Local Search Approaches for Grouping Urban Waste Collection Sites. Boletin de Estadistica e Investigacion Operativa, 32(3); 203–224
Puspita, F. M., Y. Hartono, N. Z. Syaputri, E. Yuliza, and W. D. Pratiwi (2018). Robust Counterpart Open Capacitated Vehicle Routing (RC-OCVRP) Model in Optimization of Garbage Transportation in District Sako and Sukarami, Palembang City. International Journal of Electrical and Computer Engineerin, 8(6); 4382–4390
Rossit, D. G., A. A. Toncovich, and M. Fermani (2021). Routing in Waste Collection: A Simulated Annealing Algorithm for an Argentinean Case Study. Mathematical Biosciences and Engineering, 18(6); 9579–9605
Wahyukaton and A. Rochaeni (2019). Shortest Route for Waste Transportation in Northern Bandung using Vehicle Routing Problem-Clarke and Wright-Saving Method. International Journal of Innovative Technology and Exploring Engineering, 8(8); 679–686
Yuliza, E., F. M. Puspita, and S. S. Supadi (2020). The Robust Counterpart Open Capacitated Vehicle Routing Problem with Time Windows on Waste Transport Problems. Bulletin of Electrical Engineering and Informatics, 9(5); 2074–2081
Yuliza, E., F. M. Puspita, and S. S. Supadi (2021). Heuristic Approach for Robust Counterpart Open Capacitated Vehicle Routing Problem with Time Windows. Science and Technology Indonesia, 6(2); 53–57
Zhou, J., M. Zhang, and S. Wu (2022). Multi-Objective Vehicle Routing Problem for Waste Classification and Collection with Sustainable Concerns: The Case of Shanghai City. Sustainability, 14(18); 11498
Authors
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.