Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
复制标题
在收入、预算和跳跃限制下突破本地搜索斯坦纳树问题
DOI:
10.1016/j.ejor.2013.06.048
复制
发表时间:
2014
影响因子:
6.4
通讯作者:
Hao, Jin-Kao
中科院分区:
文献类型:
--
作者:
Fu, Zhang-Hua;Hao, Jin-Kao
The Steiner tree problem (STP) is one of the most popular combinatorial optimization problems with various practical applications. In this paper, we propose a Breakout Local Search (BLS) algorithm for an important generalization of the STP: the Steiner tree problem with revenue, budget and hop constraints (STPRBH), which consists of determining a subtree of a given undirected graph which maximizes the collected revenues, subject to both budget and hop constraints. Starting from a probabilistically constructed initial solution, BLS uses a Neighborhood Search (NS) procedure based on several specifically designed move operators for local optimization, and employs an adaptive diversification strategy to escape from local optima. The diversification mechanism is implemented by adaptive perturbations, guided by dedicated information of discovered high-quality solutions. Computational results based on 240 benchmarks show that BLS produces competitive results with respect to several previous approaches. For the 56 most challenging instances with unknown optimal results, BLS succeeds in improving 49 and matching one best known results within reasonable time. For the 184 instances which have been solved to optimality, BLS can also match 167 optimal results.
登录
查看更多内容
DOI:
10.1007/978-0-387-30165-5_18
发表时间:
2006
期刊:
--
影响因子:
--
作者:
S. Voß
通讯作者:
S. Voß
影响因子:
4
作者:
Benlic, Una;Hao, Jin-Kao
通讯作者:
Hao, Jin-Kao
DOI:
--
发表时间:
2011
期刊:
--
影响因子:
--
作者:
Markus Sinnl;Verfassung der Arbeit
通讯作者:
Markus Sinnl;Verfassung der Arbeit
影响因子:
4.8
作者:
S. Voß
通讯作者:
S. Voß
DOI:
--
发表时间:
2000-02
期刊:
--
影响因子:
--
作者:
David S. Johnson;M. Minkoff;Steven J. Phillips
通讯作者:
David S. Johnson;M. Minkoff;Steven J. Phillips