{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:34:30Z","timestamp":1761597270132},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,5,3]],"date-time":"2011-05-03T00:00:00Z","timestamp":1304380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10732-011-9167-1","type":"journal-article","created":{"date-parts":[[2011,5,2]],"date-time":"2011-05-02T15:27:53Z","timestamp":1304350073000},"page":"193-214","source":"Crossref","is-referenced-by-count":59,"title":["Path-relinking intensification methods for stochastic local search algorithms"],"prefix":"10.1007","volume":"18","author":[{"given":"Celso C.","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,3]]},"reference":[{"key":"9167_CR1","first-page":"301","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"R.M. Aiex","year":"2005","unstructured":"Aiex, R.M., Resende, M.G.C.: Parallel strategies for GRASP with path-relinking. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 301\u2013331. Springer, Berlin (2005)"},{"key":"9167_CR2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R.M. Aiex","year":"2002","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: An experimental investigation. J. Heuristics 8, 343\u2013373 (2002)","journal-title":"J. Heuristics"},{"key":"9167_CR3","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"R.M. Aiex","year":"2003","unstructured":"Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput. 29, 393\u2013430 (2003)","journal-title":"Parallel Comput."},{"key":"9167_CR4","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/ijoc.1030.0059","volume":"17","author":"R.M. Aiex","year":"2005","unstructured":"Aiex, R.M., Pardalos, P.M., Resende, M.G.C., Toraldo, G.: GRASP with path-relinking for three-index assignment. INFORMS J. Comput. 17, 224\u2013247 (2005)","journal-title":"INFORMS J. Comput."},{"key":"9167_CR5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"R.M. Aiex","year":"2007","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: TTTPLOTS: A perl program to create time-to-target plots. Optim. Lett. 1, 355\u2013366 (2007)","journal-title":"Optim. Lett."},{"key":"9167_CR6","volume-title":"Proceedings of the International Network Optimization Conference","author":"D.V. Andrade","year":"2007","unstructured":"Andrade, D.V., Resende, M.G.C.: GRASP with path-relinking for network migration scheduling. In: Proceedings of the International Network Optimization Conference (2007a)"},{"key":"9167_CR7","unstructured":"Andrade, D.V., Resende, M.G.C.: GRASP with evolutionary path-relinking. Technical report, AT&T Labs Research, Florham Park (2007b)"},{"key":"9167_CR8","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1016\/j.cor.2010.10.026","volume":"38","author":"V.A. Armentano","year":"2010","unstructured":"Armentano, V.A., Shiguemoto, A.L., L\u00f8kketangen, A.: Tabu search with path relinking for an integrated production-distribution problem. Comput. Oper. Res. 38, 1199\u20131209 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9167_CR9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-1-4615-1507-4_2","volume-title":"Essays and Surveys in Metaheuristics","author":"M.P. Bastos","year":"2002","unstructured":"Bastos, M.P., Ribeiro, C.C.: Reactive tabu search with path-relinking for the Steiner problem in graphs. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 39\u201358. Kluwer Academic, Norwell (2002)"},{"key":"9167_CR10","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"S.A. Canuto","year":"2001","unstructured":"Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38, 50\u201358 (2001)","journal-title":"Networks"},{"key":"9167_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/TPWRS.2004.835627","volume":"20","author":"H. Faria Jr.","year":"2005","unstructured":"Faria\u00a0Jr., H., Binato, S., Resende, M.G.C., Falc\u00e3o, D.J.: Transmission network design by a greedy randomized adaptive path relinking approach. IEEE Trans. Power Syst. 20, 43\u201349 (2005)","journal-title":"IEEE Trans. Power Syst."},{"key":"9167_CR12","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T.A. Feo","year":"1994","unstructured":"Feo, T.A., Resende, M.G.C., Smith, S.H.: A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42, 860\u2013878 (1994)","journal-title":"Oper. Res."},{"key":"9167_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00663.x","volume":"16","author":"P. Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP, Part I: Algorithms. Int. Trans. Oper. Res. 16, 1\u201324 (2009a)","journal-title":"Int. Trans. Oper. Res."},{"key":"9167_CR14","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.1475-3995.2009.00664.x","volume":"16","author":"P. Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP, Part\u00a0II: Applications. Int. Trans. Oper. Res. 16, 131\u2013172 (2009b)","journal-title":"Int. Trans. Oper. Res."},{"key":"9167_CR15","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"6","author":"P. Festa","year":"2002","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: Randomized heuristics for the max-cut problem. Optim. Methods Softw. 6, 1033\u20131058 (2002)","journal-title":"Optim. Methods Softw."},{"key":"9167_CR16","first-page":"1","volume":"11","author":"P. Festa","year":"2006","unstructured":"Festa, P., Pardalos, P.M., Pitsoulis, L.S., Resende, M.G.C.: GRASP with path-relinking for the weighted MAXSAT problem. ACM J. Exp. Algorithmics 11, 1\u201316 (2006)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"9167_CR17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0167-6377(96)00025-9","volume":"19","author":"J.B. Ghosh","year":"1996","unstructured":"Ghosh, J.B.: Computational aspects of the maximum diversity problem. Oper. Res. Lett. 19, 175\u2013181 (1996)","journal-title":"Oper. Res. Lett."},{"key":"9167_CR18","doi-asserted-by":"crossref","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. 8, 156\u2013166 (1977)","journal-title":"Decision Sci."},{"key":"9167_CR19","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Tabu search and adaptive memory programing\u2014advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1\u201375. Kluwer Academic, Norwell (1996)"},{"key":"9167_CR20","first-page":"13","volume":"1363","author":"F. Glover","year":"1998","unstructured":"Glover, F.: A template for scatter search and path relinking. Lect. Notes Comput. Sci. 1363, 13\u201354 (1998)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9167_CR21","first-page":"297","volume-title":"New Ideas in Optimization","author":"F. Glover","year":"1999","unstructured":"Glover, F.: Scatter search and path relinking. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 297\u2013316. McGraw-Hill, New York (1999)"},{"key":"9167_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4615-4567-5_1","volume-title":"Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research","author":"F. Glover","year":"2000","unstructured":"Glover, F.: Multi-start and strategic oscillation methods\u2014Principles to exploit adaptive memory. In: Laguna, M., Gonz\u00e1les-Velarde, J.L. (eds.) Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 1\u201324. Kluwer Academic, Norwell (2000)"},{"key":"9167_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Norwell (1997)"},{"key":"9167_CR24","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path relinking. Control Cybern. 39, 653\u2013684 (2000)","journal-title":"Control Cybern."},{"key":"9167_CR25","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/978-3-642-18965-4_20","volume-title":"Advances in Evolutionary Computation: Theory and Applications","author":"F. Glover","year":"2003","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Scatter search. In: Ghosh, A., Tsutsui, S. (eds.) Advances in Evolutionary Computation: Theory and Applications, pp. 519\u2013537. Springer, Berlin (2003)"},{"key":"9167_CR26","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-540-39930-8_4","volume-title":"New Optimization Techniques in Engineering","author":"F. Glover","year":"2004","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Scatter search and path relinking: Foundations and advanced designs. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, vol. 141, pp. 87\u2013100. Springer, Berlin (2004)"},{"key":"9167_CR27","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/978-1-4615-1507-4_19","volume-title":"Essays and Surveys in Metaheuristics","author":"P. Hansen","year":"2002","unstructured":"Hansen, P., Mladenovi\u0107, N.: Developments of variable neighborhood search. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 415\u2013439. Kluwer Academic, Norwell (2002)"},{"key":"9167_CR28","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10732-006-4192-1","volume":"12","author":"S.C. Ho","year":"2006","unstructured":"Ho, S.C., Gendreau, M.: Path relinking for the vehicle routing problem. J. Heuristics 12, 55\u201372 (2006)","journal-title":"J. Heuristics"},{"key":"9167_CR29","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, East Lansing (1975)"},{"key":"9167_CR30","first-page":"238","volume-title":"Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence","author":"H.H. Hoos","year":"1998","unstructured":"Hoos, H.H., St\u00fctzle, T.: Evaluation of Las Vegas algorithms\u2014Pitfalls and remedies. In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pp. 238\u2013245 (1998)"},{"key":"9167_CR31","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"9167_CR32","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02060482","volume":"40","author":"R.K. Kincaid","year":"1992","unstructured":"Kincaid, R.K.: Good solutions to discrete noxious location problems via metaheuristics. Ann. Oper. Res. 40, 265\u2013281 (1992)","journal-title":"Ann. Oper. Res."},{"issue":"4598","key":"9167_CR33","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt\u00a0Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"9167_CR34","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M., Mart\u00ed, R.: GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11, 44\u201352 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9167_CR35","series-title":"Computer Science Interfaces Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter search: Methodology and implementations in C. Operations Research","author":"M. Laguna","year":"2003","unstructured":"Laguna, M., Mart\u00ed, R.: Scatter search: Methodology and implementations in C. Operations Research. Computer Science Interfaces Series, Kluwer Academic, Boston (2003)"},{"key":"9167_CR36","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.ejor.2004.08.003","volume":"169","author":"R. Mart\u00ed","year":"2006","unstructured":"Mart\u00ed, R.: Feature cluster on scatter search methods for optimization. Eur. J. Oper. Res., 169, 351\u2013698 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9167_CR37","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9167_CR38","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/978-3-540-24838-5_27","volume":"3059","author":"C.A. Oliveira","year":"2004","unstructured":"Oliveira, C.A., Pardalos, P.M., Resende, M.G.C.: GRASP with path-relinking for the quadratic assignment problem. Lect. Notes Comput. Sci. 3059, 356\u2013368 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9167_CR39","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.amc.2007.07.022","volume":"196","author":"M. Ranjbar","year":"2008","unstructured":"Ranjbar, M., Kianfar, F., Shadrokh, S.: Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Appl. Math. Comput. 196, 879\u2013888 (2008)","journal-title":"Appl. Math. Comput."},{"key":"9167_CR40","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1007\/978-3-540-71805-5_78","volume":"4448","author":"M. Reghioui","year":"2007","unstructured":"Reghioui, M., Prins, C., Labadi, N.: GRASP with path relinking for the capacitated arc routing problem with time windows. Lect. Notes Comp. Sci. 4448, 722\u2013731 (2007)","journal-title":"Lect. Notes Comp. Sci."},{"key":"9167_CR41","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-1-4419-1665-5_4","volume-title":"Handbook of Metaheuristics","author":"M.G.C. Resende","year":"2010","unstructured":"Resende, M.G.C., Ribeiro, C.C., Glover, F., Mart\u00ed, R.: Scatter search and path-relinking: Fundamentals, advances, and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd.\u00a0edn., pp.\u00a087\u2013107. Springer, Berlin (2010a)","edition":"2"},{"key":"9167_CR42","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics","author":"M.G.C. Resende","year":"2003","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219\u2013242. Kluwer Academic, Norwell (2003a)"},{"key":"9167_CR43","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/net.10065","volume":"41","author":"M.G.C. Resende","year":"2003","unstructured":"Resende, M.G.C., Ribeiro, C.C.: A GRASP with path-relinking for private virtual circuit routing. Networks 41, 104\u2013114 (2003b)","journal-title":"Networks"},{"key":"9167_CR44","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/0-387-25383-1_2","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"M.G.C. Resende","year":"2005","unstructured":"Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: Recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 29\u201363. Springer, Berlin (2005)"},{"key":"9167_CR45","volume-title":"Handbook of Metaheuristics","author":"M.G.C. Resende","year":"2010","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures: Advances, hybridizations, and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd edn. Springer, Berlin (2010)","edition":"2"},{"key":"9167_CR46","volume-title":"Search Methodologies","author":"M.G.C. Resende","year":"2011","unstructured":"Resende, M.G.C., Ribeiro, C.C.: GRASP. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, 2nd edn. Springer, Berlin (2011)","edition":"2"},{"key":"9167_CR47","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"M.G.C. Resende","year":"2004","unstructured":"Resende, M.G.C., Werneck, R.F.: A hybrid heuristic for the p-median problem. J. Heuristics 10, 59\u201388 (2004)","journal-title":"J. Heuristics"},{"key":"9167_CR48","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2005.02.046","volume":"174","author":"M.G.C. Resende","year":"2006","unstructured":"Resende, M.G.C., Werneck, R.F.: A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. 174, 54\u201368 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9167_CR49","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"M.G.C. Resende","year":"2010","unstructured":"Resende, M.G.C., Mart\u00ed, R., Gallego, M., Duarte, A.: GRASP and path relinking for the max-min diversity problem. Comput. Oper. Res. 37, 498\u2013508 (2010b)","journal-title":"Comput. Oper. Res."},{"key":"9167_CR50","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.parco.2006.11.007","volume":"33","author":"C.C. Ribeiro","year":"2007","unstructured":"Ribeiro, C.C., Rosseti, I.: Efficient parallel cooperative implementations of GRASP heuristics. Parallel Comput. 33, 21\u201335 (2007)","journal-title":"Parallel Comput."},{"key":"9167_CR51","volume-title":"Proceedings of the VIII Metaheuristics International Conference","author":"C.C. Ribeiro","year":"2009","unstructured":"Ribeiro, C.C., Rosseti, I.: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. In: Proceedings of the VIII Metaheuristics International Conference, Hamburg (2009)"},{"key":"9167_CR52","first-page":"97","volume-title":"Anais do II Workshop Brasileiro de Bioinform\u00e1tica","author":"C.C. Ribeiro","year":"2003","unstructured":"Ribeiro, C.C., Vianna, D.S.: A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking. In: Anais do II Workshop Brasileiro de Bioinform\u00e1tica, Maca\u00e9, pp. 97\u2013102 (2003)"},{"key":"9167_CR53","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1111\/j.1475-3995.2009.00699.x","volume":"16","author":"C.C. Ribeiro","year":"2009","unstructured":"Ribeiro, C.C., Vianna, D.S.: A hybrid genetic algorithm for the phylogeny problem using path-relinking as a progressive crossover strategy. Int. Trans. Oper. Res. 16, 641\u2013657 (2009)","journal-title":"Int. Trans. Oper. Res."},{"key":"9167_CR54","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J. Comput. 14, 228\u2013246 (2002)","journal-title":"INFORMS J. Comput."},{"key":"9167_CR55","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-642-03751-1_2","volume":"5752","author":"C.C. Ribeiro","year":"2009","unstructured":"Ribeiro, C.C., Rosseti, I., Vallejos, R.: On the use of run time distributions to evaluate and compare stochastic local search algorithms. Lect. Notes Comput. Sci. 5752, 16\u201330 (2009)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9167_CR56","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4321-0","volume-title":"The Cross Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning","author":"R.Y. Rubinstein","year":"2004","unstructured":"Rubinstein, R.Y., Kroese, D.P.: The Cross Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning. Springer, Berlin (2004)"},{"key":"9167_CR57","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10732-005-7000-4","volume":"11","author":"M. Scaparra","year":"2005","unstructured":"Scaparra, M., Church, R.: A GRASP and path relinking heuristic for rural road network development. J. Heuristics 11, 89\u2013108 (2005)","journal-title":"J. Heuristics"},{"key":"9167_CR58","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.omega.2009.04.002","volume":"38","author":"E. Vallada","year":"2010","unstructured":"Vallada, E., Ruiz, R.: Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Omega 38, 57\u201367 (2010)","journal-title":"Omega"},{"key":"9167_CR59","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.ejor.2004.08.007","volume":"169","author":"G.Q. Zhang","year":"2006","unstructured":"Zhang, G.Q., Lai, K.K.: Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem. Eur. J. Oper. Res. 169, 413\u2013425 (2006)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9167-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9167-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9167-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T08:48:14Z","timestamp":1560156494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9167-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,3]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9167"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9167-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,3]]}}}