{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T14:07:36Z","timestamp":1780582056415,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T00:00:00Z","timestamp":1679011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T00:00:00Z","timestamp":1679011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52074205"],"award-info":[{"award-number":["52074205"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the outstanding young scholars fund granted by Shaanxi Province","award":["2020JC-44"],"award-info":[{"award-number":["2020JC-44"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s00500-023-07978-4","type":"journal-article","created":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T00:47:39Z","timestamp":1679014059000},"page":"7419-7438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An adaptive adjacent maximum distance crossover operator for multi-objective algorithms"],"prefix":"10.1007","volume":"27","author":[{"given":"Qinghua","family":"Gu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7876-9288","authenticated-orcid":false,"given":"Song","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuexian","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neal N.","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rongrong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"7978_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apacoust.2020.107669","volume":"172","author":"N Agrawal","year":"2021","unstructured":"Agrawal N, Kumar A, Bajaj V, Singh GK (2021) Design of digital IIR filter: a research survey. Appl Acoust 172:107669","journal-title":"Appl Acoust"},{"issue":"5","key":"7978_CR2","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1007\/s00034-018-0959-5","volume":"38","author":"N Agrawal","year":"2019","unstructured":"Agrawal N, Kumar A, Bajaj V (2019) A new method for designing of stable digital iir filter using hybrid method. Circuits Syst Signal Process 38(5):2187\u20132226","journal-title":"Circuits Syst Signal Process"},{"issue":"2","key":"7978_CR3","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1109\/TIE.2018.2831184","volume":"66","author":"N Agrawal","year":"2018","unstructured":"Agrawal N, Kumar A, Bajaj V, Singh GK (2018) Design of bandpass and bandstop infinite impulse response filters using fractional derivative. IEEE Trans Industr Electron 66(2):1285\u20131295","journal-title":"IEEE Trans Industr Electron"},{"issue":"6","key":"7978_CR4","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1109\/TETCI.2017.2748151","volume":"1","author":"N Agrawal","year":"2017","unstructured":"Agrawal N, Kumar A, Bajaj V (2017) A new design method for stable IIR filters with nearly linear-phase response based on fractional derivative and swarm intelligence. IEEE Trans Emerg Top Comput Intell 1(6):464\u2013477","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"key":"7978_CR5","doi-asserted-by":"crossref","unstructured":"Castro OR, Santana R, Lozano JA et al. (2017) Combining CMA-ES and MOEA\/DD for many-objective optimization. In: IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 1451\u20131458","DOI":"10.1109\/CEC.2017.7969474"},{"key":"7978_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.engappai.2018.01.009","volume":"70","author":"Y Chen","year":"2018","unstructured":"Chen Y, Li L, Xiao J et al (2018) Particle swarm optimizer with crossover operation. Eng Appl Artif Intell 70:159\u2013169","journal-title":"Eng Appl Artif Intell"},{"issue":"6","key":"7978_CR7","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1109\/TEVC.2015.2395073","volume":"19","author":"R Cheng","year":"2015","unstructured":"Cheng R, Jin Y, Narukawa K et al (2015) A multiobjective evolutionary algorithm using Gaussian process-based inverse modeling. IEEE Trans Evol Comput 19(6):838\u2013856","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"7978_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10710-005-6164-x","volume":"6","author":"CAC Coello","year":"2005","unstructured":"Coello CAC, Cort\u00e9s NC (2005) Solving multiobjective optimization problems using an artificial immune system. Genet Prog Evol Mach 6(2):163\u2013190","journal-title":"Genet Prog Evol Mach"},{"issue":"3","key":"7978_CR9","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"CAC Coello","year":"2004","unstructured":"Coello CAC, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization[J]. IEEE Trans Evol Comput 8(3):256\u2013279","journal-title":"IEEE Trans Evol Comput"},{"key":"7978_CR10","doi-asserted-by":"crossref","unstructured":"Deb K, Thiele L, Laumanns M et al. (2002a) Scalable multi-objective optimization test problems. In: Proceedings of the 2002a Congress on Evolutionary Computation. CEC'02 (Cat. No. 02TH8600). IEEE 1:825\u2013830","DOI":"10.1109\/CEC.2002.1007032"},{"issue":"2","key":"7978_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S et al (2002b) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"7978_CR12","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1016\/j.amc.2006.10.047","volume":"188","author":"K Deep","year":"2007","unstructured":"Deep K, Thakur M (2007) A new crossover operator for real coded genetic algorithms. Appl Math Comput 188(1):895\u2013911","journal-title":"Appl Math Comput"},{"key":"7978_CR13","doi-asserted-by":"publisher","first-page":"2970","DOI":"10.1109\/ACCESS.2017.2786347","volume":"6","author":"LB Deng","year":"2017","unstructured":"Deng LB, Wang S, Qiao LY et al (2017) DE-RCO: rotating crossover operator with multiangle searching strategy for adaptive differential evolution. IEEE Access 6:2970\u20132983","journal-title":"IEEE Access"},{"issue":"1","key":"7978_CR14","doi-asserted-by":"publisher","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 et al (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":"7978_CR15","doi-asserted-by":"publisher","first-page":"390","DOI":"10.3390\/info10120390","volume":"10","author":"A Hassanat","year":"2019","unstructured":"Hassanat A, Almohammadi K, Alkafaween E et al (2019) Choosing mutation and crossover ratios for genetic algorithms\u2014a review with a new dynamic approach. Information 10(12):390","journal-title":"Information"},{"issue":"6","key":"7978_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/cmm4.1122","volume":"2","author":"Z Iqbal","year":"2020","unstructured":"Iqbal Z, Bashir N, Hussain A et al (2020) A novel completely mapped crossover operator for genetic algorithm to facilitate the traveling salesman problem. Comput Math Methods 2(6):e1122","journal-title":"Comput Math Methods"},{"issue":"5","key":"7978_CR17","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TEVC.2003.817234","volume":"7","author":"MT Jensen","year":"2003","unstructured":"Jensen MT (2003) Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms. IEEE Trans Evol Comput 7(5):503\u2013515","journal-title":"IEEE Trans Evol Comput"},{"issue":"05","key":"7978_CR18","doi-asserted-by":"publisher","first-page":"879","DOI":"10.13195\/j.kzyjc.2017.1442","volume":"33","author":"J Liu","year":"2018","unstructured":"Liu J, Li F, Wang H, Li T (2018) Review of evolutionary high-dimensional multi-objective optimization algorithms. Control and Decision 33(05):879\u2013887. https:\/\/doi.org\/10.13195\/j.kzyjc.2017.1442","journal-title":"Control and Decision"},{"key":"7978_CR19","doi-asserted-by":"crossref","unstructured":"Yi J-H, Deb S, Dong J, Amir H, Wang AG-G (2018) An improved NSGA-III algorithm with adaptive mutation operator for Big Data optimization problems. Future Generation Comput Syst, 88","DOI":"10.1016\/j.future.2018.06.008"},{"issue":"05","key":"7978_CR20","first-page":"166","volume":"55","author":"J Dong","year":"2019","unstructured":"Dong J, Wang X, Liang C (2019) Improved NSGA-II algorithm based on individual neighborhood. Comput Eng Appl 55(05):166\u2013174","journal-title":"Comput Eng Appl"},{"key":"7978_CR21","doi-asserted-by":"crossref","unstructured":"Kiraz B, Bidgoli A A, Ebrahimpour-Komleh H et al. (2020) A Novel Collective Crossover Operator for Genetic Algorithms. In: IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, pp 4204\u20134209","DOI":"10.1109\/SMC42975.2020.9282841"},{"key":"7978_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113381","volume":"151","author":"B Koohestani","year":"2020","unstructured":"Koohestani B (2020) A crossover operator for improving the efficiency of permutation-based genetic algorithms. Expert Syst Appl 151:113381","journal-title":"Expert Syst Appl"},{"key":"7978_CR23","doi-asserted-by":"crossref","unstructured":"Kora P, Yadlapalli P (2017) Crossover operators in genetic algorithms: a review. Int J Comput Appl 162(10)","DOI":"10.5120\/ijca2017913370"},{"key":"7978_CR24","doi-asserted-by":"crossref","unstructured":"Kumar A, Agrawal N, Sharma et al. (2018) Hilbert transform design based on fractional derivatives and swarm optimization.IEEE Trans Cyber 50(5):2311\u20132320","DOI":"10.1109\/TCYB.2018.2875540"},{"issue":"5","key":"7978_CR25","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2014.2373386","volume":"19","author":"K Li","year":"2014","unstructured":"Li K, Deb K, Zhang Q et al (2014) An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans Evol Comput 19(5):694\u2013716","journal-title":"IEEE Trans Evol Comput"},{"key":"7978_CR26","doi-asserted-by":"crossref","unstructured":"Pan L, Xu W, Li L, He C, Cheng R (2021) Adaptive simulated binary crossover for rotated multi-objective optimization. Swarm Evol Comput, 60","DOI":"10.1016\/j.swevo.2020.100759"},{"issue":"02","key":"7978_CR27","doi-asserted-by":"publisher","first-page":"271","DOI":"10.3724\/SP.J.1001.2009.00271","volume":"20","author":"M Gong","year":"2009","unstructured":"Gong M, Jiao L et al (2009) Research on evolutionary multi-objective optimization algorithm. J Softw 20(02):271\u2013289","journal-title":"J Softw"},{"key":"7978_CR28","doi-asserted-by":"crossref","unstructured":"Raquel CR, Naval Jr PC (2005) An effective use of crowding distance in multiobjective particle swarm optimization. In: Proceedings of the 7th annual conference on genetic and evolutionary computation, pp 257\u2013264","DOI":"10.1145\/1068009.1068047"},{"key":"7978_CR29","doi-asserted-by":"crossref","unstructured":"Srinivas M, Patnaik LM (1994) Genetic algorithms: a survey. Computer 27(6):17\u201326","DOI":"10.1109\/2.294849"},{"issue":"3","key":"7978_CR30","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221\u2013248","journal-title":"Evol Comput"},{"issue":"4","key":"7978_CR31","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian Y, Cheng R, Zhang X et al (2017) PlatEMO: A MATLAB platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput Intell Mag 12(4):73\u201387","journal-title":"IEEE Comput Intell Mag"},{"issue":"2","key":"7978_CR32","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1109\/TEVC.2019.2918140","volume":"24","author":"Y Tian","year":"2019","unstructured":"Tian Y, Zhang X, Wang C et al (2019) An evolutionary algorithm for large-scale sparse multiobjective optimization problems. IEEE Trans Evol Comput 24(2):380\u2013393","journal-title":"IEEE Trans Evol Comput"},{"issue":"7","key":"7978_CR33","first-page":"1717","volume":"13","author":"SG Varun Kumar","year":"2017","unstructured":"Varun Kumar SG, Panneerselvam R (2017) A study of crossover operators for genetic algorithms to solve VRP and its variants and new sinusoidal motion crossover operator. Int J Comput Intell Res 13(7):1717\u20131733","journal-title":"Int J Comput Intell Res"},{"issue":"3","key":"7978_CR34","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s12351-016-0251-z","volume":"18","author":"GG Wang","year":"2018","unstructured":"Wang GG, Deb S, Zhao X et al (2018) A new monarch butterfly optimization with an improved crossover operator. Oper Res Int Journal 18(3):731\u2013755","journal-title":"Oper Res Int Journal"},{"issue":"6","key":"7978_CR35","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"7978_CR36","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"7978_CR37","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s10489-018-1263-6","volume":"49","author":"Z Zhao","year":"2019","unstructured":"Zhao Z, Liu B, Zhang C et al (2019) An improved adaptive NSGA-II with multi-population algorithm. Appl Intell 49(2):569\u2013580","journal-title":"Appl Intell"},{"key":"7978_CR38","doi-asserted-by":"crossref","unstructured":"Zitzler E,Deb K,Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2)","DOI":"10.1162\/106365600568202"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-07978-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-07978-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-07978-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T11:27:58Z","timestamp":1729078078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-07978-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,17]]},"references-count":38,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["7978"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-07978-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1886662\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,17]]},"assertion":[{"value":"25 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflicts of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}