EconPapers    
Economics at your fingertips  
 

An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem

Jun Wu (), Zhen Yang (), Guiqing Zhang () and Yongxi Cheng ()
Additional contact information
Jun Wu: Xi’an Jiaotong University
Zhen Yang: Xi’an Jiaotong University
Guiqing Zhang: Xi’an Jiaotong University
Yongxi Cheng: Xi’an Jiaotong University

Journal of Combinatorial Optimization, 2024, vol. 47, issue 2, No 6, 11 pages

Abstract: Abstract We study a generalization of the classical Hamiltonian path problem, where multiple salesmen are positioned at the same depot, of which no more than k can be selected to service n destinations, with the objective to minimize the total travel distance. Distances between destinations (and the single depot) are assumed to satisfy the triangle inequality. We develop a non-trivial extension of the well-known Christofides heuristic for this problem, which achieves an approximation ratio of $$2-1/(2+k)$$ 2 - 1 / ( 2 + k ) with $$O(n^3)$$ O ( n 3 ) running time for arbitrary $$k\ge 1$$ k ≥ 1 .

Keywords: Approximation ratio; Christofides heuristic; Multiple Hamiltonian path problem (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01104-8 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:47:y:2024:i:2:d:10.1007_s10878-023-01104-8

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

DOI: 10.1007/s10878-023-01104-8

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

 
Page updated 2025-04-20
Handle: RePEc:spr:jcomop:v:47:y:2024:i:2:d:10.1007_s10878-023-01104-8