{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T22:39:17Z","timestamp":1776983957599,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T00:00:00Z","timestamp":1665878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T00:00:00Z","timestamp":1665878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CONACyT","award":["300832"],"award-info":[{"award-number":["300832"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s12293-022-00378-5","type":"journal-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T05:02:15Z","timestamp":1665896535000},"page":"395-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A diversity-aware memetic algorithm for the linear ordering Problem"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5134-7739","authenticated-orcid":false,"given":"L\u00e1zaro","family":"Lugo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5431-5927","authenticated-orcid":false,"given":"Carlos","family":"Segura","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2181-0067","authenticated-orcid":false,"given":"Gara","family":"Miranda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,16]]},"reference":[{"issue":"3","key":"378_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.2307\/1927837","volume":"18","author":"WW Leontief","year":"1936","unstructured":"Leontief WW (1936) Quantitative input and output relations in the economic systems of the United States. Rev Econ Stat 18(3):105\u2013125","journal-title":"Rev Econ Stat"},{"issue":"4","key":"378_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.2307\/1907514","volume":"26","author":"HB Chenery","year":"1958","unstructured":"Chenery HB, Watanabe T (1958) International comparisons of the structure of production. Econometrica 26(4):487\u2013521","journal-title":"Econometrica"},{"key":"378_CR3","volume-title":"Computers and Intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., Philadelphia, USA"},{"key":"378_CR4","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1007\/s10589-010-9384-9","volume":"51","author":"R Mart\u00ed","year":"2012","unstructured":"Mart\u00ed R, Reinelt G, Duarte A (2012) A benchmark library and a comparison of heuristic methods for the linear ordering problem. Comput Optim Appl 51:1297\u20131317","journal-title":"Comput Optim Appl"},{"key":"378_CR5","doi-asserted-by":"crossref","unstructured":"Mart\u00ed R, Reinelt G (2011) The linear ordering problem - exact and heuristic methods in combinatorial optimization, p. 169. Springer, Springer Heidelberg Dordrecht London New York","DOI":"10.1007\/978-3-642-16729-4"},{"issue":"3","key":"378_CR6","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.ejor.2014.09.041","volume":"241","author":"J Ceberio","year":"2015","unstructured":"Ceberio J, Mendiburu A, Lozano JA (2015) The linear ordering problem revisited. Eur J Oper Res 241(3):686\u2013696","journal-title":"Eur J Oper Res"},{"issue":"3","key":"378_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M \u010crepin\u0161ek","year":"2013","unstructured":"\u010crepin\u0161ek M, Liu S-H, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 45(3):35\u201313533","journal-title":"ACM Comput Surv"},{"issue":"4","key":"378_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TEVC.2016.2641477","volume":"21","author":"C Segura","year":"2016","unstructured":"Segura C, Hern\u00e1ndez-Aguirre A, Luna F, Alba E (2016) Improving diversity in evolutionary algorithms: new best solutions for frequency assignment. IEEE Trans Evol Comput 21(4):539\u2013553","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"378_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1023\/B:JMMA.0000049426.06305.d8","volume":"3","author":"T Schiavinotto","year":"2004","unstructured":"Schiavinotto T, St\u00fctzle T (2004) The linear ordering problem: instances, search space analysis and algorithms. J Math Model Algor 3(4):367\u2013402","journal-title":"J Math Model Algor"},{"issue":"12","key":"378_CR10","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/S0305-0548(98)00104-X","volume":"26","author":"M Laguna","year":"1999","unstructured":"Laguna M, Mart\u00ed R, Campos V (1999) Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput Oper Res 26(12):1217\u20131230","journal-title":"Comput Oper Res"},{"key":"378_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00249646","volume":"6","author":"S Chanas","year":"1996","unstructured":"Chanas S, Kobyla\u0144ski P (1996) A new heuristic algorithm solving the linear ordering problem. Comput Optim Appl 6:191\u2013205","journal-title":"Comput Optim Appl"},{"key":"378_CR12","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1023\/A:1012793906010","volume":"21","author":"V Campos","year":"2001","unstructured":"Campos V, Glover F, Laguna M, Mart\u00ed R (2001) An experimental evaluation of a scatter search for the linear ordering problem. J Glob Optim 21:397\u2013414","journal-title":"J Glob Optim"},{"issue":"6","key":"378_CR13","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1984) A cutting plane algorithm for the linear ordering problem. Oper Res 32(6):1195\u20131220","journal-title":"Oper Res"},{"issue":"12","key":"378_CR14","doi-asserted-by":"publisher","first-page":"3549","DOI":"10.1016\/j.cor.2005.03.032","volume":"33","author":"CG Garc\u00eda","year":"2006","unstructured":"Garc\u00eda CG, P\u00e9rez-Brito D, Campos V, Mart\u00ed R (2006) Variable neighborhood search for the linear ordering problem. Comput Oper Res 33(12):3549\u20133565","journal-title":"Comput Oper Res"},{"key":"378_CR15","doi-asserted-by":"crossref","unstructured":"Charon I, Hudry O (2007) A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR 5, 5\u201360","DOI":"10.1007\/s10288-007-0036-6"},{"key":"378_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10479-009-0648-7","volume":"175","author":"I Charon","year":"2010","unstructured":"Charon I, Hudry O (2010) An updated survey on the linear ordering problem for weighted or unweighted tournaments. Ann Oper Res 175:107\u2013158","journal-title":"Ann Oper Res"},{"key":"378_CR17","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1111\/j.1475-3995.2010.00778.x","volume":"17","author":"CS Sakuraba","year":"2010","unstructured":"Sakuraba CS, Yagiura M (2010) Efficient local search algorithms for the linear ordering problem. Intl Trans Op Res 17:711\u2013737","journal-title":"Intl Trans Op Res"},{"issue":"9","key":"378_CR18","doi-asserted-by":"publisher","first-page":"4432","DOI":"10.1016\/j.eswa.2015.01.053","volume":"42","author":"CS Sakuraba","year":"2015","unstructured":"Sakuraba CS, Ronconi DP, Birgin EG, Yagiura M (2015) Metaheuristics for large-scale instances of the linear ordering problem. Expert Syst Appl 42(9):4432\u20134442","journal-title":"Expert Syst Appl"},{"key":"378_CR19","doi-asserted-by":"crossref","unstructured":"Garcia E, Ceberio J, Lozano JA (2019) Hybrid heuristics for the linear ordering problem. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 1431\u20131438","DOI":"10.1109\/CEC.2019.8790280"},{"key":"378_CR20","doi-asserted-by":"publisher","first-page":"104861","DOI":"10.1016\/j.cor.2019.104861","volume":"115","author":"Y Qian","year":"2020","unstructured":"Qian Y, Lin J, Li D, Hu H (2020) Block-insertion-based algorithms for the linear ordering problem. Comput Oper Res 115:104861","journal-title":"Comput Oper Res"},{"key":"378_CR21","doi-asserted-by":"publisher","first-page":"105998","DOI":"10.1016\/j.asoc.2019.105998","volume":"87","author":"V Santucci","year":"2020","unstructured":"Santucci V, Ceberio J (2020) Using pairwise precedences for solving the linear ordering problem. Appl Soft Comput 87:105998","journal-title":"Appl Soft Comput"},{"key":"378_CR22","doi-asserted-by":"crossref","unstructured":"Santucci V, Ceberio J, Baioletti M (2020) Gradient search in the space of permutations: an application for the linear ordering problem, pp. 1704\u20131711. Association for Computing Machinery, New York, NY, USA","DOI":"10.1145\/3377929.3398094"},{"key":"378_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2019.08.016","volume":"507","author":"M Baioletti","year":"2020","unstructured":"Baioletti M, Milani A, Santucci V (2020) Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs. Inf Sci 507:37\u201352","journal-title":"Inf Sci"},{"issue":"3","key":"378_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s12293-020-00307-4","volume":"12","author":"IF Fernandes","year":"2020","unstructured":"Fernandes IF, Silva IRdM, Goldbarg EFG, Maia SM, Goldbarg MC (2020) A PSO-inspired architecture to hybridise multi-objective metaheuristics. Memetic Comp 12(3):235\u2013249","journal-title":"Memetic Comp"},{"key":"378_CR25","doi-asserted-by":"publisher","first-page":"100960","DOI":"10.1016\/j.swevo.2021.100960","volume":"67","author":"JG Falc\u00f3n-Cardona","year":"2021","unstructured":"Falc\u00f3n-Cardona JG, Hern\u00e1ndez G\u00f3mez R, Coello Coello CA, Castillo Tapia MG (2021) Parallel multi-objective evolutionary algorithms: a comprehensive survey. Swarm Evol Comput 67:100960","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"378_CR26","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s12293-020-00322-5","volume":"13","author":"L Sun","year":"2021","unstructured":"Sun L, Pan Q-K, Jing X-L, Huang J-P (2021) A light-robust-optimization model and an effective memetic algorithm for an open vehicle routing problem under uncertain travel times. Memetic Comp 13(2):149\u2013167","journal-title":"Memetic Comp"},{"key":"378_CR27","doi-asserted-by":"crossref","unstructured":"Asadujjaman M, Rahman HF, Chakrabortty RK, Ryan MJ (2021) A memetic algorithm for concurrent project scheduling, materials ordering and suppliers selection problem. Procedia Computer Science 192, 717\u2013726. Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 25th International Conference KES2021","DOI":"10.1016\/j.procs.2021.08.074"},{"issue":"1","key":"378_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12293-019-00294-1","volume":"12","author":"JE Amaya","year":"2020","unstructured":"Amaya JE, Cotta C, Fern\u00e1ndez-Leiva AJ, Garc\u00eda-S\u00e1nchez P (2020) Deep memetic models for combinatorial optimization problems: application to the tool switching problem. Memetic Comp 12(1):3\u201322","journal-title":"Memetic Comp"},{"key":"378_CR29","doi-asserted-by":"crossref","unstructured":"Hernando L, Mendiburu A, Lozano JA (2020) Journey to the center of the linear ordering problem. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2020, pp. 201\u2013209. Association for Computing Machinery, New York, NY, USA","DOI":"10.1145\/3377930.3390241"},{"key":"378_CR30","doi-asserted-by":"crossref","unstructured":"Hern\u00e1ndez\u00a0Constantino O, Segura C (2021) A parallel memetic algorithm with explicit management of diversity for the job shop scheduling problem. Appl Intell, 1\u201313","DOI":"10.1007\/s10489-021-02406-2"},{"key":"378_CR31","unstructured":"Sevaux M, S\u00f6rensen K, et al. Permutation distance measures for memetic algorithms with population management. In: Proceedings of 6th Metaheuristics International Conference. MIC\u201905, pp. 832\u2013838"},{"key":"378_CR32","doi-asserted-by":"crossref","unstructured":"Neri F, Cotta C, Moscato P (2011) Handbook of memetic algorithms. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-23247-3"},{"issue":"4","key":"378_CR33","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1109\/TSMCB.2004.828283","volume":"34","author":"H-K Tsai","year":"2004","unstructured":"Tsai H-K, Yang J-M, Tsai Y-F, Kao C-Y (2004) An evolutionary algorithm for large traveling salesman problems. IEEE Trans Syst Man Cybern Syst 34(4):1718\u20131729","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"4","key":"378_CR34","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evol Comput 4(4):337\u2013352","journal-title":"IEEE Trans Evol Comput"},{"key":"378_CR35","volume-title":"Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold Company, New York, USA"},{"key":"378_CR36","doi-asserted-by":"crossref","unstructured":"Song J, Zhao H, Zhou T, Tao Y, L\u00fc Z (2019) Solving the linear ordering problem via a memetic algorithm. In: Arai, K., Bhatia, R., Kapoor, S. (eds.) Proceedings of the future technologies conference (FTC) 2018, pp. 421\u2013430. Springer, Cham","DOI":"10.1007\/978-3-030-02683-7_29"},{"key":"378_CR37","doi-asserted-by":"crossref","unstructured":"Mitchell JE, Borchers B (2000) Solving linear ordering problems with a combined interior point\/simplex cutting plane algorithm. In: Frenk H, Roos K, Terlaky T, Zhang S (eds) High performance optimization. Springer, Boston, MA, pp 349\u2013366","DOI":"10.1007\/978-1-4757-3216-0_14"},{"key":"378_CR38","volume-title":"The stanford graphbase: a platform for combinatorial computing","author":"D Knuth","year":"1993","unstructured":"Knuth D (1993) The stanford graphbase: a platform for combinatorial computing. ACM Press, New York, USA"},{"key":"378_CR39","unstructured":"P\u00e9rez A, Ceberio J (2018) Creating difficult instances of the linear ordering problem. In: XIII Congreso Espa\u00f1ol en Metaheur\u00edsticas Y Algoritmos Evolutivos Y Bioinspirados, pp. 733\u2013738"},{"issue":"1","key":"378_CR40","first-page":"248","volume":"8","author":"B Calvo","year":"2016","unstructured":"Calvo B, Santaf\u00e9 G (2016) scmamp: statistical comparison of multiple algorithms in multiple problems. R Found 8(1):248\u2013256","journal-title":"R Found"},{"issue":"85","key":"378_CR41","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, Vanderplas J, Passos A, Cournapeau D, Brucher M, Perrot M (2011) \u00c9douard Duchesnay: Scikit-learn: machine Learning in Python. J Mach Learn Res 12(85):2825\u20132830","journal-title":"J Mach Learn Res"},{"issue":"10","key":"378_CR42","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power. Inf Sci 180(10):2044\u20132064","journal-title":"Inf Sci"},{"key":"378_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to evolutionary computing","author":"AE Eiben","year":"2015","unstructured":"Eiben AE, Smith JE (2015) Introduction to evolutionary computing. Natural Computing Series. Springer, Berlin, Heidelberg"},{"issue":"2","key":"378_CR44","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10015-010-0836-1","volume":"15","author":"Y-A Zhang","year":"2010","unstructured":"Zhang Y-A, Ma Q, Sakamoto M, Furutani H (2010) Effects of population size on the performance of genetic algorithms and the role of crossover. Artif life Robot 15(2):239\u2013243","journal-title":"Artif life Robot"},{"key":"378_CR45","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-642-30665-5_4","volume-title":"Metaheuristics for dynamic optimization","author":"IG del Amo","year":"2013","unstructured":"del Amo IG, Pelta DA (2013) SRCS: a technique for comparing multiple algorithms under several factors in dynamic optimization problems. Metaheuristics for dynamic optimization. Springer, Berlin, Heidelberg, pp 61\u201377"},{"key":"378_CR46","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/978-3-642-37140-0_61","volume-title":"Evolutionary multi-criterion optimization","author":"A Radulescu","year":"2013","unstructured":"Radulescu A, L\u00f3pez-Ib\u00e1\u00f1ez M, St\u00fctzle T (2013) Automatically improving the anytime behaviour of multiobjective evolutionary algorithms. In: Purshouse RC, Fleming PJ, Fonseca CM, Greco S, Shaw J (eds) Evolutionary multi-criterion optimization. Springer, Berlin, Heidelberg, pp 825\u2013840"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-022-00378-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-022-00378-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-022-00378-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T14:14:30Z","timestamp":1678284870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-022-00378-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,16]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["378"],"URL":"https:\/\/doi.org\/10.1007\/s12293-022-00378-5","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,16]]},"assertion":[{"value":"10 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}