{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:41:03Z","timestamp":1759848063879},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,4,28]],"date-time":"2015-04-28T00:00:00Z","timestamp":1430179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10472-015-9453-y","type":"journal-article","created":{"date-parts":[[2015,4,27]],"date-time":"2015-04-27T10:35:17Z","timestamp":1430130917000},"page":"59-82","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving local-search metaheuristics through look-ahead policies"],"prefix":"10.1007","volume":"76","author":[{"given":"David","family":"Meignan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Schwarze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,28]]},"reference":[{"key":"9453_CR1","first-page":"27","volume-title":"SEMCCO 2011. Vol. 7077 of Lecture Notes in Computer Science","author":"MA Awadallah","year":"2011","unstructured":"Awadallah, M.A., Khader, A.T., Al-Betar, M.A., Bolaji, A.L.: Nurse rostering using modified harmony search algorithm. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C (eds.) SEMCCO 2011. Vol. 7077 of Lecture Notes in Computer Science, pp 27\u201337. Springer, Berlin Heidelberg (2011)"},{"key":"9453_CR2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1009635226865","volume":"3","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N., Wu, C.: Rollout algorithms for combinatorial optimization. J. Heuristics 3, 245\u2013262 (1997)","journal-title":"J. Heuristics"},{"key":"9453_CR3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10732-011-9192-0","volume":"18","author":"B Bilgin","year":"2012","unstructured":"Bilgin, B., Demeester, P., Misir, M., Vancroonenburg, W., Berghe, G.V.: One hyper-heuristic approach to two timetabling problems in health care. J. Heuristics 18, 401\u2013434 (2012)","journal-title":"J. Heuristics"},{"issue":"3","key":"9453_CR4","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268\u2013308 (2003)","journal-title":"ACM Comput. Surv."},{"key":"9453_CR5","first-page":"449","volume-title":"Handbook of Metaheuristics, Vol. 146 of International Series in Operations Research & Management Science","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, Vol. 146 of International Series in Operations Research & Management Science, pp 449\u2013468. Springer, New York (2010)"},{"key":"9453_CR6","first-page":"631","volume-title":"Learning and Intelligent Optimization, Vol. 6683 of Lecture Notes in Computer Science","author":"EK Burke","year":"2011","unstructured":"Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., McCollum, B., Ochoa, G., Parkes, A.J., Petrovic, S.: The cross-domain heuristic search challenge - an international research competition. In: Coello Coello, C.A (ed.) Learning and Intelligent Optimization, Vol. 6683 of Lecture Notes in Computer Science, pp 631\u2013634. Springer, Berlin Heidelberg (2011)"},{"issue":"3","key":"9453_CR7","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1287\/ijoc.1120.0510","volume":"25","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., Curtois, T., Qu, R., Berghe, G.V.: A time predefined variable depth search for nurse rostering. INFORMS J. Comp. 25(3), 411\u2013419 (2013)","journal-title":"INFORMS J. Comp."},{"key":"9453_CR8","first-page":"247","volume-title":"Handbook of Terminal Planning, Operations Research\/Computer Science Interfaces Series, vol. 49","author":"M Caserta","year":"2011","unstructured":"Caserta, M., Schwarze, S., Vo\u00df, S.: Container rehandling at maritime container terminals. In: B\u00f6se, J.W. (ed.) Handbook of Terminal Planning, Operations Research\/Computer Science Interfaces Series, vol. 49, pp 247\u2013269. Springer, New York (2011)"},{"key":"9453_CR9","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s00291-011-0238-3","volume":"33","author":"C Cotta","year":"2011","unstructured":"Cotta, C.: Effective patient prioritization in mass casualty incidents using hyperheuristics and the pilot method. OR Spectr. 33, 699\u2013720 (2011)","journal-title":"OR Spectr."},{"key":"9453_CR10","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/978-3-642-78910-6_160","volume-title":"Operations Research Proceedings 1993","author":"C Duin","year":"1994","unstructured":"Duin, C., Vo\u00df, S.: Steiner tree heuristics - a survey. In: Dyckhoff, H., Derigs, U., Salomon, M., Tijms, H. (eds.) Operations Research Proceedings 1993, pp 485\u2013496. Springer, Berlin (1994)"},{"key":"9453_CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C Duin","year":"1999","unstructured":"Duin, C., Vo\u00df, S.: The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs. Networks 34, 181\u2013191 (1999)","journal-title":"Networks"},{"key":"9453_CR12","unstructured":"Frost, D., Dechter, R.: Look-ahead value ordering for constraint satisfaction problems In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp 572\u2013578 (1995)"},{"key":"9453_CR13","unstructured":"Geiger, M., Sevaux, M., Vo\u00df, S.: Neigborhood selection in variable neighborhood search In: Proceedings of the Metaheuristics International Conference. Udine (2011)"},{"key":"9453_CR14","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., Moreno P\u00e9rez, J.A.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y (eds.) Handbook of Metaheuristics, Vol. 146 of International Series in Operations Research & Management Science, pp 61\u201386. Springer, New York (2010)","DOI":"10.1007\/978-1-4419-1665-5_3"},{"key":"9453_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10479-012-1062-0","volume":"218","author":"S Haspeslagh","year":"2012","unstructured":"Haspeslagh, S., De Causmaecker, P., Schaerf, A., St\u00f8levik, M.: The first international nurse rostering competition 2010. Ann. Oper. Res. 218, 221\u2013236 (2012)","journal-title":"Ann. Oper. Res."},{"key":"9453_CR16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-1-4757-2807-1_9","volume-title":"Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search","author":"C Haul","year":"1998","unstructured":"Haul, C., Vo\u00df, S.: Using surrogate constraints in genetic algorithms for solving multidimensional knapsack problems. In: Woodruff, D.L (ed.) Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, pp 235\u2013251. Kluwer, Boston (1998)"},{"key":"9453_CR17","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/j.ejor.2006.12.060","volume":"191","author":"H H\u00f6ller","year":"2008","unstructured":"H\u00f6ller, H., Melian, B., Vo\u00df, S.: Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH\/WDM networks. Eur. J. Oper. Res. 191, 691\u2013704 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9453_CR18","doi-asserted-by":"crossref","unstructured":"Jin, B., Lim, A., Zhu, W.: A greedy look-ahead heuristic for the container relocation problem. In: Ali, M., Bosse, T., Hindriks, K.V., Hoogendoorn, M., Jonker, C.M., Treur, J. (eds.) Recent Trends in Applied Artificial Intelligence. Vol 7906 of Lecture Notes in Computer Science, pp. 181\u2013190. Springer, Berlin, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38577-3_19"},{"key":"9453_CR19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.cie.2014.06.010","volume":"75","author":"R Jovanovic","year":"2014","unstructured":"Jovanovic, R., Vo\u00df, S.: A chain heuristic for the blocks relocation problem. Comput. Ind. Eng. 75, 79\u201386 (2014)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"9453_CR20","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/trsc.1030.0082","volume":"38","author":"KH Kim","year":"2004","unstructured":"Kim, K.H., Bae, J.W.: A look-ahead dispatching method for automated guided vehicles in automated port container terminals. Transp. Sci. 38(2), 224\u2013234 (2004)","journal-title":"Transp. Sci."},{"key":"9453_CR21","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/0-306-48056-5_11","volume-title":"Handbook of Metaheuristics, Vol. 57 of International Series in Operations Research & Management Science","author":"HR Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A (eds.) Handbook of Metaheuristics, Vol. 57 of International Series in Operations Research & Management Science, pp 320\u2013353. Springer, New York (2003)"},{"key":"9453_CR22","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1016\/j.ejor.2011.12.016","volume":"218","author":"Z L\u00fc","year":"2012","unstructured":"L\u00fc, Z, Hao, J.-K.: Adaptive neighborhood search for nurse rostering. Eur. J. Oper. Res. 218, 865\u2013876 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"9453_CR23","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/2576768.2598213","volume-title":"In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation (GECCO14)","author":"D Meignan","year":"2014","unstructured":"Meignan, D.: A heuristic approach to schedule reoptimization in the context of interactive optimization In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation (GECCO14), pp 461\u2013468. ACM, New York (2014)"},{"key":"9453_CR24","doi-asserted-by":"crossref","unstructured":"Meignan, D., Schwarze, S., Vo\u00df, S.: Two look-ahead strategies for local-search metaheuristics. In: Pardalos, P.M., Resende, M.G.C., Vogiatzis, C., Walteros, J.L. (eds.) Learning and Intelligent Optimization, Vol. 8426 of Lecture Notes in Computer Science, pp 187\u2013202. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-09584-4_18"},{"key":"9453_CR25","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Hyde, M., Curtois, T., Vazquez-Rodriguez, J.A., Walker, J., Gendreau, M., Kendall, G., McCollum, B., Parkes, A.J., Petrovic, S., Burke, E.K.: HyFlex: A benchmark framework for cross-domain heuristic search. In: Hao, J.-K., Middendorf, M (eds.) , EvoCOP 2012, Vol. 7245 of Lecture Notes in Computer Science, pp 136\u2013147. Springer, New York (2012)","DOI":"10.1007\/978-3-642-29124-1_12"},{"key":"9453_CR26","first-page":"418","volume-title":"Parallel Problem Solving from Nature - PPSN XII, Vol. 7492 of Lecture Notes in Computer Science","author":"G Ochoa","year":"2012","unstructured":"Ochoa, G., Walker, J., Hyde, M., Curtois, T.: Adaptive evolutionary algorithms and extensions to the HyFlex hyper-heuristic framework. In: Coello Coello, C.A., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M (eds.) Parallel Problem Solving from Nature - PPSN XII, Vol. 7492 of Lecture Notes in Computer Science, pp 418\u2013427. Springer, New York (2012)"},{"key":"9453_CR27","first-page":"372","volume-title":"Computer Aided Systems Theory - EUROCAST 2013, Vol. 8111 of Lecture Notes in Computer Science","author":"P Papazek","year":"2013","unstructured":"Papazek, P., Raidl, G.R., Rainer-Harbach, M., Hu, B.: A PILOT\/VND\/GRASP hybrid for the static balancing of public bicycle sharing systems. In: Moreno-D\u00edaz, R., Pichler, F., Quesada-Arencibia, A (eds.) Computer Aided Systems Theory - EUROCAST 2013, Vol. 8111 of Lecture Notes in Computer Science, pp 372\u2013379. Springer, New York (2013)"},{"key":"9453_CR28","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.ejor.2013.05.037","volume":"231","author":"MEH Petering","year":"2013","unstructured":"Petering, M.E.H., Hussein, M.I.: A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem. Eur. J. Oper. Res. 231, 120\u2013130 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"9453_CR29","first-page":"160","volume-title":"Learning and Intelligent Optimization, Vol. 7219 of Lecture Notes in Computer Science","author":"TP Runarsson","year":"2012","unstructured":"Runarsson, T.P., Schoenauer, M., Sebag, M.: Pilot, rollout and Monte Carlo tree search methods for job shop scheduling. In: Hamadi, Y., Schoenauer, M (eds.) Learning and Intelligent Optimization, Vol. 7219 of Lecture Notes in Computer Science, pp 160\u2013174. Springer, New York (2012)"},{"key":"9453_CR30","unstructured":"Schwarze, S., Vo\u00df, S.: Look ahead hyper heuristics. In: Fink, A., Geiger, M.J. (eds.) Proceedings of the 14th EU\/ME Workshop, pp 91\u201397 (2013)"},{"key":"9453_CR31","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10479-005-2060-2","volume":"136","author":"S Vo\u00df","year":"2005","unstructured":"Vo\u00df, S., Fink, A., Duin, C.: Looking ahead with the pilot method. Ann. Oper. Res. 136, 285\u2013302 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9453_CR32","first-page":"6","volume-title":"Parallel Problem Solving From Nature\u2013PPSN III","author":"DL Whitley","year":"1994","unstructured":"Whitley, D.L., Gordon, V.S., Mathias, K.E.: Lamarckian evolution, the Baldwin effect and function optimization. In: Davidor, Y., Schwefel, H.P, M\u00e4nner, R (eds.) Parallel Problem Solving From Nature\u2013PPSN III, pp 6\u201315. Springer, Berlin (1994)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9453-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-015-9453-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9453-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T04:16:15Z","timestamp":1651810575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-015-9453-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,28]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9453"],"URL":"https:\/\/doi.org\/10.1007\/s10472-015-9453-y","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,28]]}}}