Metaheuristics for time-dependent vehicle routing problem with time windows
Vehicle routing problem (VRP), a combinatorial problem, deals with the vehicle’s capacity visiting a particular set of nodes while its variants attempt to fit real-world scenarios. Our study aims to minimise total travelling time, total distance, and the number of vehicles under time-dependent and t...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2022
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/sis_research/7179 https://ink.library.smu.edu.sg/context/sis_research/article/8182/viewcontent/2022_IJOR_105330_TAFPV.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Singapore Management University |
| 語言: | English |
| 總結: | Vehicle routing problem (VRP), a combinatorial problem, deals with the vehicle’s capacity visiting a particular set of nodes while its variants attempt to fit real-world scenarios. Our study aims to minimise total travelling time, total distance, and the number of vehicles under time-dependent and time windows constraints (TDVRPTW). The harmony search algorithm (HSA) focuses on the harmony memory and pitch adjustment mechanism for new solution construction. Several local search operators and a roulette wheel for the performance improvement were verified via 56 Solomon’s VRP instances by adding a speed matrix. The performance comparison with a genetic algorithm (GA) was completed with the same number of parameters and ran in the same computer specification to justify its performance. The results show that HSA can outperform the GA in some instances. The research outcomes suggest that HSA can solve TDVRPTW with comparable results to other commonly used metaheuristic approaches. |
|---|