Learning generalizable heuristics for solving vehicle routing problem under distribution shift

• Main Author: Jiang, Yuan
• Other Authors: Zhang Jie
• Format: Thesis-Doctor of Philosophy
• Language: English
• Published: Nanyang Technological University 2024
• Subjects: Computer and Information Science; Vehicle routing problem; Combinatorial optimization problem; Deep learning; Distribution shift
• Online Access: https://hdl.handle.net/10356/173657
• Institution: Nanyang Technological University

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