Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity

Wei Yu (), Zhaohui Liu () and Xiaoguang Bao ()
Additional contact information
Wei Yu: East China University of Science and Technology
Zhaohui Liu: East China University of Science and Technology
Xiaoguang Bao: Shanghai Ocean University

Journal of Combinatorial Optimization, 2022, vol. 43, issue 5, No 22, 1405-1422

Abstract: Abstract Given $$\lambda >0$$ λ > 0 , an undirected complete graph $$G=(V,E)$$ G = ( V , E ) with nonnegative edge-weight function obeying the triangle inequality and a depot vertex $$r\in V$$ r ∈ V , a set $$\{C_1,\ldots ,C_k\}$$ { C 1 , … , C k } of cycles is called a $$\lambda $$ λ -bounded r-cycle cover if $$V \subseteq \bigcup _{i=1}^k V(C_i)$$ V ⊆ ⋃ i = 1 k V ( C i ) and each cycle $$C_i$$ C i contains r and has a length of at most $$\lambda $$ λ . The Distance Constrained Vehicle Routing Problem with the objective of minimizing the total cost (DVRP-TC) aims to find a $$\lambda $$ λ -bounded r-cycle cover $$\{C_1,\ldots ,C_k\}$$ { C 1 , … , C k } such that the sum of the total length of the cycles and $$\gamma k$$ γ k is minimized, where $$\gamma $$ γ is an input indicating the assignment cost of a single cycle. For DVRP-TC on tree metric, we show a 2-approximation algorithm and give an LP relaxation whose integrality gap lies in the interval [2, $$\frac{5}{2}$$ 5 2 ]. For the unrooted version of DVRP-TC, we devise a 5-approximation algorithm and give an LP relaxation whose integrality gap is between 2 and 25. For unrooted DVRP-TC on tree metric we develop a 3-approximation algorithm. For unrooted DVRP-TC on line metric we obtain an $$O(n^3)$$ O ( n 3 ) time exact algorithm, where n is the number of vertices. Moreover, we give some examples to demonstrate that our results can also be applied to the path-version of (unrooted) DVRP-TC.

Keywords: Vehicle routing; Cycle cover; Path cover; Approximation algorithm; Complexity; Integrality gap (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00669-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:43:y:2022:i:5:d:10.1007_s10878-020-00669-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00669-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().