{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T02:38:18Z","timestamp":1778553498152,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71501157"],"award-info":[{"award-number":["71501157"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["3102017zy059"],"award-info":[{"award-number":["3102017zy059"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10732-018-9403-z","type":"journal-article","created":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T04:42:28Z","timestamp":1546317748000},"page":"629-642","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem"],"prefix":"10.1007","volume":"25","author":[{"given":"Michele","family":"Samorani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,1]]},"reference":[{"issue":"4","key":"9403_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"RM Aiex","year":"2003","unstructured":"Aiex, R.M., Binato, S., Resende, M.G.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput. 29(4), 393\u2013430 (2003)","journal-title":"Parallel Comput."},{"key":"9403_CR2","first-page":"217","volume":"4","author":"T Cox","year":"1995","unstructured":"Cox, T., Bell, G., Glover, F.: A new learning approach to process improvement in a telecommunications company. Total Qual. Manag. Benchmark. Prod. Oper. Manag. 4, 217\u2013227 (1995)","journal-title":"Total Qual. Manag. Benchmark. Prod. Oper. Manag."},{"issue":"1","key":"9403_CR3","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. Decis. Sci. 8(1), 156\u2013166 (1977)","journal-title":"Decis. Sci."},{"key":"9403_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0166-218X(94)90211-9","volume":"49","author":"F Glover","year":"1994","unstructured":"Glover, F.: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Appl. Math. 49, 231\u2013255 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9403_CR5","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. Comput. 7(4), 426\u2013442 (1995)","journal-title":"ORSA J. Comput."},{"issue":"3","key":"9403_CR6","first-page":"653","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29(3), 653\u2013684 (2000)","journal-title":"Control Cybern."},{"key":"9403_CR7","first-page":"1","volume-title":"Scatter Search and Path Relinking: Advances and Applications, Handbook of Metaheuristics","author":"F Glover","year":"2003","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Scatter Search and Path Relinking: Advances and Applications, Handbook of Metaheuristics, pp. 1\u201335. Springer, New York (2003)"},{"issue":"1","key":"9403_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1504\/IJMHEUR.2010.033120","volume":"1","author":"F Glover","year":"2010","unstructured":"Glover, F., Hao, J.-K.: Efficient evaluation for solving 0\u20131 unconstrained quadratic optimization problems. Int. J. Metaheuristics 1(1), 3\u201310 (2010)","journal-title":"Int. J. Metaheuristics"},{"issue":"3","key":"9403_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10288-009-0115-y","volume":"8","author":"F Glover","year":"2010","unstructured":"Glover, F., L\u00fc, Z., Hao, J.-K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR Q. J. Oper. Res. 8(3), 239\u2013253 (2010)","journal-title":"4OR Q. J. Oper. Res."},{"issue":"1","key":"9403_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10479-009-0574-8","volume":"183","author":"F Glover","year":"2011","unstructured":"Glover, F., Cox, L., Patil, R., Kelly, J.P.: Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection. Ann. Oper. Res. 183(1), 47\u201373 (2011)","journal-title":"Ann. Oper. Res."},{"issue":"1\u20132","key":"9403_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10732-006-4192-1","volume":"12","author":"SC Ho","year":"2006","unstructured":"Ho, S.C., Gendreau, M.: Path relinking for the vehicle routing problem. J. Heuristics 12(1\u20132), 55\u201372 (2006)","journal-title":"J. Heuristics"},{"key":"9403_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2008.01.039","volume":"195","author":"LM Hvattum","year":"2009","unstructured":"Hvattum, L.M., Glover, F.: Finding local optima of high-dimensional functions using direct search. Eur. J. Oper. Res. 195, 31\u201345 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"9403_CR13","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"7","author":"T Kanungo","year":"2002","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 7, 881\u2013892 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"9403_CR14","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., Lewis, M., Lu, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58\u201381 (2014)","journal-title":"J. Comb. Optim."},{"key":"9403_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.engappai.2016.02.008","volume":"52","author":"X Lai","year":"2016","unstructured":"Lai, X., Hao, J.-K., L\u00fc, Z., Glover, F.: A learning-based path relinking algorithm for the bandwidth coloring problem. Eng. Appl. Artif. Intell. 52, 81\u201391 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"9403_CR16","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.ejor.2010.06.039","volume":"207","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Glover, F., Hao, J.-K.: A hybrid metaheuristic approach to solving the UBQP problem. Eur. J. Oper. Res. 207(3), 1254\u20131262 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9403_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/B:ANOR.0000039522.58036.68","volume":"131","author":"G Palubeckis","year":"2004","unstructured":"Palubeckis, G.: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann. Oper. Res. 131, 259\u2013282 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9403_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.15388\/Informatica.2006.138","volume":"17","author":"G Palubeckis","year":"2006","unstructured":"Palubeckis, G.: Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17(2), 279\u2013296 (2006)","journal-title":"Informatica"},{"issue":"2","key":"9403_CR19","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1287\/ijoc.1110.0451","volume":"24","author":"M Samorani","year":"2012","unstructured":"Samorani, M., Laguna, M.: Data-mining-driven neighborhood search. INFORMS J. Comput. 24(2), 210\u2013227 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"9403_CR20","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1111\/j.1475-3995.2008.00644.x","volume":"15","author":"LF Santos","year":"2008","unstructured":"Santos, L.F., Martins, S.L., Plastino, A.: Applications of the DMGRASP heuristic: a survey. Int. Trans. Oper. Res. 15(4), 387\u2013416 (2008)","journal-title":"Int. Trans. Oper. Res."},{"key":"9403_CR21","unstructured":"Sorensen, K., Sevaux, M., Glover, F.: A history of metaheuristics. In: Marti, R., Pardalos, P., Resende, M. (eds.) Handbook of Heuristics. Springer to appear (2018). arXiv:1704.00853 [cs.AI]"},{"key":"9403_CR22","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.ejor.2012.07.012","volume":"223","author":"Y Wang","year":"2012","unstructured":"Wang, Y., L\u00fc, Z., Glover, F., Hao, J.-K.: Path relinking for unconstrained binary quadratic programming. Eur. J. Oper. Res. 223, 595\u2013604 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9403_CR23","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.ejor.2016.10.035","volume":"258","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Wu, Q., Glover, F.: Effective metaheuristic algorithms for the minimum differential dispersion problem. Eur. J. Oper. Res. 258(3), 829\u2013843 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"9403_CR24","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.ins.2018.03.045","volume":"450","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Wu, Q., Punnen, A.P., Glover, F.: Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables. Inf. Sci. 450, 284\u2013300 (2018)","journal-title":"Inf. Sci."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9403-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-018-9403-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9403-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,21]],"date-time":"2020-11-21T07:17:30Z","timestamp":1605943050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-018-9403-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":24,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["9403"],"URL":"https:\/\/doi.org\/10.1007\/s10732-018-9403-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]},"assertion":[{"value":"11 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}