{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T08:50:47Z","timestamp":1767084647645,"version":"3.41.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T00:00:00Z","timestamp":1743552000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T00:00:00Z","timestamp":1743552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PID2023-152614OB-I00"],"award-info":[{"award-number":["PID2023-152614OB-I00"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00521-025-11171-z","type":"journal-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T11:07:43Z","timestamp":1743764863000},"page":"12471-12485","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Future trends in the design of memetic algorithms: the case of the linear ordering problem"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5134-7739","authenticated-orcid":false,"given":"L\u00e1zaro Jes\u00fas","family":"P\u00e9rez Lugo","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Segura","sequence":"additional","affiliation":[]},{"given":"Gara","family":"Miranda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,2]]},"reference":[{"issue":"3","key":"11171_CR1","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput Surve (CSUR) 35(3):268\u2013308","journal-title":"ACM Comput Surve (CSUR)"},{"key":"11171_CR2","doi-asserted-by":"crossref","unstructured":"Li H PhD, Li H PhD (2022) Heuristics. Numerical Methods Using Java: For Data Science, Analysis, and Engineering, 625\u2013654","DOI":"10.1007\/978-1-4842-6797-4_11"},{"key":"11171_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-16729-4","volume-title":"The Linear Ordering Problem - Exact and Heuristic Methods in Combinatorial Optimization","author":"R Mart\u00ed","year":"2011","unstructured":"Mart\u00ed R, Reinelt G (2011) The Linear Ordering Problem - Exact and Heuristic Methods in Combinatorial Optimization. Springer, Springer, Heidelberg Dordrecht London New York, p 169"},{"issue":"8","key":"11171_CR4","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1287\/mnsc.20.8.1190","volume":"20","author":"F Glover","year":"1974","unstructured":"Glover F, Klastorin T, Kongman D (1974) Optimal weighted ancestry relationships. Manage Sci 20(8):1190\u20131193","journal-title":"Manage Sci"},{"issue":"1","key":"11171_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M J\u00fcnger","year":"1997","unstructured":"J\u00fcnger M, Mutzel P (1997) 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J Graph Algorithms Appl 1(1):1\u201325","journal-title":"J Graph Algorithms Appl"},{"key":"11171_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2018.03.001","volume":"95","author":"B Smeulders","year":"2018","unstructured":"Smeulders B, Davis-Stober C, Regenwetter M, Spieksma FCR (2018) Testing probabilistic models of choice using column generation. Comput Op Res 95:32\u201343","journal-title":"Comput Op Res"},{"key":"11171_CR7","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":"11171_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi E-G (2009) Metaheuristics: From Design to Implementation. Wiley Publishing, New Jersey"},{"key":"11171_CR9","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/11494669_93","volume-title":"Computational Intelligence and Bioinspired Systems","author":"M Verleysen","year":"2005","unstructured":"Verleysen M, Fran\u00e7ois D (2005) The curse of dimensionality in data mining and time series prediction. In: Cabestany J, Prieto A, Sandoval F (eds) Computational Intelligence and Bioinspired Systems. Springer, Berlin, Heidelberg, pp 758\u2013770"},{"issue":"3","key":"11171_CR10","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":"4","key":"11171_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s12293-022-00378-5","volume":"14","author":"L Lugo","year":"2022","unstructured":"Lugo L, Segura C, Miranda G (2022) A diversity-aware memetic algorithm for the linear ordering problem. Memetic Comput 14(4):395\u2013409","journal-title":"Memetic Comput"},{"key":"11171_CR12","doi-asserted-by":"crossref","unstructured":"Carlos C, Luke M, Pablo M (2018) Memetic Algorithms, pp. 607\u2013638. Springer, Cham","DOI":"10.1007\/978-3-319-07124-4_29"},{"key":"11171_CR13","volume-title":"Evolutionary Algorithms in Engineering Applications","author":"D Dasgupta","year":"2013","unstructured":"Dasgupta D, Michalewicz Z (2013) Evolutionary Algorithms in Engineering Applications. Springer, Berlin"},{"key":"11171_CR14","volume-title":"Handbook of Memetic Algorithms","author":"F Neri","year":"2011","unstructured":"Neri F, Cotta C, Moscato P (2011) Handbook of Memetic Algorithms. Springer, Berlin, Heidelberg"},{"key":"11171_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: A literature review. Swarm Evol Comput 2:1\u201314","journal-title":"Swarm Evol Comput"},{"key":"11171_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106249","volume":"157","author":"J Zheng","year":"2023","unstructured":"Zheng J, Zhong J, Chen M, He K (2023) A reinforced hybrid genetic algorithm for the traveling salesman problem. Comput Op Res 157:106249","journal-title":"Comput Op Res"},{"key":"11171_CR17","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-75514-2_13","volume-title":"Hybrid Metaheuristics","author":"T Fischer","year":"2007","unstructured":"Fischer T, Merz P (2007) A memetic algorithm for the optimum communication spanning tree problem. In: Bartz-Beielstein T, Blesa Aguilera MJ, Blum C, Naujoks B, Roli A, Rudolph G, Sampels M (eds) Hybrid Metaheuristics. Springer, Berlin, Heidelberg, pp 170\u2013184"},{"key":"11171_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s11633-007-0281-3","volume":"4","author":"PS Oliveto","year":"2007","unstructured":"Oliveto PS, He J, Yao X (2007) Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. Int J Autom Comput 4:281\u2013293","journal-title":"Int J Autom Comput"},{"issue":"3","key":"11171_CR19","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"},{"key":"11171_CR20","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ins.2015.06.029","volume":"323","author":"C Segura","year":"2015","unstructured":"Segura C, Coello Coello CA, Hern\u00e1ndez-D\u00edaz AG (2015) Improving the vector generation strategy of differential evolution for large-scale optimization. Inf Sci 323:106\u2013129","journal-title":"Inf Sci"},{"issue":"3","key":"11171_CR21","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/s10489-014-0613-2","volume":"42","author":"S Chen","year":"2015","unstructured":"Chen S, Montgomery J, Boluf\u00e9-R\u00f6hler A (2015) Measuring the curse of dimensionality and its effects on particle swarm optimization and differential evolution. Appl Intell 42(3):514\u2013526","journal-title":"Appl Intell"},{"key":"11171_CR22","doi-asserted-by":"publisher","first-page":"99890","DOI":"10.1109\/ACCESS.2021.3082202","volume":"9","author":"B Wang","year":"2021","unstructured":"Wang B, Ren L, Prado JD, He W, Jin H, Jiang Q, Wang X (2021) An adaptive mechanism with cooperative coevolution and covariance for differential evolution. IEEE Access 9:99890\u201399904","journal-title":"IEEE Access"},{"issue":"1","key":"11171_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2012.00862.x","volume":"20","author":"E Alba","year":"2013","unstructured":"Alba E, Luque G, Nesmachnow S (2013) Parallel metaheuristics: recent advances and new trends. Int Trans Oper Res 20(1):1\u201348","journal-title":"Int Trans Oper Res"},{"issue":"4","key":"11171_CR24","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1504\/IJAACS.2015.073191","volume":"8","author":"F Ding","year":"2015","unstructured":"Ding F, Wienke S, Zhang R (2015) Dynamic mpi parallel task scheduling based on a master-worker pattern in cloud computing. Int J Auton Adapt Commun Syst. 8(4):424\u2013438","journal-title":"Int J Auton Adapt Commun Syst."},{"key":"11171_CR25","unstructured":"Sevaux M, S\u00f6rensen K, et al (2005) Permutation distance measures for memetic algorithms with population management. In: Proceedings of 6th Metaheuristics International Conference. MIC\u201905, pp. 832\u2013838"},{"issue":"1","key":"11171_CR26","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0377-2217(03)00098-5","volume":"153","author":"N Musliu","year":"2004","unstructured":"Musliu N, Schaerf A, Slany W (2004) Local search for shift design. Eur J Oper Res 153(1):51\u201364","journal-title":"Eur J Oper Res"},{"key":"11171_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-1849-9","volume-title":"Soft Computing in Information Retrieval: Techniques and Applications","author":"F Crestani","year":"2000","unstructured":"Crestani F, Pasi G (2000) Soft Computing in Information Retrieval: Techniques and Applications. Springer, Berlin, Heidelberg"},{"issue":"4","key":"11171_CR28","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":"11171_CR29","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 Modell Algorithms 3(4):367\u2013402","journal-title":"J Math Modell Algorithms"},{"key":"11171_CR30","doi-asserted-by":"crossref","unstructured":"Villanueva JDT, Huacuja HJF, Rangel RP, Valadez JMC, Soberanes HJP, Barbosa JJG (2011) Iterated Local Search Algorithm for the Linear Ordering Problem with Cumulative Costs (LOPCC). Soft Computing for Intelligent Control and Mobile Robotics, pp. 395\u2013404. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-15534-5_24"},{"key":"11171_CR31","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.omega.2015.03.007","volume":"56","author":"NR Sabar","year":"2015","unstructured":"Sabar NR, Kendall G (2015) An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem. Omega-Int J Manag Sci 56:88\u201398","journal-title":"Omega-Int J Manag Sci"},{"key":"11171_CR32","unstructured":"IM O, DJd S, RC HJ (1987) Study of permutation crossover operators on the traveling salesman problem. In: Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms: July 28-31, 1987 at the Massachusetts Institute of Technology, Cambridge, MA (1987). Hillsdale, NJ: L. Erlhaum Associates,"},{"key":"11171_CR33","doi-asserted-by":"crossref","unstructured":"Amo IG, Pelta DA (2013) SRCS: a technique for comparing multiple algorithms under several factors in dynamic optimization problems. In: Metaheuristics for Dynamic Optimization, pp. 61\u201377. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-30665-5_4"},{"key":"11171_CR34","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":"11171_CR35","doi-asserted-by":"publisher","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 J 87:105998","journal-title":"Appl Soft Comput J"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11171-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-025-11171-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11171-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T14:53:48Z","timestamp":1750172028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-025-11171-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,2]]},"references-count":35,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["11171"],"URL":"https:\/\/doi.org\/10.1007\/s00521-025-11171-z","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2025,4,2]]},"assertion":[{"value":"1 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}