An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem - Université d'Évry Access content directly
Journal Articles Journal of Combinatorial Optimization Year : 2024

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

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) with O(n3) running time for arbitrary k≥1.
No file

Dates and versions

hal-04476979 , version 1 (26-02-2024)

Identifiers

Cite

Jun Wu, Zhen Yang, Guiqing Zhang, Yongxi Cheng. An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem. Journal of Combinatorial Optimization, 2024, 47 (2), pp.7. ⟨10.1007/s10878-023-01104-8⟩. ⟨hal-04476979⟩
33 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More