Photo from wikipedia
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… Click to show full 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.
Keywords:
polynomial time;
algorithm depot;
exact algorithm;
time exact
Journal Title: Mathematical Problems in Engineering
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Mathematical Problems in Engineering
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!