{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T04:01:18Z","timestamp":1748491278673,"version":"3.41.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319190839"},{"type":"electronic","value":"9783319190846"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19084-6_14","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T14:43:01Z","timestamp":1432824181000},"page":"151-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Fitness Landscape of the Factoradic Representation on the Permutation Flowshop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Marie-El\u00e9onore","family":"Marmion","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Regnier-Coudert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/TEVC.2013.2260548","volume":"18","author":"J Ceberio","year":"2014","unstructured":"Ceberio, J., Irurozki, E., Mendiburu, A., Lozano, J.A.: A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem. IEEE Trans. Evol. Comput. 18(2), 286\u2013300 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"14_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32444-5_2","volume-title":"Representations for Genetic and Evolutionary Algorithms","author":"F Rothlauf","year":"2006","unstructured":"Rothlauf, F.: Representations for Genetic and Evolutionary Algorithms. Springer, Heidelberg (2006)"},{"issue":"2","key":"14_CR3","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Kromer, P., Platos, J., Snasel, V.: Modeling permutations for genetic algorithms. In: International Conference of Soft Computing and Pattern Recognition, pp. 100\u2013105. IEEE (2009)","DOI":"10.1109\/SoCPaR.2009.31"},{"key":"14_CR5","unstructured":"Mehdi, M.: Parallel hybrid optimization methods for permutation based problems. Ph.D. thesis, Universit\u00e9 des Sciences et Technologie de Lille (2011)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-319-10762-2_33","volume-title":"Parallel Problem Solving From Nature \u2013 Ppsn Xiii","author":"O Regnier-Coudert","year":"2014","unstructured":"Regnier-Coudert, O., McCall, J.: Factoradic representation for permutation optimisation. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 332\u2013341. Springer, Heidelberg (2014)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Schnier, T., Yao, X.: Using multiple representations in evolutionary algorithms. In: Proceedings of the 2000 Congress on Evolutionary Computation, vol. 1, pp. 479\u2013486. IEEE (2000)","DOI":"10.1109\/CEC.2000.870335"},{"key":"14_CR8","volume-title":"Evolutionary Computation for Modeling and Optimization","author":"D Ashlock","year":"2006","unstructured":"Ashlock, D.: Evolutionary Computation for Modeling and Optimization. Springer, New York (2006)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-32937-1_22","volume-title":"Parallel Problem Solving From Nature - Ppsn Xii","author":"O Regnier-Coudert","year":"2012","unstructured":"Regnier-Coudert, O., McCall, J.: Competing mutating agents for bayesian network structure learning. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012, Part I. LNCS, vol. 7491, pp. 216\u2013225. Springer, Heidelberg (2012)"},{"issue":"7","key":"14_CR10","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1145\/364520.364540","volume":"7","author":"R Durstenfeld","year":"1964","unstructured":"Durstenfeld, R.: Algorithm 235: random permutation. Commun. ACM 7(7), 420 (1964)","journal-title":"Commun. ACM"},{"issue":"24","key":"14_CR11","doi-asserted-by":"crossref","first-page":"7313","DOI":"10.1080\/00207543.2011.648277","volume":"50","author":"H Samarghandi","year":"2012","unstructured":"Samarghandi, H., ElMekkawy, T.Y.: A meta-heuristic approach for solving the no-wait flow-shop problem. Int. J. Prod. Res. 50(24), 7313\u20137326 (2012)","journal-title":"Int. J. Prod. Res."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Hosseini-Nasab, H., Emami, L.: A hybrid particle swarm optimisation for dynamic facility layout problem. Int. J. Prod. Res. 51(14), 4325\u20134335 (2013)","DOI":"10.1080\/00207543.2013.774486"},{"key":"14_CR13","unstructured":"Baluja, S.: Population-based incremental learning. a method for integrating genetic search based function optimization and competitive learning. Technical report, Carnegie Mellon University (1994)"},{"key":"14_CR14","unstructured":"Knjazew, D., Goldberg, D.E.: Omega-ordering messy ga: solving permutation problems with the fast messy genetic algorithm and random keys. In: Proceedings of Genetic and Evolutionary Computation Conference, pp. 181\u2013188 (2000)"},{"key":"14_CR15","unstructured":"Wright, S.: The roles of mutation, inbreeding, crossbreeding and selection in evolution. In: Proceedings of the Sixth International Congress on Genetics, vol. 1 (1932)"},{"key":"14_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01165154","volume":"20","author":"PF Stadler","year":"1996","unstructured":"Stadler, P.F.: Landscapes and their correlation functions. J. Math. Chem. 20, 1\u201345 (1996)","journal-title":"J. Math. Chem."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-11683-9_4","volume-title":"Artificial Evolution","author":"F Daolio","year":"2014","unstructured":"Daolio, F., Verel, S., Ochoa, G., Tomassini, M.: Local optima networks of the permutation flow-shop problem. In: Legrand, P., Corsini, M.-M., Hao, J.-K., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2013. LNCS, vol. 8752, pp. 41\u201352. Springer, Heidelberg (2014)"},{"issue":"1","key":"14_CR18","first-page":"3","volume":"12","author":"M-E Marmion","year":"2011","unstructured":"Marmion, M.-E., Jourdan, L., Dhaenens, C.: Fitness landscape analysis and metaheuristics efficiency. J. Math. Model. Algorithms 12(1), 3\u201326 (2011)","journal-title":"J. Math. Model. Algorithms"},{"key":"14_CR19","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E Weinberger","year":"1990","unstructured":"Weinberger, E.: Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol. Cybern. 63, 325\u2013336 (1990)","journal-title":"Biol. Cybern."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Verel, S., Collard, P., Clergue, M.: Scuba Search : when selection meets innovation. In: Proceedings of the 2004 Congress on Evolutionary Computation, CEC 2004, pp. 924\u2013931. IEEE Press (2004)","DOI":"10.1109\/CEC.2004.1330960"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-20364-0_17","volume-title":"Evolutionary Computation In Combinatorial Optimization","author":"M-E Marmion","year":"2011","unstructured":"Marmion, M.-E., Dhaenens, C., Jourdan, L., Liefooghe, A., Verel, S.: NILS: a neutrality-based iterated local search and its application to flowshop scheduling. In: Merz, P., Hao, J.-K. (eds.) EvoCOP 2011. LNCS, vol. 6622, pp. 191\u2013202. Springer, Heidelberg (2011)"},{"key":"14_CR22","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discret. Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discret. Math."},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"3143","DOI":"10.1016\/j.cor.2005.11.022","volume":"34","author":"T Schiavinotto","year":"2007","unstructured":"Schiavinotto, T., St\u00fctzle, T.: A review of metrics on permutations for search landscape analysis. Comput. Oper. Res. 34, 3143\u20133153 (2007)","journal-title":"Comput. Oper. Res."},{"key":"14_CR24","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves, C.R.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22, 5\u201313 (1995)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"14_CR25","doi-asserted-by":"crossref","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":"14_CR26","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"ED Taillard","year":"1993","unstructured":"Taillard, E.D.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"83","key":"14_CR27","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1090\/S0025-5718-1963-0159764-2","volume":"17","author":"SM Johnson","year":"1963","unstructured":"Johnson, S.M.: Generation of permutations by adjacent transposition. Math. Comput. 17(83), 282\u2013285 (1963)","journal-title":"Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19084-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T03:57:29Z","timestamp":1748404649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19084-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190839","9783319190846"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19084-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}