Approximation algorithms for solving the heterogeneous Chinese postman problem

Jianping Li (), Pengxiang Pan (), Junran Lichen (), Lijian Cai (), Wencheng Wang () and Suding Liu ()
Additional contact information
Jianping Li: Yunnan University
Pengxiang Pan: Yunnan University
Junran Lichen: Beijing University of Chemical Technology
Lijian Cai: Yunnan University
Wencheng Wang: Yunnan University
Suding Liu: Yunnan University

Journal of Combinatorial Optimization, 2023, vol. 45, issue 1, No 5, 15 pages

Abstract: Abstract In this paper, we consider the heterogeneous Chinese postman problem (the HCPP), which generalizes the k-Chinese postman problem. Specifically, given a weighted graph $$G=(V,E;w;r)$$ G = ( V , E ; w ; r ) with length function $$w:E\rightarrow R^{+}$$ w : E → R + satisfying the triangle inequality, a fixed depot $$r\in V$$ r ∈ V , and k vehicles having k nonuniform speeds $$\lambda _{1}, \lambda _{2}, \ldots ,\lambda _{k}$$ λ 1 , λ 2 , … , λ k , respectively, it is asked to find k tours in G for these k vehicles, each starting at the same depot r, and collectively traversing each edge in E at least once. The objective is to minimize the maximum completion time of vehicles, where the completion time of a vehicle is its total travel length divided by its speed. The main contribution of our paper is to show the following two results. (1) Given any small constant $$\delta >0$$ δ > 0 , we design a $$20.8765(1+\delta )$$ 20.8765 ( 1 + δ ) -approximation algorithm to solve the HCPP, where the running time required is bounded by a polynomial in the input size and $$\frac{1}{\delta }$$ 1 δ . (2) We present a $$(1+\varDelta -1/k)$$ ( 1 + Δ - 1 / k ) -approximation algorithm to solve the HCPP in cubic time, where $$\varDelta $$ Δ is the ratio of the largest vehicle speed to the smallest one.

Keywords: Combinatorial optimization; Nonuniform speeds; Heterogeneous Chinese postman tours; Approximation algorithms (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00931-5 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:45:y:2023:i:1:d:10.1007_s10878-022-00931-5

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

DOI: 10.1007/s10878-022-00931-5

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 ().