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

Liang Xu, Tong Zhang, Rantao Hu and Jialing Guo

Mathematical Problems in Engineering, 2021, vol. 2021, 1-8

Abstract:

This paper proposes a polynomial-time exact algorithm for the - depot capacitated vehicle routing problem on a tree for fixed ( - depot CVRPT for short), which involves dispatching a fixed number of 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 is a constant.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/6648044.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/6648044.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:6648044

DOI: 10.1155/2021/6648044

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().