Online covering salesman problem

Huili Zhang () and Yinfeng Xu ()
Additional contact information
Huili Zhang: Xi’an Jiaotong University
Yinfeng Xu: Xi’an Jiaotong University

Journal of Combinatorial Optimization, 2018, vol. 35, issue 3, No 16, 954 pages

Abstract: Abstract Given a graph $$G=(V,E,D,W)$$ G = ( V , E , D , W ) , the generalized covering salesman problem (CSP) is to find a shortest tour in G such that each vertex $$i\in D$$ i ∈ D is either on the tour or within a predetermined distance L to an arbitrary vertex $$j\in W$$ j ∈ W on the tour, where $$D\subset V$$ D ⊂ V , $$W\subset V$$ W ⊂ V . In this paper, we propose the online CSP, where the salesman will encounter at most k blocked edges during the traversal. The edge blockages are real-time, meaning that the salesman knows about a blocked edge when it occurs. We present a lower bound $$\frac{1}{1 + (k + 2)L}k+1$$ 1 1 + ( k + 2 ) L k + 1 and a CoverTreeTraversal algorithm for online CSP which is proved to be $$k+\alpha $$ k + α -competitive, where $$\alpha =0.5+\frac{(4k+2)L}{OPT}+2\gamma \rho $$ α = 0.5 + ( 4 k + 2 ) L OPT + 2 γ ρ , $$\gamma $$ γ is the approximation ratio for Steiner tree problem and $$\rho $$ ρ is the maximal number of locations that a customer can be served. When $$\frac{L}{\texttt {OPT}}\rightarrow 0$$ L OPT → 0 , our algorithm is near optimal. The problem is also extended to the version with service cost, and similar results are derived.

Keywords: Covering salesman problem; Realtime blockage; Competitive analysis; Service cost (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0227-9 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:35:y:2018:i:3:d:10.1007_s10878-017-0227-9

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

DOI: 10.1007/s10878-017-0227-9

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