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...
Autor principal: | Jiang, Yuan |
---|---|
Altres autors: | Zhang Jie |
Format: | Thesis-Doctor of Philosophy |
Idioma: | English |
Publicat: |
Nanyang Technological University
2024
|
Matèries: | |
Accés en línia: | https://hdl.handle.net/10356/173657 |
Ítems similars
-
A Vehicle Routing Problem with Periodic Replanning
per: Guido Ignacio Novoa-Flores, et al.
Publicat: (2018-09-01) -
Integrating Machine Learning Into Vehicle Routing Problem: Methods and Applications
per: Reza Shahbazian, et al.
Publicat: (2024-01-01) -
Leveraging Transfer Learning in Deep Reinforcement Learning for Solving Combinatorial Optimization Problems Under Uncertainty
per: Fatima Ezzahra Achamrah
Publicat: (2024-01-01) -
A discrete wild horse optimizer for capacitated vehicle routing problem
per: Chuncheng Fang, et al.
Publicat: (2024-09-01) -
Edge-Driven Multiple Trajectory Attention Model for Vehicle Routing Problems
per: Dapeng Yan, et al.
Publicat: (2025-03-01)