Learning generalizable heuristics for solving vehicle routing problem under distribution shift
Combinatorial optimization problems (COPs) with NP-hardness are always featured by discrete search space and intractable computation to seek the optimal solution. As a fundamental COP in logistics, the vehicle routing problem (VRP) concerns the cost-optimal delivery of items from the depot to a set...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Thesis-Doctor of Philosophy |
| 語言: | English |
| 出版: |
Nanyang Technological University
2024
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/173657 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |