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.

An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation

2004 ◽  
Vol 52 (5) ◽  
pp. 723-738 ◽  
Author(s):  
R. Baldacci ◽  
E. Hadjiconstantinou ◽  
A. Mingozzi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Network Flow ◽  
Exact Algorithm ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem

2013 ◽  
Vol 61 (2) ◽  
pp. 298-314 ◽  
Author(s):  
Roberto Baldacci ◽  
Aristide Mingozzi ◽  
Roberto Roberti ◽  
Roberto Wolfler Calvo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Exact Algorithm ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

scholarly journals A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs

2020 ◽  
Vol 2 (2) ◽  
pp. 79-95
Author(s):  
Lars Eufinger ◽  
Jannis Kurtz ◽  
Christoph Buchheim ◽  
Uwe Clausen
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Exact Algorithm ◽  
Case Scenario ◽  
Worst Case ◽  
Routing Problem ◽  
Robust Approach ◽  
Capacitated Vehicle Routing Problem ◽  
Feasible Solutions ◽  
Capacitated Vehicle

We investigate a robust approach for solving the capacitated vehicle routing problem (CVRP) with uncertain travel times. It is based on the concept of K-adaptability, which allows one to calculate a set of k feasible solutions in a preprocessing phase before the scenario is revealed. Once a scenario occurs, the corresponding best solution may be picked out of the set of candidates. The aim is to determine the k candidates by hedging against the worst-case scenario, as is common in robust optimization. This idea leads to a min-max-min problem. In this paper, we propose an oracle-based algorithm for solving the resulting min-max-min CVRP, calling an exact algorithm for the deterministic problem in each iteration. Moreover, we adjust this approach such that heuristics for the CVRP can also be used. In this way, we derive a heuristic algorithm for the min-max-min problem, which turns out to yield good solutions in a short running time. All algorithms are tested on standard benchmark instances of the CVRP.

An exact algorithm for the asymmetrical capacitated vehicle routing problem

Networks ◽  
1986 ◽  
Vol 16 (1) ◽  
pp. 33-46 ◽  
Author(s):  
Gilbert Laporte ◽  
Hélène Mercure ◽  
Yves Nobert
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Exact Algorithm ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle
Sign in / Sign up

Export Citation Format

Share Document