Vehicle routing problem in a medical facility waste collection company: a comparative analysis of guided local search, simulated annealing and tabu search algorithm
Vehicle Routing Problem (VRP) is closely related to real-life situations, particularly in logistics. Therefore, this research aimed to 1) solve VRP problem faced by a waste management company by comparing three algorithms, namely guided local search, tabu search, and simulated annealing. 2) summariz...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Indonesia
2025-03-01
|
| Series: | International Journal of Technology |
| Subjects: | |
| Online Access: | https://ijtech.eng.ui.ac.id/article/view/5937 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850099546795802624 |
|---|---|
| author | Michael Anderson Sumarsono Sudarto |
| author_facet | Michael Anderson Sumarsono Sudarto |
| author_sort | Michael Anderson |
| collection | DOAJ |
| description | Vehicle Routing Problem (VRP) is closely related to real-life situations, particularly in logistics. Therefore, this research aimed to 1) solve VRP problem faced by a waste management company by comparing three algorithms, namely guided local search, tabu search, and simulated annealing. 2) summarize the development of VRP by comparing several variants, and 3) assess the environmental impact through sensitivity analysis. The combined VRP variants are described as the Heterogeneous Fleet Distance Constrained Capacitated VRP with Time Windows because they reflect the current situation of the waste management company. In this context, a model was developed using Python programming language, specifically with a library called Ortools by Google, which is specialized for combinatorial optimization problem. The tests showed that the best algorithm for solving VRP was the path most constrained arc, used as the initial solution generator and guided local search as the optimization algorithm. This combination produced the best result for distance optimization, though it did not address workload balance and average working time. Another conclusion is that the total distance would increase by having more constraints and dimensions. |
| format | Article |
| id | doaj-art-326ce11810a84fd6a67dccb02be73d19 |
| institution | DOAJ |
| issn | 2086-9614 2087-2100 |
| language | English |
| publishDate | 2025-03-01 |
| publisher | Universitas Indonesia |
| record_format | Article |
| series | International Journal of Technology |
| spelling | doaj-art-326ce11810a84fd6a67dccb02be73d192025-08-20T02:40:29ZengUniversitas IndonesiaInternational Journal of Technology2086-96142087-21002025-03-0116242343210.14716/ijtech.v16i2.59375937Vehicle routing problem in a medical facility waste collection company: a comparative analysis of guided local search, simulated annealing and tabu search algorithmMichael Anderson0Sumarsono Sudarto1Swiss German University, The Prominence Tower Alam Sutera, Banten 15143, IndonesiaMercu Buana University, Meruya Selatan, Kecamatan Kembangan, DKI Jakarta 11650, IndonesiaVehicle Routing Problem (VRP) is closely related to real-life situations, particularly in logistics. Therefore, this research aimed to 1) solve VRP problem faced by a waste management company by comparing three algorithms, namely guided local search, tabu search, and simulated annealing. 2) summarize the development of VRP by comparing several variants, and 3) assess the environmental impact through sensitivity analysis. The combined VRP variants are described as the Heterogeneous Fleet Distance Constrained Capacitated VRP with Time Windows because they reflect the current situation of the waste management company. In this context, a model was developed using Python programming language, specifically with a library called Ortools by Google, which is specialized for combinatorial optimization problem. The tests showed that the best algorithm for solving VRP was the path most constrained arc, used as the initial solution generator and guided local search as the optimization algorithm. This combination produced the best result for distance optimization, though it did not address workload balance and average working time. Another conclusion is that the total distance would increase by having more constraints and dimensions.https://ijtech.eng.ui.ac.id/article/view/5937guided local searchheterogenous fleet distance constrained capacitated vehicle routing problem (vrp) with time windowstabu searchtraveling salesmansimulated annealing |
| spellingShingle | Michael Anderson Sumarsono Sudarto Vehicle routing problem in a medical facility waste collection company: a comparative analysis of guided local search, simulated annealing and tabu search algorithm International Journal of Technology guided local search heterogenous fleet distance constrained capacitated vehicle routing problem (vrp) with time windows tabu search traveling salesman simulated annealing |
| title | Vehicle routing problem in a medical facility waste collection company: a comparative analysis of guided local search, simulated annealing and tabu search algorithm |
| title_full | Vehicle routing problem in a medical facility waste collection company: a comparative analysis of guided local search, simulated annealing and tabu search algorithm |
| title_fullStr | Vehicle routing problem in a medical facility waste collection company: a comparative analysis of guided local search, simulated annealing and tabu search algorithm |
| title_full_unstemmed | Vehicle routing problem in a medical facility waste collection company: a comparative analysis of guided local search, simulated annealing and tabu search algorithm |
| title_short | Vehicle routing problem in a medical facility waste collection company: a comparative analysis of guided local search, simulated annealing and tabu search algorithm |
| title_sort | vehicle routing problem in a medical facility waste collection company a comparative analysis of guided local search simulated annealing and tabu search algorithm |
| topic | guided local search heterogenous fleet distance constrained capacitated vehicle routing problem (vrp) with time windows tabu search traveling salesman simulated annealing |
| url | https://ijtech.eng.ui.ac.id/article/view/5937 |
| work_keys_str_mv | AT michaelanderson vehicleroutingprobleminamedicalfacilitywastecollectioncompanyacomparativeanalysisofguidedlocalsearchsimulatedannealingandtabusearchalgorithm AT sumarsonosudarto vehicleroutingprobleminamedicalfacilitywastecollectioncompanyacomparativeanalysisofguidedlocalsearchsimulatedannealingandtabusearchalgorithm |