{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:41:02Z","timestamp":1648856462431},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,10,8]],"date-time":"2009-10-08T00:00:00Z","timestamp":1254960000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10589-009-9290-1","type":"journal-article","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T15:06:36Z","timestamp":1254927996000},"page":"407-433","source":"Crossref","is-referenced-by-count":0,"title":["A framework for analyzing sub-optimal performance of\u00a0local search algorithms"],"prefix":"10.1007","volume":"49","author":[{"given":"Alexander G.","family":"Nikolaev","sequence":"first","affiliation":[]},{"given":"Sheldon H.","family":"Jacobson","sequence":"additional","affiliation":[]},{"given":"Shane N.","family":"Hall","sequence":"additional","affiliation":[]},{"given":"Darrall","family":"Henderson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,8]]},"reference":[{"key":"9290_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E. Aarts","year":"1997","unstructured":"Aarts, E., Lenstra, J.K.: Local Search in Combinatorial Optimization. Wiley, New York (1997)"},{"key":"9290_CR2","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1979","unstructured":"Billingsley, P.: Probability and Measure. Wiley, New York (1979)"},{"key":"9290_CR3","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G.A. Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6, 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"1","key":"9290_CR4","doi-asserted-by":"crossref","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. 90(1), 161\u2013175 (1990)","journal-title":"J. Comput. Phys."},{"key":"9290_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9290_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/b101874","volume-title":"Handbook of Metaheuristics","author":"F. Glover","year":"2003","unstructured":"Glover, F., Kochenberger, G.A.: Handbook of Metaheuristics. Kluwer Academic, Boston (2003)"},{"key":"9290_CR7","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":"9290_CR8","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman problem heuristic. Eur. J. Oper. Res. 126, 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9290_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/0-306-48056-5_10","volume-title":"State-of-the-Art Handbook in Metaheuristics","author":"D. Henderson","year":"2003","unstructured":"Henderson, D., Jacobson, S.H., Johnson, A.W.: The theory and practice of simulated annealing. In: Glover, F., Kochenberger, G. (eds.) State-of-the-Art Handbook in Metaheuristics, Chap.\u00a010, pp. 287\u2013319. Kluwer Academic, Norwell (2003)"},{"key":"9290_CR10","volume-title":"Introduction to Mathematical Statistics","author":"R.V. Hogg","year":"1995","unstructured":"Hogg, R.V., Craig, A.T.: Introduction to Mathematical Statistics. Prentice Hall, Englewood Cliffs (1995)"},{"key":"9290_CR11","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H.H. Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Elsevier\/Morgan Kaufmann, San Francisco (2004)"},{"key":"9290_CR12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/B:JOGO.0000042111.72036.11","volume":"29","author":"S.H. Jacobson","year":"2004","unstructured":"Jacobson, S.H., Yucesan, E.: Global optimization performance measures for generalized hill climbing algorithms. J. Glob. Optim. 29, 177\u2013193 (2004)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"9290_CR13","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1023\/B:HEUR.0000034712.48917.a9","volume":"10","author":"S.H. Jacobson","year":"2004","unstructured":"Jacobson, S.H., Yucesan, E.: Analyzing the performance of generalized hill climbing algorithms. J.\u00a0Heuristics 10(4), 387\u2013405 (2004)","journal-title":"J.\u00a0Heuristics"},{"key":"9290_CR14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1080\/03052159808941372","volume":"31","author":"S.H. Jacobson","year":"1998","unstructured":"Jacobson, S.H., Sullivan, K.A., Johnson, A.W.: Discrete manufacturing process design optimization using computer simulation and generalized hill climbing algorithms. Eng. Optim. 31, 247\u2013260 (1998)","journal-title":"Eng. Optim."},{"key":"9290_CR15","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0096-3003(00)00137-5","volume":"125","author":"A.W. Johnson","year":"2002","unstructured":"Johnson, A.W., Jacobson, S.H.: A class of convergent generalized hill climbing algorithms. Appl. Math. Comput. 125, 359\u2013373 (2002)","journal-title":"Appl. Math. Comput."},{"key":"9290_CR16","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0166-218X(01)00264-5","volume":"119","author":"A.W. Johnson","year":"2002","unstructured":"Johnson, A.W., Jacobson, S.H.: On the convergence of generalized hill climbing algorithms. Discrete Appl. Math. 119, 37\u201357 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"9290_CR17","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/0305-0548(94)90016-7","volume":"21","author":"J. Knox","year":"1994","unstructured":"Knox, J.: Tabu search performance on the symmetric traveling salesman problem. Comput. Oper. Res. 21(8), 867\u2013876 (1994)","journal-title":"Comput. Oper. Res."},{"key":"9290_CR18","volume-title":"Simulation Modeling and Analysis","author":"A.M. Law","year":"2000","unstructured":"Law, A.M., Kelton, W.D.: Simulation Modeling and Analysis, 3rd edn. McGraw Hill, New York (2000)","edition":"3"},{"key":"9290_CR19","volume-title":"The Traveling Salesman Problem","author":"E.L. Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, L.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem. Wiley, Chichester (1985)"},{"key":"9290_CR20","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic for the traveling salesman problem. Oper. Res. 21, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"9290_CR21","unstructured":"LKH, 2005. LKH Version 1.3 (July 2002). Retrieved Nov 7, 2005 from http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH"},{"key":"9290_CR22","unstructured":"Nikolaev, A.G., Jacobson, S.H.: Using Markov chains to analyze the effectiveness of local search algorithms. Technical Report, The University of Illinois at Urbana-Champaign, Urbana, IL (2009)"},{"issue":"1","key":"9290_CR23","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1013544329096","volume":"21","author":"J.E. Orosz","year":"2002","unstructured":"Orosz, J.E., Jacobson, S.H.: Finite-time performance analysis of static simulated annealing algorithms. Comput. Optim. Appl. 21(1), 21\u201353 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"9290_CR24","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013385 (1991)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"9290_CR25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0377-2217(96)00334-7","volume":"104","author":"S. Tsubakitani","year":"1998","unstructured":"Tsubakitani, S., Evans, J.R.: An empirical study of a new metaheuristic for the traveling salesman problem. Eur. J. Oper. Res. 104(1), 113\u2013128 (1998)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9290-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9290-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9290-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:37Z","timestamp":1559302597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9290-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,8]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9290"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9290-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,8]]}}}