{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:37:44Z","timestamp":1754109464015,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319116822"},{"type":"electronic","value":"9783319116839"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11683-9_4","type":"book-chapter","created":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T19:24:53Z","timestamp":1414178693000},"page":"41-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Local Optima Networks of the Permutation Flow-Shop Problem"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Daolio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Verel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Tomassini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,25]]},"reference":[{"key":"4_CR1","unstructured":"Auger, A., Hansen, N.: Performance evaluation of an advanced local search evolutionary algorithm. In: The 2005 IEEE Congress on Evolutionary Computation, 2005, vol. 2, pp. 1777\u20131784. IEEE (2005)"},{"key":"4_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791383","volume-title":"Dynamical Processes on Complex Networks","author":"A Barrat","year":"2008","unstructured":"Barrat, A., Barth\u00e9lemy, M., Vespignani, A.: Dynamical Processes on Complex Networks. Cambridge University Press, Cambridge (2008)"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.physa.2004.08.047","volume":"346","author":"M Barth\u00e9lemy","year":"2005","unstructured":"Barth\u00e9lemy, M., Barrat, A., Pastor-Satorras, R., Vespignani, A.: Characterization and modeling of weighted networks. Phys. A Stat. Mech. Appl. 346(1), 34\u201343 (2005)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"KD Boese","year":"1994","unstructured":"Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. 16, 101\u2013113 (1994)","journal-title":"Oper. Res. Lett."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1023\/B:HEUR.0000026900.92269.ec","volume":"10","author":"S Cahon","year":"2004","unstructured":"Cahon, S., Melab, N., Talbi, E.G.: Paradiseo: A framework for the reusable design of parallel and distributed metaheuristics. J. Heuristics 10, 357\u2013380 (2004)","journal-title":"J. Heuristics"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1016\/j.physa.2011.01.005","volume":"390","author":"F Daolio","year":"2011","unstructured":"Daolio, F., Tomassini, M., Verel, S., Ochoa, G.: Communities of minima in local optima networks of combinatorial spaces. Phys. A Stat. Mech. Appl. 390, 1684\u20131694 (2011)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Daolio, F., Verel, S., Ochoa, G., Tomassini, M.: Local optima networks of the quadratic assignment problem. In: 2010 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/CEC.2010.5586481"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.2307\/2348411","volume":"45","author":"SG Gilmour","year":"1996","unstructured":"Gilmour, S.G.: The interpretation of mallows\u2019s $$\\rm C_p$$-statistic. The Statistician 45, 49\u201356 (1996)","journal-title":"The Statistician"},{"key":"4_CR9","volume-title":"Stochastic local search: Foundations and applications","author":"H Hoos","year":"2005","unstructured":"Hoos, H., St\u00fctzle, T.: Stochastic local search: Foundations and applications. Morgan Kaufmann, San Francisco (2005)"},{"key":"4_CR10","unstructured":"Jones, T.: Evolutionary algorithms, fitness landscapes and search. Ph.D. Thesis, The University of New Mexico (1995)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0022-5193(87)80029-2","volume":"128","author":"S Kauffman","year":"1987","unstructured":"Kauffman, S., Levin, S.: Towards a general theory of adaptive walks on rugged landscapes. J. Theor. Biol. 128, 11\u201345 (1987)","journal-title":"J. Theor. Biol."},{"key":"4_CR12","first-page":"321","volume-title":"Handbook of Metaheuristics, International Series in Operations Research and Management Science","author":"HR Louren\u00e7o","year":"2002","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, International Series in Operations Research and Management Science, vol. 57, pp. 321\u2013353. Kluwer Academic Publishers, Norwell (2002)"},{"key":"4_CR13","unstructured":"Lumley, T., Miller, A.: Leaps: Regression subset selection (2009). http:\/\/CRAN.R-project.org\/package=leaps"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-25566-3_18","volume-title":"Learning and Intelligent Optimization","author":"M-E Marmion","year":"2011","unstructured":"Marmion, M.-E., Dhaenens, C., Jourdan, L., Liefooghe, A., Verel, S.: On the neutrality of flowshop scheduling fitness landscapes. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 238\u2013252. Springer, Heidelberg (2011)"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M Newman","year":"2003","unstructured":"Newman, M.: The structure and function of complex networks. SIAM Rev. 45, 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-15844-5_11","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"G Ochoa","year":"2010","unstructured":"Ochoa, G., Verel, S., Tomassini, M.: First-improvement vs. best-improvement local optima networks of NK landscapes. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 104\u2013113. Springer, Heidelberg (2010)"},{"key":"4_CR17","unstructured":"R Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2013). http:\/\/www.R-project.org\/. ISBN 3-900051-07-0"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1023\/A:1018983524911","volume":"86","author":"CR Reeves","year":"1999","unstructured":"Reeves, C.R.: Landscapes, operators and heuristic search. Ann. Oper. Res. 86, 473\u2013490 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res. 165(2), 479\u2013494 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-45692-9_10","volume":"585","author":"P Stadler","year":"2002","unstructured":"Stadler, P.: Fitness landscapes. Biol. Evol. Stat. Phys. 585, 183\u2013204 (2002)","journal-title":"Biol. Evol. Stat. Phys."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.1126\/science.267.5206.1935","volume":"267","author":"F Stillinger","year":"1995","unstructured":"Stillinger, F.: A topographic view of supercooled liquids and glass formation. Science 267, 1935\u20131939 (1995)","journal-title":"Science"},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E Taillard","year":"1990","unstructured":"Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res. 47(1), 65\u201374 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"4_CR23","doi-asserted-by":"publisher","first-page":"066114","DOI":"10.1103\/PhysRevE.78.066114","volume":"78","author":"M Tomassini","year":"2008","unstructured":"Tomassini, M., Verel, S., Ochoa, G.: Complex-network analysis of combinatorial spaces: The NK landscape case. Phys. Rev. E 78(6), 066114 (2008)","journal-title":"Phys. Rev. E"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Verel, S., Daolio, F., Ochoa, G., Tomassini, M.: Local Optima Networks with Escape Edges. In: Procedings of International Conference on Artificial Evolution (EA-2011). pp. 10\u201323. Angers, France (Oct 2011).","DOI":"10.1007\/978-3-642-35533-2_5"},{"issue":"6","key":"4_CR25","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1109\/TEVC.2010.2046175","volume":"15","author":"S Verel","year":"2011","unstructured":"Verel, S., Ochoa, G., Tomassini, M.: Local optima networks of NK landscapes with neutrality. IEEE Trans. Evol. Comput. 15(6), 783\u2013797 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/ijoc.14.2.98.120","volume":"14","author":"J Watson","year":"2002","unstructured":"Watson, J., Barbulescu, L., Whitley, L., Howe, A.: Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS J. Comput. 14(2), 98\u2013123 (2002)","journal-title":"INFORMS J. Comput."}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11683-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T04:11:09Z","timestamp":1675829469000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11683-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319116822","9783319116839"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11683-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"25 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}