{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T05:25:53Z","timestamp":1738992353528,"version":"3.37.0"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"publisher","award":["PID2021-123673OB-C31"],"award-info":[{"award-number":["PID2021-123673OB-C31"]}],"id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s40747-024-01721-8","type":"journal-article","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T10:31:12Z","timestamp":1737541872000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A crossover operator for objective functions defined over graph neighborhoods with interdependent and related variables"],"prefix":"10.1007","volume":"11","author":[{"given":"Jaume","family":"Jordan","sequence":"first","affiliation":[]},{"given":"Javier","family":"Palanca","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Sanchez-Anguix","sequence":"additional","affiliation":[]},{"given":"Vicente","family":"Julian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"issue":"4","key":"1721_CR1","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s10489-014-0623-0","volume":"42","author":"A Andreica","year":"2015","unstructured":"Andreica A, Chira C (2015) Best-order crossover for permutation-based evolutionary algorithms. Appl Intell 42(4):751\u2013776","journal-title":"Appl Intell"},{"key":"1721_CR2","doi-asserted-by":"publisher","unstructured":"Atkinson T, Plump D, Stepney S (2019) Evolving graphs with horizontal gene transfer. In: Proceedings of the genetic and evolutionary computation conference, GECCO \u201919, no 9. Association for Computing Machinery, New York, NY, USA, pp 968\u2013976. https:\/\/doi.org\/10.1145\/3321707.3321788","DOI":"10.1145\/3321707.3321788"},{"key":"1721_CR3","doi-asserted-by":"crossref","DOI":"10.1016\/j.compbiomed.2021.105152","volume":"141","author":"MA Awadallah","year":"2022","unstructured":"Awadallah MA, Hammouri AI, Al-Betar MA, Braik MS, Abd Elaziz M (2022) Binary horse herd optimization algorithm with crossover operators for feature selection. Comput Biol Med 141:105152","journal-title":"Comput Biol Med"},{"issue":"5","key":"1721_CR4","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1007\/s11590-015-0968-2","volume":"10","author":"M Barbati","year":"2016","unstructured":"Barbati M, Piccolo C (2016) Equality measures properties for location problems. Optim Lett 10(5):903\u2013920","journal-title":"Optim Lett"},{"issue":"3","key":"1721_CR5","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.71.036113","volume":"71","author":"V Batagelj","year":"2005","unstructured":"Batagelj V, Brandes U (2005) Efficient generation of large random networks. Phys Rev E 71(3):036113","journal-title":"Phys Rev E"},{"issue":"1\u20133","key":"1721_CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros E, Hammer PL (2002) Pseudo-boolean optimization. Discrete Appl Math 123(1\u20133):155\u2013225","journal-title":"Discrete Appl Math"},{"key":"1721_CR7","unstructured":"Bui TN, Moon BR (1995) On multi-dimensional encoding\/crossover. In: Proceedings of the 6th international conference on genetic algorithms, no 8. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 49\u201356"},{"key":"1721_CR8","doi-asserted-by":"publisher","unstructured":"Bujny M, Aulig N, Olhofer M, Duddeck F (2018) Learning-based topology variation in evolutionary level set topology optimization. In: Proceedings of the genetic and evolutionary computation conference, GECCO \u201918, no 8. Association for Computing Machinery, New York, NY, USA, pp 825\u2013832. https:\/\/doi.org\/10.1145\/3205455.3205528","DOI":"10.1145\/3205455.3205528"},{"key":"1721_CR9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.tra.2020.08.015","volume":"140","author":"L Caggiani","year":"2020","unstructured":"Caggiani L, Colovic A, Ottomanelli M (2020) An equality-based model for bike-sharing stations location in bicycle-public transport multimodal mobility. Transport Res Part A Policy Pract 140:251\u2013265","journal-title":"Transport Res Part A Policy Pract"},{"key":"1721_CR10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1012543203763","volume":"11","author":"CK Chang","year":"2001","unstructured":"Chang CK, Christensen MJ, Zhang T (2001) Genetic algorithms for project management. Ann Softw Eng 11:107\u2013139","journal-title":"Ann Softw Eng"},{"key":"1721_CR11","doi-asserted-by":"publisher","unstructured":"Chicano F, Ochoa G, Whitley D, Tin\u00f3s R (2018) Enhancing partition crossover with articulation points analysis. In: Proceedings of the genetic and evolutionary computation conference, GECCO \u201918, no 8. Association for Computing Machinery, New York, NY, USA, pp 269\u2013276. https:\/\/doi.org\/10.1145\/3205455.3205561","DOI":"10.1145\/3205455.3205561"},{"key":"1721_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511852008","volume-title":"Boolean functions: theory, algorithms, and applications","author":"Y Crama","year":"2011","unstructured":"Crama Y, Hammer PL (2011) Boolean functions: theory, algorithms, and applications. Cambridge University Press, Cambridge"},{"key":"1721_CR13","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.jhydrol.2018.04.012","volume":"561","author":"C Dai","year":"2018","unstructured":"Dai C, Qin X, Chen Y, Guo H (2018) Dealing with equality and benefit for water allocation in a lake watershed: a gini-coefficient based stochastic optimization approach. J Hydrol 561:322\u2013334","journal-title":"J Hydrol"},{"key":"1721_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10458-012-9210-0","volume":"28","author":"E Del Val","year":"2014","unstructured":"Del Val E, Rebollo M, Botti V (2014) Enhancing decentralized service discovery in open service-oriented multi-agent systems. Auton Agents Multi Agent Syst 28:1\u201330","journal-title":"Auton Agents Multi Agent Syst"},{"issue":"1","key":"1721_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"issue":"12","key":"1721_CR16","doi-asserted-by":"crossref","first-page":"3240","DOI":"10.1016\/j.cor.2009.02.019","volume":"36","author":"T Drezner","year":"2009","unstructured":"Drezner T, Drezner Z, Guyse J (2009) Equitable service by a facility: minimizing the gini coefficient. Comput Oper Res 36(12):3240\u20133246","journal-title":"Comput Oper Res"},{"key":"1721_CR17","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P Galinier","year":"1999","unstructured":"Galinier P, Hao JK (1999) Hybrid evolutionary algorithms for graph coloring. J Comb Optim 3:379\u2013397","journal-title":"J Comb Optim"},{"issue":"1","key":"1721_CR18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/3460310.3460311","volume":"14","author":"E Galv\u00e1n","year":"2021","unstructured":"Galv\u00e1n E (2021) Neuroevolution in deep neural networks: a comprehensive survey. ACM SIGEVOlution 14(1):3\u20137","journal-title":"ACM SIGEVOlution"},{"issue":"6","key":"1721_CR19","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/TAI.2021.3067574","volume":"2","author":"E Galv\u00e1n","year":"2021","unstructured":"Galv\u00e1n E, Mooney P (2021) Neuroevolution in deep neural networks: current trends and future challenges. IEEE Trans Artif Intell 2(6):476\u2013493","journal-title":"IEEE Trans Artif Intell"},{"issue":"6","key":"1721_CR20","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u0131a","year":"2009","unstructured":"Garc\u0131a S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the cec\u2019 2005 special session on real parameter optimization. J Heuristics 15(6):617\u2013644","journal-title":"J Heuristics"},{"key":"1721_CR21","unstructured":"Globus Al, Lawton J, Wipke T (2001) Graph crossover. In: Proceedings of the 3rd annual conference on genetic and evolutionary computation, GECCO\u201901, no 1. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA"},{"key":"1721_CR22","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10732-019-09431-y","volume":"26","author":"QM Ha","year":"2020","unstructured":"Ha QM, Deville Y, Pham QD, H\u00e0 MH (2020) A hybrid genetic algorithm for the traveling salesman problem with drone. J Heuristics 26:219\u2013247","journal-title":"J Heuristics"},{"key":"1721_CR23","first-page":"1573","volume":"1","author":"KL Hoffman","year":"2013","unstructured":"Hoffman KL, Padberg M, Rinaldi G et al (2013) Traveling salesman problem. Encycl Oper Res Manag Sci 1:1573\u20131578","journal-title":"Encycl Oper Res Manag Sci"},{"issue":"1","key":"1721_CR24","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Genetic algorithms. Sci Am 267(1):66\u201373","journal-title":"Sci Am"},{"issue":"13","key":"1721_CR25","doi-asserted-by":"crossref","first-page":"5099","DOI":"10.1007\/s00500-018-3177-y","volume":"23","author":"AAR Hosseinabadi","year":"2019","unstructured":"Hosseinabadi AAR, Vahidi J, Saemi B, Sangaiah AK, Elhoseny M (2019) Extended genetic algorithm for solving open-shop scheduling problem. Soft Comput 23(13):5099\u20135116","journal-title":"Soft Comput"},{"issue":"12","key":"1721_CR26","doi-asserted-by":"crossref","first-page":"3567","DOI":"10.1039\/C8SC05372C","volume":"10","author":"JH Jensen","year":"2019","unstructured":"Jensen JH (2019) A graph-based genetic algorithm and generative model\/monte carlo tree search for the exploration of chemical space. Chem Sci 10(12):3567\u20133572","journal-title":"Chem Sci"},{"issue":"7","key":"1721_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3465399","volume":"54","author":"J Ju\u00e1rez","year":"2021","unstructured":"Ju\u00e1rez J, Santos C, Brizuela CA (2021) A comprehensive review and a taxonomy proposal of team formation problems. ACM Comput Surv (CSUR) 54(7):1\u201333","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1721_CR28","unstructured":"Kahng AB, Moon Byung R (1995) Toward more powerful recombinations. In: Proceedings of the 6th international conference on genetic algorithms, no 8. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 96\u2013103"},{"key":"1721_CR29","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118773","volume":"212","author":"Y Karpova","year":"2023","unstructured":"Karpova Y, Villa F, Vallada E, Vecina M\u00c1 (2023) Heuristic algorithms based on the isochron analysis for dynamic relocation of medical emergency vehicles. Expert Syst Appl 212:118773","journal-title":"Expert Syst Appl"},{"key":"1721_CR30","doi-asserted-by":"publisher","unstructured":"Kim J, Hwang I, Kim Y-H, Moon B-R (2011) Genetic approaches for graph partitioning: a survey. In: Proceedings of the 13th annual conference on genetic and evolutionary computation, GECCO \u201911, no 8. Association for Computing Machinery, New York, NY, USA, pp 473\u2013480. https:\/\/doi.org\/10.1145\/2001576.2001642","DOI":"10.1145\/2001576.2001642"},{"key":"1721_CR31","doi-asserted-by":"publisher","unstructured":"Kim JH, Vu VH (2003) Generating random regular graphs. In: Proceedings of the thirty-fifth annual ACM symposium on theory of computing, STOC \u201903, no 10. Association for Computing Machinery, New York, NY, USA, pp 213\u2013222. https:\/\/doi.org\/10.1145\/780542.780576","DOI":"10.1145\/780542.780576"},{"issue":"2","key":"1721_CR32","first-page":"87","volume":"4","author":"JR Koza","year":"1994","unstructured":"Koza JR (1994) Genetic programming as a means for programming computers by natural selection. Stat Comput 4(2):87\u2013112","journal-title":"Stat Comput"},{"issue":"2","key":"1721_CR33","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larranaga","year":"1999","unstructured":"Larranaga P, Kuijpers CMH, Murga RH, Inza I, Dizdarevic S (1999) Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif Intell Rev 13(2):129\u2013170","journal-title":"Artif Intell Rev"},{"key":"1721_CR34","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.compenvurbsys.2016.07.002","volume":"59","author":"X Li","year":"2016","unstructured":"Li X, Parrott L (2016) An improved genetic algorithm for spatial optimization of multi-objective and multi-site land use allocation. Comput Environ Urban Syst 59:184\u2013194","journal-title":"Comput Environ Urban Syst"},{"key":"1721_CR35","volume":"90","author":"YY Liu","year":"2020","unstructured":"Liu YY, Cho WKT (2020) A spatially explicit evolutionary algorithm for the spatial partitioning problem. Appl Soft Comput 90:106129","journal-title":"Appl Soft Comput"},{"issue":"3","key":"1721_CR36","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1016\/j.ejor.2008.03.050","volume":"197","author":"BB Mabrouk","year":"2009","unstructured":"Mabrouk BB, Hasni H, Mahjoub Z (2009) On a parallel genetic-tabu search based algorithm for solving the graph colouring problem. Eur J Oper Res 197(3):1192\u20131201","journal-title":"Eur J Oper Res"},{"key":"1721_CR37","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100646","volume":"54","author":"L Manzoni","year":"2020","unstructured":"Manzoni L, Mariot L, Tuba E (2020) Balanced crossover operators in genetic algorithms. Swarm Evol Comput 54:100646","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"1721_CR38","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0165-1765(97)00101-8","volume":"56","author":"B Milanovic","year":"1997","unstructured":"Milanovic B (1997) A simple way to calculate the gini coefficient, and some implications. Econ Lett 56(1):45\u201349","journal-title":"Econ Lett"},{"key":"1721_CR39","unstructured":"Miller GF, Todd PM, Hegde SU (1989) Designing neural networks using genetic algorithms. In: Proceedings of the 3rd international conference on genetic algorithms, no 6. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 379\u2013384"},{"issue":"4\u20136","key":"1721_CR40","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0375-9601(99)00757-4","volume":"263","author":"ME Newman","year":"1999","unstructured":"Newman ME, Watts DJ (1999) Renormalization group analysis of the small-world network model. Phys Lett A 263(4\u20136):341\u2013346","journal-title":"Phys Lett A"},{"key":"1721_CR41","unstructured":"Oliver I, Smith D, Holland JR (1987) Study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the 2nd international conference on genetic algorithms (ICGA). L. Erlhaum Associates, Hillsdale, pp 224\u2013230"},{"key":"1721_CR42","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.eswa.2018.07.033","volume":"114","author":"M Owais","year":"2018","unstructured":"Owais M, Osman MK (2018) Complete hierarchical multi-objective genetic algorithm for transit network design problem. Expert Syst Appl 114:143\u2013154","journal-title":"Expert Syst Appl"},{"key":"1721_CR43","doi-asserted-by":"publisher","unstructured":"Palmer CR, Gibbons PB, Faloutsos C (2002) ANF: a fast and scalable tool for data mining in massive graphs. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201902, no 10. Association for Computing Machinery, New York, NY, USA, 81\u201390. https:\/\/doi.org\/10.1145\/775047.775059","DOI":"10.1145\/775047.775059"},{"issue":"4","key":"1721_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3009966","volume":"49","author":"G Pavai","year":"2016","unstructured":"Pavai G, Geetha T (2016) A survey on crossover operators. ACM Comput Surv (CSUR) 49(4):1\u201343","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"2","key":"1721_CR45","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1109\/3477.662766","volume":"28","author":"S Pierre","year":"1998","unstructured":"Pierre S, Legault G (1998) A genetic algorithm for designing distributed computer network topologies. IEEE Trans Syst Man Cybern Part B (Cybern) 28(2):249\u2013258","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"1721_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.asoc.2018.11.049","volume":"76","author":"V Sanchez-Anguix","year":"2019","unstructured":"Sanchez-Anguix V, Chalumuri R, Aydo\u011fan R, Julian V (2019) A near Pareto optimal approach to student\u2013supervisor allocation with two sided preferences and workload balance. Appl Soft Comput 76:1\u201315","journal-title":"Appl Soft Comput"},{"key":"1721_CR47","doi-asserted-by":"crossref","unstructured":"Vecina M\u00c1, Moreno JC, Karpova Y, Alberola JM, S\u00e1nchez-Anguix V, Villa F, Vallada E (2022) A decision support tool for the static allocation of emergency vehicles to stations. In: International conference on hybrid artificial intelligence systems. Springer, pp 141\u2013152","DOI":"10.1007\/978-3-031-15471-3_13"},{"issue":"20","key":"1721_CR48","doi-asserted-by":"crossref","first-page":"23883","DOI":"10.1007\/s10489-023-04748-5","volume":"53","author":"V Sanchez-Anguix","year":"2023","unstructured":"Sanchez-Anguix V, Alberola JM, Del Val E, Palomares A, Teruel MD (2023) Comparing computational algorithms for team formation in the classroom: a classroom experience. Appl Intell 53(20):23883\u201323904","journal-title":"Appl Intell"},{"issue":"1","key":"1721_CR49","first-page":"167","volume":"13","author":"M Samadi","year":"2020","unstructured":"Samadi M, Nouraei M, Mozaffari MM, Haji Karimi B (2020) Optimal localization of shopping centers using metaheuristic genetic algorithm. J Optim Ind Eng 13(1):167\u2013176","journal-title":"J Optim Ind Eng"},{"key":"1721_CR50","doi-asserted-by":"crossref","unstructured":"Sanches D, Whitley D, Tin\u00f3s R (2017) Building a better heuristic for the traveling salesman problem: combining edge assembly crossover and partition crossover. In: Proceedings of the genetic and evolutionary computation conference. pp 329\u2013336","DOI":"10.1145\/3071178.3071305"},{"key":"1721_CR51","doi-asserted-by":"crossref","unstructured":"Silva NB, Tsang R, Cavalcanti GD, Tsang J (2010) A graph-based friend recommendation system using genetic algorithm. In: IEEE congress on evolutionary computation. IEEE, pp 1\u20137","DOI":"10.1109\/CEC.2010.5586144"},{"key":"1721_CR52","doi-asserted-by":"publisher","unstructured":"Sotto LFDP, Kaufmann P, Atkinson T, Kalkreuth R, Basgalupp MP (2020) A study on graph representations for genetic programming. In: Proceedings of the 2020 genetic and evolutionary computation conference, GECCO \u201920, no 9. Association for Computing Machinery, New York, NY, USA, pp 931\u2013939. https:\/\/doi.org\/10.1145\/3377930.3390234","DOI":"10.1145\/3377930.3390234"},{"issue":"2","key":"1721_CR53","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1162\/artl.2009.15.2.15202","volume":"15","author":"KO Stanley","year":"2009","unstructured":"Stanley KO, D\u2019Ambrosio DB, Gauci J (2009) A hypercube-based encoding for evolving large-scale neural networks. Artif Life 15(2):185\u2013212","journal-title":"Artif Life"},{"issue":"2","key":"1721_CR54","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1162\/106365602320169811","volume":"10","author":"KO Stanley","year":"2002","unstructured":"Stanley KO, Miikkulainen R (2002) Evolving neural networks through augmenting topologies. Evol Comput 10(2):99\u2013127","journal-title":"Evol Comput"},{"issue":"04","key":"1721_CR55","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1017\/S0963548399003867","volume":"8","author":"A Steger","year":"1999","unstructured":"Steger A, Wormald NC (1999) Generating random regular graphs quickly. Comb Prob Comput 8(04):377\u2013396","journal-title":"Comb Prob Comput"},{"key":"1721_CR56","doi-asserted-by":"publisher","unstructured":"Stonedahl F, Rand W, Wilensky U (2008) CrossNet: a framework for crossover with network-based chromosomal representations. In: Proceedings of the 10th annual conference on genetic and evolutionary computation, GECCO \u201908, no 8. Association for Computing Machinery, New York, NY, USA, pp 1057\u20131064. https:\/\/doi.org\/10.1145\/1389095.1389290","DOI":"10.1145\/1389095.1389290"},{"key":"1721_CR57","doi-asserted-by":"crossref","unstructured":"Sun X, Wang J, Wu W, Liu W (2018) Genetic algorithm for optimizing routing design and fleet allocation of freeway service overlapping patrol. Sustainability 10(11):4120","DOI":"10.3390\/su10114120"},{"key":"1721_CR58","doi-asserted-by":"publisher","unstructured":"Tin\u00f3s R, Whitley D, Chicano F (2015) Partition crossover for pseudo-boolean optimization. In: Proceedings of the 2015 ACM conference on foundations of genetic algorithms XIII, FOGA \u201915, no 13. Association for Computing Machinery, New York, NY, USA, pp 137\u2013149. https:\/\/doi.org\/10.1145\/2725494.2725497","DOI":"10.1145\/2725494.2725497"},{"key":"1721_CR59","doi-asserted-by":"publisher","unstructured":"Tin\u00f3s R, Whitley D, Chicano F, Ochoa G (2021) Partition crossover for continuous optimization: ePX. In: Proceedings of the genetic and evolutionary computation conference, GECCO \u201921, no 9. Association for Computing Machinery, New York, NY, USA, pp 627\u2013635. https:\/\/doi.org\/10.1145\/3449639.3459296","DOI":"10.1145\/3449639.3459296"},{"issue":"2","key":"1721_CR60","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1162\/evco_a_00254","volume":"28","author":"R Tin\u00f3s","year":"2020","unstructured":"Tin\u00f3s R, Whitley D, Ochoa G (2020) A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evol Comput 28(2):255\u2013288","journal-title":"Evol Comput"},{"key":"1721_CR61","first-page":"1","volume":"53","author":"HT \u00dcnal","year":"2022","unstructured":"\u00dcnal HT, Ba\u015f\u00e7ift\u00e7i F (2022) Evolutionary design of neural network architectures: a review of three decades of research. Artif Intell Rev 53:1\u201380","journal-title":"Artif Intell Rev"},{"key":"1721_CR62","doi-asserted-by":"crossref","unstructured":"Uriot T, Izzo D (2020) Safe crossover of neural networks through neuron alignment. arXiv preprint arXiv:2003.10306","DOI":"10.1145\/3377930.3390197"},{"issue":"4","key":"1721_CR63","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1109\/TEVC.2022.3225591","volume":"28","author":"B Wang","year":"2024","unstructured":"Wang B, Pei W, Xue B, Zhang M (2024) A multi-objective genetic algorithm to evolving local interpretable model-agnostic explanations for deep neural networks in image classification. IEEE Trans Evol Comput 28(4):903\u2013917. https:\/\/doi.org\/10.1109\/TEVC.2022.3225591","journal-title":"IEEE Trans Evol Comput"},{"key":"1721_CR64","doi-asserted-by":"crossref","unstructured":"Wang K, Gong Y, Peng Y, Hu C, Chen N (2020) An improved fusion crossover genetic algorithm for a time-weighted maximal covering location problem for sensor siting under satellite-borne monitoring. Comput Geosci 136:104406","DOI":"10.1016\/j.cageo.2020.104406"},{"issue":"2","key":"1721_CR65","doi-asserted-by":"crossref","first-page":"58","DOI":"10.14778\/1921071.1921073","volume":"4","author":"N Wang","year":"2010","unstructured":"Wang N, Zhang J, Tan KL, Tung AK (2010) On triangulation-based dense neighborhood graph discovery. Proc VLDB Endow 4(2):58\u201368","journal-title":"Proc VLDB Endow"},{"key":"1721_CR66","doi-asserted-by":"publisher","unstructured":"Whitley D, Hains D, Howe A (2009) Tunneling between optima: partition crossover for the traveling salesman problem. In: Proceedings of the 11th annual conference on genetic and evolutionary computation, GECCO \u201909, no 8. Association for Computing Machinery, New York, NY, USA, pp 915\u2013922. https:\/\/doi.org\/10.1145\/1569901.1570026","DOI":"10.1145\/1569901.1570026"},{"key":"1721_CR67","unstructured":"Whitley LD, Starkweather T, Fuquay D (1989) Scheduling problems and traveling salesmen: the genetic edge recombination operator. In: Proceedings of the 3rd international conference on genetic algorithms, no 8. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 133\u2013140"},{"issue":"2","key":"1721_CR68","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/j.ejor.2013.06.002","volume":"231","author":"Q Wu","year":"2013","unstructured":"Wu Q, Hao JK (2013) A hybrid metaheuristic method for the maximum diversity problem. Eur J Oper Res 231(2):452\u2013464","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1721_CR69","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/MCI.2021.3084435","volume":"16","author":"Y Xue","year":"2021","unstructured":"Xue Y, Wang Y, Liang J, Slowik A (2021) A self-adaptive mutation neural architecture search algorithm based on blocks. IEEE Comput Intell Mag 16(3):67\u201378","journal-title":"IEEE Comput Intell Mag"},{"issue":"5","key":"1721_CR70","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3340848","volume":"13","author":"Y Xue","year":"2019","unstructured":"Xue Y, Xue B, Zhang M (2019) Self-adaptive particle swarm optimization for large-scale feature selection in classification. ACM Trans Knowl Discov Data (TKDD) 13(5):1\u201327","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"1721_CR71","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.asoc.2018.05.029","volume":"70","author":"L Yang","year":"2018","unstructured":"Yang L, Zhu Q, Huang J, Cheng D, Wu Q, Hong X (2018) Natural neighborhood graph-based instance reduction algorithm without parameters. Appl Soft Comput 70:279\u2013287","journal-title":"Appl Soft Comput"},{"key":"1721_CR72","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.ins.2018.10.005","volume":"509","author":"JH Yi","year":"2020","unstructured":"Yi JH, Xing LN, Wang GG, Dong J, Vasilakos AV, Alavi AH, Wang L (2020) Behavior of crossover operators in nsga-iii for large-scale optimization problems. Inf Sci 509:470\u2013487","journal-title":"Inf Sci"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01721-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01721-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01721-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T16:27:31Z","timestamp":1738945651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01721-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,22]]},"references-count":72,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["1721"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01721-8","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2025,1,22]]},"assertion":[{"value":"12 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This study does not contain any studies with human or animal subjects performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"160"}}