An approximation algorithm for the clustered path travelling salesman problem
Jiaxuan Zhang,
Suogang Gao,
Bo Hou and
Wen Liu ()
Additional contact information
Jiaxuan Zhang: Hebei Normal University
Suogang Gao: Hebei Normal University
Bo Hou: Hebei Normal University
Wen Liu: Hebei Normal University
Journal of Combinatorial Optimization, 2023, vol. 45, issue 4, No 9, 12 pages
Abstract:
Abstract In this paper, we consider the clustered path travelling salesman problem. In this problem, we are given a complete graph $$G=(V,E)$$ G = ( V , E ) with an edge weight function w satisfying the triangle inequality. In addition, the vertex set V is partitioned into clusters $$V_1,\ldots ,V_k$$ V 1 , … , V k and s, t are two given vertices of G with $$s\in V_1$$ s ∈ V 1 and $$t\in V_k$$ t ∈ V k . The objective of the problem is to find a minimum Hamiltonian path of G from s to t, where all vertices of each cluster are visited consecutively. In this paper, we deal with the case that the start-vertex and the end-vertex of the path on each cluster are both specified, and for it we provide a polynomial-time approximation algorithm.
Keywords: Travelling salesman problem; Stacker crane problem; Path; Cluster (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-023-01029-2 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:4:d:10.1007_s10878-023-01029-2
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-023-01029-2
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 ().