OPTIMIZATION OF LOGISTICS DISTRIBUTION ROUTES USING SA AND GA WITH DIFFERENT VEHICLE CAPACITIES
Capacitated vehicle routing problem (CVRP) is a variation of vehicle routing problem (VRP) that has capacity on the vehicle used. The method used to solve this CVRP problem is the meta-heuristic method. The meta-heuristic method used includes Simulated Annealing (SA) and Genetic Algorithm (GA). B...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Theses |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/47365 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Capacitated vehicle routing problem (CVRP) is a variation of vehicle routing
problem (VRP) that has capacity on the vehicle used. The method used to solve this
CVRP problem is the meta-heuristic method. The meta-heuristic method used
includes Simulated Annealing (SA) and Genetic Algorithm (GA). Based on this
method, the best route optimization results in ten different cases. Then compare the
results of the two methods used with the results of the Best Known Solution (BKS)
data for the same case from the company. The results show that for the first, second
and fourth cases, among others, 8 nodes with 3 vehicles, 10 nodes with 3 vehicles,
and 14 nodes with 4 vehicles have the same results between the two methods used,
but both methods have the best cost value. better than BKS data. While for the
following cases, the SA method has a better cost value than the GA method, while
the best cost value is better than the BKS data. |
|---|