A Polynomial-Time Exact Algorithm for k-Depot Capacitated Vehicle Routing Problem on a Tree

被引：0
|
作者：
Xu, Liang [1 ]
Zhang, Tong [2 ]
Hu, Rantao [1 ]
Guo, Jialing [3 ]
机构：
[1] Southwestern Univ Finance & Econ, Sch Business Adm, Chengdu 611130, Peoples R China
[2] Southwestern Univ Finance & Econ, Inst Chinese Financial Studies, Chengdu 611130, Peoples R China
[3] Zhongnan Univ Econ & Law, Sch Finance, Wuhan 430073, Peoples R China
来源：
MATHEMATICAL PROBLEMS IN ENGINEERING | 2021年 / 2021卷
基金：
中国国家自然科学基金;
关键词：
Routing algorithms - Vehicle routing - Vehicles - Polynomial approximation - Trees (mathematics);
D O I：
10.1155/2021/6648044
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper proposes a polynomial-time exact algorithm for the k-depot capacitated vehicle routing problem on a tree for fixed k (k-depot CVRPT for short), which involves dispatching a fixed number of k capacitated vehicles in depots on a tree-shaped graph to serve customers with the objective of minimizing total distance traveled. The polynomial-time exact algorithm improves the 2-approximation algorithm when k is a constant.
引用
收藏
页数：8
相关论文
共 50 条
12345