scholarly journals The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time

2019 ◽  
Vol 272 (1) ◽  
pp. 24-31 ◽  
Author(s):  
Adam N. Letchford ◽  
Juan-José Salazar-González
Keyword(s):  
Vehicle Routing ◽  
Polynomial Time ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle ◽  
Pseudo Polynomial Time

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

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Liang Xu ◽  
Tong Zhang ◽  
Rantao Hu ◽  
Jialing Guo
Keyword(s):  
Approximation Algorithm ◽  
Vehicle Routing ◽  
Polynomial Time ◽  
Vehicle Routing Problem ◽  
Exact Algorithm ◽  
Fixed Number ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Shaped Graph ◽  
Capacitated Vehicle

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.

Sign in / Sign up

Export Citation Format

Share Document