The Steiner traveling salesman problem with online advanced edge blockages
详细信息 查看全文
- 作者：Huili Zhanga ; b ; c ; zhang.huilims@xjtu.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Weitian Tonga ; d ; wtong@georgiasouthern.edu" class="auth_mail" title="E-mail the corresponding author ; Yinfeng Xua ; b ; c ; yfxu@mail.xjtu.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Guohui Lina ; guohui@ualberta.ca" class="auth_mail" title="E-mail the corresponding author
- 关键词：Traveling salesman problem ; Steiner TSP ; Advanced edge blockage ; Online algorithm ; Competitive ratio
- 刊名：Computers and Operations Research
- 出版年：2016
- 出版时间：June 2016
- 年：2016
- 卷：70
- 期：Complete
- 页码：26-38
- 全文大小：1034 K
文摘
- class="listitem" id="list_li0005">
- class="label">•
The sTSP with online advanced edge blockages is formulated from an application.
- class="label">•
Lower bounds on the competitive ratio are proved.
- class="label">•
An efficient routing algorithm with proven performance is proposed.
- class="label">•
Extensive computational experiments show both the efficiency and the effectiveness.