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:
主要作者: | Jiang, Yuan |
---|---|
其他作者: | Zhang Jie |
格式: | Thesis-Doctor of Philosophy |
語言: | English |
出版: |
Nanyang Technological University
2024
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/173657 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
DEEP REINFORCEMENT LEARNING FOR SOLVING VEHICLE ROUTING PROBLEMS
由: LI JINGWEN
出版: (2022) -
Vehicle routing problem with time windows and a limited number of vehicles
由: Lau, H.C., et al.
出版: (2013) -
Cooperating memes for vehicle routing problems
由: Chen, X., et al.
出版: (2014) -
Learning feature embedding refiner for solving vehicle routing problems
由: LI, Jingwen, et al.
出版: (2023) -
A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
由: Tan, K.C., et al.
出版: (2014)