{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:18:23Z","timestamp":1753600703561},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T00:00:00Z","timestamp":1494460800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s00500-017-2630-7","type":"journal-article","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T15:54:47Z","timestamp":1494518087000},"page":"4133-4151","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A self-adaptive and stagnation-aware breakout local search algorithm on the grid for the Steiner tree problem with revenue, budget and hop constraints"],"prefix":"10.1007","volume":"22","author":[{"given":"Tansel","family":"Dokeroglu","sequence":"first","affiliation":[]},{"given":"Erhan","family":"Mengusoglu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,11]]},"reference":[{"issue":"1","key":"2630_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.cor.2010.05.003","volume":"38","author":"I Akgun","year":"2011","unstructured":"Akgun I (2011) New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll\u2019s tightened Miller\u2013Tucker\u2013Zemlin constraints. Comput Oper Res 38(1):277\u2013286","journal-title":"Comput Oper Res"},{"issue":"4","key":"2630_CR2","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/1721654.1721672","volume":"53","author":"M Armbrust","year":"2010","unstructured":"Armbrust M, Fox A, Griffith R, Joseph AD, Katz R, Konwinski A, Zaharia M (2010) A view of cloud computing. Commun ACM 53(4):50\u201358","journal-title":"Commun ACM"},{"issue":"2","key":"2630_CR3","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.ejor.2001.11.002","volume":"164","author":"P Avella","year":"2005","unstructured":"Avella P, Villacci D, Sforza A (2005) A Steiner arborescence model for the feeder reconfiguration in electric distribution networks. Eur J Oper Res 164(2):505\u2013509","journal-title":"Eur J Oper Res"},{"issue":"11","key":"2630_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"2630_CR5","doi-asserted-by":"crossref","unstructured":"Benlic U, Hao JK (2012) A study of breakout local search for the minimum sum coloring problem. In: Bui LT, Ong YS, Hoai NX, Ishibuchi H, Suganthan PN (eds) Simulated evolution and learning. SEAL 2012. Lecture notes in computer science, vol 7673. Springer, Berlin, pp 128\u2013137","DOI":"10.1007\/978-3-642-34859-4_13"},{"issue":"9","key":"2630_CR6","first-page":"4800","volume":"219","author":"U Benlic","year":"2013","unstructured":"Benlic U, Hao JK (2013a) Breakout local search for the quadratic assignment problem. Appl Math Comput 219(9):4800\u20134815","journal-title":"Appl Math Comput"},{"issue":"1","key":"2630_CR7","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.cor.2012.06.002","volume":"40","author":"U Benlic","year":"2013","unstructured":"Benlic U, Hao JK (2013b) Breakout local search for maximum clique problems. Comput Oper Res 40(1):192\u2013206","journal-title":"Comput Oper Res"},{"issue":"3","key":"2630_CR8","doi-asserted-by":"crossref","first-page":"1162","DOI":"10.1016\/j.engappai.2012.09.001","volume":"26","author":"U Benlic","year":"2013","unstructured":"Benlic U, Hao JK (2013c) Breakout local search for the max-cut problem. Eng Appl Artif Intell 26(3):1162\u20131173","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"2630_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"SA Canuto","year":"2001","unstructured":"Canuto SA, Resende MG, Ribeiro CC (2001) Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38(1):50\u201358","journal-title":"Networks"},{"issue":"2","key":"2630_CR10","first-page":"99","volume":"44","author":"AM Costa","year":"2006","unstructured":"Costa AM, Cordeau JF, Laporte G (2006) Steiner tree problems with profits. INFOR 44(2):99","journal-title":"INFOR"},{"issue":"1","key":"2630_CR11","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.ejor.2007.06.012","volume":"190","author":"AM Costa","year":"2008","unstructured":"Costa AM, Cordeau JF, Laporte G (2008) Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. Eur J Oper Res 190(1):68\u201378","journal-title":"Eur J Oper Res"},{"issue":"2","key":"2630_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.20274","volume":"53","author":"AM Costa","year":"2009","unstructured":"Costa AM, Cordeau JF, Laporte G (2009) Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints. Networks 53(2):141\u2013159","journal-title":"Networks"},{"issue":"6","key":"2630_CR13","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1016\/j.dam.2008.02.014","volume":"157","author":"AS Cunha Da","year":"2009","unstructured":"Da Cunha AS, Lucena A, Maculan N, Resende MG (2009) A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. Discrete Appl Math 157(6):1198\u20131217","journal-title":"Discrete Appl Math"},{"key":"2630_CR14","doi-asserted-by":"crossref","unstructured":"Dokeroglu T (2015) Hybrid teaching-learning-based optimization algorithms for the quadratic assignment problem. Comput Ind Eng 85:86\u2013101","DOI":"10.1016\/j.cie.2015.03.001"},{"key":"2630_CR15","doi-asserted-by":"crossref","unstructured":"Dokeroglu T, Cosar A (2016) A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem. Eng Appl Artif Intell 52:10\u201325","DOI":"10.1016\/j.engappai.2016.02.004"},{"key":"2630_CR16","unstructured":"Fu ZH, Hao JK (2014) Breakout local search for the Steiner tree problem with revenue, budget and hop constraints. Eur J Oper Res 232(1):209\u2013220"},{"issue":"2","key":"2630_CR17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1287\/ijoc.2014.0622","volume":"27","author":"ZH Fu","year":"2015","unstructured":"Fu ZH, Hao JK (2015) Dynamic programming driven memetic search for the steiner tree problem with revenues, budget, and hop constraints. INFORMS J Comput 27(2):221\u2013237","journal-title":"INFORMS J Comput"},{"issue":"4","key":"2630_CR18","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey MR, Johnson DS (1977) The rectilinear Steiner tree problem is NP-complete. SIAM J Appl Math 32(4):826\u2013834","journal-title":"SIAM J Appl Math"},{"issue":"4","key":"2630_CR19","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey MR, Graham RL, Johnson DS (1977) The complexity of computing Steiner minimal trees. SIAM J Appl Math 32(4):835\u2013859","journal-title":"SIAM J Appl Math"},{"issue":"4","key":"2630_CR20","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.dam.2011.09.012","volume":"161","author":"M Haouari","year":"2013","unstructured":"Haouari M, Layeb SB, Sherali HD (2013) Tight compact models and comparative analysis for the prize collecting Steiner tree problem. Discrete Appl Math 161(4):618\u2013632","journal-title":"Discrete Appl Math"},{"issue":"1","key":"2630_CR21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"FK Hwang","year":"1992","unstructured":"Hwang FK, Richards DS (1992) Steiner tree problems. Networks 22(1):55\u201389","journal-title":"Networks"},{"key":"2630_CR22","unstructured":"Hwang FK, Richards DS, Winter P (1992) The Steiner tree problem, vol 53. Elsevier"},{"issue":"0.6","key":"2630_CR23","first-page":"4","volume":"1","author":"DS Johnson","year":"2000","unstructured":"Johnson DS, Minkoff M, Phillips S (2000) The prize collecting steiner tree problem: theory and practice. SODA 1(0.6):4","journal-title":"SODA"},{"issue":"2","key":"2630_CR24","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L Kou","year":"1981","unstructured":"Kou L, Markowsky G, Berman L (1981) A fast algorithm for Steiner trees. Acta Inform 15(2):141\u2013145","journal-title":"Acta Inform"},{"key":"2630_CR25","volume-title":"Combinatorial optimization: networks and matroids","author":"EL Lawler","year":"2001","unstructured":"Lawler EL (2001) Combinatorial optimization: networks and matroids. Courier Corporation, North Chelmsford"},{"issue":"3","key":"2630_CR26","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1016\/j.cie.2011.11.013","volume":"62","author":"W Lee","year":"2012","unstructured":"Lee W, Loh WK, Sohn MM (2012) Searching Steiner trees for web graph query. Comput Ind Eng 62(3):732\u2013739","journal-title":"Comput Ind Eng"},{"issue":"5","key":"2630_CR27","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1007\/s00500-014-1329-2","volume":"19","author":"G Liu","year":"2015","unstructured":"Liu G, Guo W, Niu Y, Chen G, Huang X (2015) A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reduction. Soft Comput 19(5):1153\u20131169","journal-title":"Soft Comput"},{"key":"2630_CR28","unstructured":"Ljubic I, Weiskircher R, Pferschy U, Klau GW, Mutzel P, Fischetti M (2005) Solving the prize-collecting Steiner tree problem to optimality. In: ALENEX\/ANALCO, pp 68\u201376"},{"key":"2630_CR29","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2003) Iterated local search. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics, vol 57. Springer, US, pp 320\u2013353","DOI":"10.1007\/0-306-48056-5_11"},{"key":"2630_CR30","unstructured":"Sinnl M (2011) Branch-and-price for the steiner tree problem with revenues, budget and hop constraints. Diplom-Ingenieur, Fakult\u00e4t f\u00fcr Informatik der Technischen Universit\u00e4t Wien"},{"issue":"4","key":"2630_CR31","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s12532-016-0102-1","volume":"8","author":"M Sinnl","year":"2016","unstructured":"Sinnl M, Ljubic I (2016) A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints. Math Program Comput 8(4):461\u2013490","journal-title":"Math Program Comput"},{"key":"2630_CR32","doi-asserted-by":"crossref","unstructured":"Smit SK, Eiben AE (2009) Comparing parameter tuning methods for evolutionary algorithms. In: IEEE congress on evolutionary computation, 2009. CEC\u201909, pp 399\u2013406","DOI":"10.1109\/CEC.2009.4982974"},{"key":"2630_CR33","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1018967121276","volume":"86","author":"S Vo\u00df","year":"1999","unstructured":"Vo\u00df S (1999) The Steiner tree problem with hop constraints. Ann Oper Res 86:321\u2013345","journal-title":"Ann Oper Res"},{"issue":"1","key":"2630_CR34","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1(1):67\u201382","journal-title":"IEEE Trans Evolut Comput"},{"issue":"9","key":"2630_CR35","first-page":"4560","volume":"219","author":"G Xu","year":"2013","unstructured":"Xu G (2013) An adaptive parameter tuning of particle swarm optimization algorithm. Appl Math Comput 219(9):4560\u20134569","journal-title":"Appl Math Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2630-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2630-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2630-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T12:22:04Z","timestamp":1569327724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2630-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,11]]},"references-count":35,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["2630"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2630-7","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,11]]}}}