{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:37Z","timestamp":1740099037325,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319781327"},{"type":"electronic","value":"9783319781334"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78133-4_2","type":"book-chapter","created":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T02:42:59Z","timestamp":1521427379000},"page":"16-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Comparison of Acceptance Criteria in Randomized Local Searches"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4066-0375","authenticated-orcid":false,"given":"Alberto","family":"Franzin","sequence":"first","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,20]]},"reference":[{"issue":"4","key":"2_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1093\/comjnl\/3.4.237","volume":"3","author":"J Appleby","year":"1961","unstructured":"Appleby, J., Blake, D., Newman, E.: Techniques for producing school timetables on a computer and their application to other scheduling problems. Comput. J. 3(4), 237\u2013245 (1961)","journal-title":"Comput. J."},{"issue":"3","key":"2_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00401706.1986.10488128","volume":"28","author":"IO Bohachevsky","year":"1986","unstructured":"Bohachevsky, I.O., Johnson, M.E., Stein, M.L.: Generalized simulated annealing for function optimization. Technometrics 28(3), 209\u2013217 (1986)","journal-title":"Technometrics"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., \u00c7ela, E., Pardalos, P.M., Pitsoulis, L.S.: The quadratic assignment problem. In: Handbook of Combinatorial Optimization, vol. 2, pp. 241\u2013338. Kluwer Academic Publishers (1998)","DOI":"10.1007\/978-1-4613-0303-9_27"},{"key":"2_CR4","unstructured":"Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Technical report CSM-192, University of Stirling (2012)"},{"issue":"1","key":"2_CR5","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2016.07.012","volume":"258","author":"EK Burke","year":"2017","unstructured":"Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Eur. J. Oper. Res. 258(1), 70\u201378 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2_CR6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.12785\/amis\/081L26","volume":"8","author":"RM Chen","year":"2014","unstructured":"Chen, R.M., Hsieh, F.R.: An exchange local search heuristic based scheme for permutation flow shop problems. Appl. Math. Inf. Sci. 8(1), 209\u2013215 (2014)","journal-title":"Appl. Math. Inf. Sci."},{"issue":"1","key":"2_CR7","doi-asserted-by":"crossref","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. 104(1), 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"issue":"1","key":"2_CR8","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":"2_CR9","volume-title":"Stochastic Local Search-Foundations and Applications","author":"HH Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search-Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)"},{"key":"2_CR10","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, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., St\u00fctzle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"issue":"3","key":"2_CR12","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/j.ejor.2013.10.043","volume":"235","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2014","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Automatically improving the anytime behaviour of optimisation algorithms. Eur. J. Oper. Res. 235(3), 569\u2013582 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-44973-4_36","volume-title":"Learning and Intelligent Optimization","author":"F Mascia","year":"2013","unstructured":"Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T.: From grammars to parameters: automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness. In: Nicosia, G., Pardalos, P. (eds.) LION 2013. LNCS, vol. 7997, pp. 321\u2013334. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-44973-4_36"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"issue":"4","key":"2_CR15","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0375-9601(90)90166-L","volume":"146","author":"P Moscato","year":"1990","unstructured":"Moscato, P., Fontanari, J.F.: Stochastic versus deterministic update in simulated annealing. Phys. Lett. A 146(4), 204\u2013208 (1990)","journal-title":"Phys. Lett. A"},{"issue":"1","key":"2_CR16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore Jr., E., Ham, I.: A heuristic algorithm for the \n            $$m$$\n          -machine, \n            $$n$$\n          -job flow-shop sequencing problem. Omega 11(1), 91\u201395 (1983)","journal-title":"Omega"},{"issue":"3","key":"2_CR17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","volume":"17","author":"FA Ogbu","year":"1990","unstructured":"Ogbu, F.A., Smith, D.K.: The application of the simulated annealing algorithm to the solution of the n\/m\/C max flowshop problem. Comput. Oper. Res. 17(3), 243\u2013253 (1990)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2012.04.034","volume":"222","author":"QK Pan","year":"2012","unstructured":"Pan, Q.K., Ruiz, R.: Local search methods for the flowshop scheduling problem with flowtime minimization. Eur. J. Oper. Res. 222(1), 31\u201343 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2_CR19","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.cor.2012.05.018","volume":"40","author":"QK Pan","year":"2013","unstructured":"Pan, Q.K., Ruiz, R.: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Comput. Oper. Res. 40(1), 117\u2013128 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"2_CR20","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.1016\/j.ejor.2005.01.066","volume":"174","author":"T St\u00fctzle","year":"2006","unstructured":"St\u00fctzle, T.: Iterated local search for the quadratic assignment problem. Eur. J. Oper. Res. 174(3), 1519\u20131539 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2_CR21","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"\u00c9D Taillard","year":"1993","unstructured":"Taillard, \u00c9.D.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2_CR22","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"\u00c9D Taillard","year":"1995","unstructured":"Taillard, \u00c9.D.: Comparison of iterative searches for the quadratic assignment problem. Location Sci. 3(2), 87\u2013105 (1995)","journal-title":"Location Sci."},{"issue":"1","key":"2_CR23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V \u010cern\u00fd","year":"1985","unstructured":"\u010cern\u00fd, V.: A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45(1), 41\u201351 (1985)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78133-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T02:44:00Z","timestamp":1521427440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78133-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319781327","9783319781334"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78133-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}