Learning generalizable heuristics for solving vehicle routing problem under distribution shift

• المؤلف الرئيسي: Jiang, Yuan
• مؤلفون آخرون: Zhang Jie
• التنسيق: Thesis-Doctor of Philosophy
• اللغة: English
• منشور في: Nanyang Technological University 2024
• الموضوعات: Computer and Information Science; Vehicle routing problem; Combinatorial optimization problem; Deep learning; Distribution shift
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/173657

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