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 条
  • [21] The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time
    Letchford, Adam N.
    Salazar-Gonzalez, Juan-Jose
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 272 (01) : 24 - 31
  • [22] A Multirecombinative Algorithm for Capacitated Vehicle Routing Problem
    Villagra, Silvia
    Villagra, Andrea
    Pandolfi, Daniel
    WMSCI 2010: 14TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL I, 2010, : 56 - 60
  • [23] Genetic algorithm approach for multiple depot capacitated vehicle routing problem solving with heuristic improvements
    Filipec, M.
    Škrlec, D.
    Krajcar, S.
    International Journal of Modelling and Simulation, 2000, 20 (04): : 320 - 328
  • [24] Applying the ant colony optimisation algorithm to the capacitated multi-depot vehicle routing problem
    Stodola, Petr
    Mazal, Jan
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2016, 8 (04) : 228 - 233
  • [25] Simulated Annealing Algorithm for Multi Depot Two-Echelon Capacitated Vehicle Routing Problem
    Kancharla, Surendra Reddy
    Ramadurai, Gitakrishnan
    EUROPEAN TRANSPORT-TRASPORTI EUROPEI, 2020, (78):
  • [26] An Exact Quantum Polynomial-Time Algorithm for Solving k-Junta Problem with One Uncomplemented Product
    Chien-Yuan Chen
    International Journal of Theoretical Physics, 2022, 61
  • [27] An Exact Quantum Polynomial-Time Algorithm for Solving k-Junta Problem with One Uncomplemented Product
    Chen, Chien-Yuan
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2022, 61 (03)
  • [28] POLYNOMIAL-TIME ALGORITHM FOR THE ORBIT PROBLEM
    KANNAN, R
    LIPTON, RJ
    JOURNAL OF THE ACM, 1986, 33 (04) : 808 - 821
  • [29] An enhanced exact algorithm for the multi-trip vehicle routing problem with time windows and capacitated unloading station
    Huang, Nan
    Qin, Hu
    Xu, Gangyan
    Wan, Fang
    COMPUTERS & OPERATIONS RESEARCH, 2024, 168
  • [30] Capacitated Vehicle Routing Problem with Time Windows
    Tanel, Aleyna
    Kinay, Begum
    Karakul, Deniz
    Ozyoruk, Efecan
    Iskifoglu, Elif
    Ozogul, Ezgi
    Ustaoglu, Meryem
    Yuksel, Damla
    Ornek, Mustafa Arslan
    DIGITIZING PRODUCTION SYSTEMS, ISPR2021, 2022, : 653 - 664
12345