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...

Descripció completa

Dades bibliogràfiques
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