{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:21:19Z","timestamp":1761582079307},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T00:00:00Z","timestamp":1618185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T00:00:00Z","timestamp":1618185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s11432-020-3115-5","type":"journal-article","created":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T06:31:42Z","timestamp":1618468302000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Focal distance tabu search"],"prefix":"10.1007","volume":"64","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,12]]},"reference":[{"key":"3115_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas A. Ising formulations of many NP problems. Front Phys, 2014, 2: 5","journal-title":"Front Phys"},{"key":"3115_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger G, Hao J K, Glover F, et al. The unconstrained binary quadratic programming problem: a survey. J Comb Optim, 2014, 28: 58\u201381","journal-title":"J Comb Optim"},{"key":"3115_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10288-019-00424-y","volume":"17","author":"F Glover","year":"2019","unstructured":"Glover F, Kochenberger G, Du Y. Quantum bridge analytics I: a tutorial on formulating and using QUBO models. 4OR-Q J Oper Res, 2019, 17: 335\u2013371","journal-title":"4OR-Q J Oper Res"},{"key":"3115_CR4","first-page":"11413","volume-title":"Quantum Technology and Optimization Problems","author":"T Vyskocil","year":"2019","unstructured":"Vyskocil T, Pakin S, Djidjev H N. Embedding inequality constraints for quantum annealling optimization. In: Quantum Technology and Optimization Problems. Cham: Springer, 2019. 11413"},{"key":"3115_CR5","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F. Future paths for integer programming and links to artificial intelligence. Comput Oper Res, 1986, 13: 533\u2013549","journal-title":"Comput Oper Res"},{"key":"3115_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover F. Heuristics for integer programming using surrogate constraints. Decision Sci, 1977, 8: 156\u2013166","journal-title":"Decision Sci"},{"key":"3115_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck G, Scheuer T. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys, 1990, 90: 161\u2013175","journal-title":"J Comput Phys"},{"key":"3115_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I H Osman","year":"1993","unstructured":"Osman I H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res, 1993, 41: 421\u2013451","journal-title":"Ann Oper Res"},{"key":"3115_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G Dueck","year":"1993","unstructured":"Dueck G. New optimization heuristics the great deluge algorithm and the record-to-record travel. J Comput Phys, 1993, 104: 86\u201392","journal-title":"J Comput Phys"},{"key":"3115_CR10","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","volume":"7","author":"F Glover","year":"1995","unstructured":"Glover F. Tabu thresholding: improved search by nonmonotonic trajectories. ORSA J Computing, 1995, 7: 426\u2013442","journal-title":"ORSA J Computing"},{"key":"3115_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-1-4613-1361-8_25","volume-title":"Meta-Heuristics: Theory & Applications","author":"F Glover","year":"1996","unstructured":"Glover F, Kochenberger G A. Critical event tabu search for multidimensional knapsack problems. In: Meta-Heuristics: Theory & Applications. Boston: Springer, 1996. 407\u2013427"},{"key":"3115_CR12","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R Battiti","year":"1994","unstructured":"Battiti R, Tecchiolli G. The reactive tabu search. ORSA J Comput, 1994, 6: 126\u2013140","journal-title":"ORSA J Comput"},{"key":"3115_CR13","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1016\/0305-0548(94)90018-3","volume":"21","author":"J P Kelly","year":"1994","unstructured":"Kelly J P, Laguna M, Glover F. A study of diversification strategies for the quadratic assignment problem. Comput Oper Res, 1994, 21: 885\u2013893","journal-title":"Comput Oper Res"},{"key":"3115_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02022565","volume":"41","author":"D L Woodruff","year":"1993","unstructured":"Woodruff D L, Zemel E. Hashing vectors for tabu search. Ann Oper Res, 1993, 41: 123\u2013137","journal-title":"Ann Oper Res"},{"key":"3115_CR15","first-page":"83","volume-title":"Meta-Heuristics","author":"F Glover","year":"1998","unstructured":"Glover F, Kochenberger G, Alidaee B, et al. Tabu search with critical event memory: an enhanced application for binary quadratic programs. In: Meta-Heuristics. Boston: Springer, 1998. 83\u2013109"},{"key":"3115_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M. Tabu Search. Boston: Springer Academic Publications, 1997"},{"key":"3115_CR17","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s10732-018-9403-z","volume":"25","author":"M Samorani","year":"2019","unstructured":"Samorani M, Wang Y, Wang Y, et al. Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem. J Heuristics, 2019, 25: 629\u2013642","journal-title":"J Heuristics"},{"key":"3115_CR18","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o H R, Martin O C, St\u00fczle T. Iterated local search: framework and applications. In: Handbook of Metaheuristics. Boston: Springer, 363\u2013397","DOI":"10.1007\/978-1-4419-1665-5_12"},{"key":"3115_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2015.09.047","volume":"250","author":"V N Coelho","year":"2016","unstructured":"Coelho V N, Grasas A, Ramalhinho H, et al. An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints. Eur J Oper Res, 2016, 250: 367\u2013376","journal-title":"Eur J Oper Res"},{"key":"3115_CR20","doi-asserted-by":"crossref","first-page":"4800","DOI":"10.1016\/j.amc.2012.10.106","volume":"219","author":"U Benlic","year":"2013","unstructured":"Benlic U, Hao J K. Breakout local search for the quadratic assignment problem. Appl Math Comput, 2013, 219: 4800\u20134815","journal-title":"Appl Math Comput"},{"key":"3115_CR21","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.ejor.2013.06.048","volume":"232","author":"Z H Fu","year":"2014","unstructured":"Fu Z H, Hao J K. Breakout local search for the Steiner tree problem with revenue, budget and hop constraints. Eur J Oper Res, 2014, 232: 209\u2013220","journal-title":"Eur J Oper Res"},{"key":"3115_CR22","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cor.2019.06.002","volume":"111","author":"Z Lu","year":"2019","unstructured":"Lu Z, Hao J K, Zhou Y. Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem. Comput Oper Res, 2019, 111: 43\u201357","journal-title":"Comput Oper Res"},{"key":"3115_CR23","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2016.07.012","volume":"258","author":"E K Burke","year":"2017","unstructured":"Burke E K, Bykov Y. The late acceptance hill-climbing heuristic. Eur J Oper Res, 2017, 258: 70\u201378","journal-title":"Eur J Oper Res"},{"key":"3115_CR24","first-page":"299","volume-title":"Advances in Artificial Intelligence","author":"M Namazi","year":"2018","unstructured":"Namazi M, Sanderson C, Newton M A H, et al. Diversified late acceptance search. In: Advances in Artificial Intelligence. Cham: Springer, 2018, 11320: 299\u2013311"},{"key":"3115_CR25","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-91086-4_6","volume-title":"Handbook of Metaheuristics","author":"M G C Resende","year":"2019","unstructured":"Resende M G C, Ribeiro C C. Greedy randomized adaptive search procedures: advances and extensions. In: Handbook of Metaheuristics. 3rd ed. Cham: Springer, 2019. 169\u2013220","edition":"3rd ed."},{"key":"3115_CR26","volume-title":"Research Report","author":"B Peng","year":"2019","unstructured":"Peng B, Liu D, Su Z, et al. Solving the Incremental Graph Drawing Problem by Solution-based Multiple Neighborhood Tabu Search. Research Report. Chengdu: Southwestern University of Finance and Economics, 2019"},{"key":"3115_CR27","unstructured":"Glover F. Analyzing and Exploiting Landscape Patterns in Combinatorial Optimization. School of Engineering and Applied Science, University of Colorado. 2019"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3115-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-020-3115-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3115-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T03:56:03Z","timestamp":1698897363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-020-3115-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,12]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["3115"],"URL":"https:\/\/doi.org\/10.1007\/s11432-020-3115-5","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,12]]},"assertion":[{"value":"10 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"150101"}}