Abstract
Most genetic operators use random mating selection strategy and fixed rate crossover operator to solve various optimization problems. In order to improve the convergence and diversity of the algorithm, an adaptive adjacent maximum distance crossover operator is proposed in this paper. A new mating selection strategy (distance-based mating selection strategy) and an adaptive mechanism (adaptive crossover strategy based on population convergence) are adopted. Distance-based mating selection strategy purposefully selects parents to produce better offspring. Adaptive crossover strategy based on population convergence increases the convergence speed of the algorithm by controlling the crossover probability. The proposed crossover strategy is evaluated on the simulated binary crossover operators of non-dominated sorting genetic algorithm II and multi-objective evolutionary algorithm based on decomposition. The performance of the algorithm is verified on a series of standard test problems. Finally, the optimization results of the improved algorithm using adaptive adjacent maximum distance crossover operator and the standard algorithm are compared and analyzed. The experimental results show that the algorithm using adaptive adjacent maximum distance crossover operator has better optimization results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
Enquiries about data availability should be directed to the authors.
References
Agrawal N, Kumar A, Bajaj V, Singh GK (2021) Design of digital IIR filter: a research survey. Appl Acoust 172:107669
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–2226
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–1295
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–477
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–1458
Chen Y, Li L, Xiao J et al (2018) Particle swarm optimizer with crossover operation. Eng Appl Artif Intell 70:159–169
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–856
Coello CAC, Cortés NC (2005) Solving multiobjective optimization problems using an artificial immune system. Genet Prog Evol Mach 6(2):163–190
Coello CAC, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization[J]. IEEE Trans Evol Comput 8(3):256–279
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–830
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–197
Deep K, Thakur M (2007) A new crossover operator for real coded genetic algorithms. Appl Math Comput 188(1):895–911
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–2983
Derrac J, García 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–18
Hassanat A, Almohammadi K, Alkafaween E et al (2019) Choosing mutation and crossover ratios for genetic algorithms—a review with a new dynamic approach. Information 10(12):390
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
Jensen MT (2003) Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms. IEEE Trans Evol Comput 7(5):503–515
Liu J, Li F, Wang H, Li T (2018) Review of evolutionary high-dimensional multi-objective optimization algorithms. Control and Decision 33(05):879–887. https://doi.org/10.13195/j.kzyjc.2017.1442
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
Dong J, Wang X, Liang C (2019) Improved NSGA-II algorithm based on individual neighborhood. Comput Eng Appl 55(05):166–174
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–4209
Koohestani B (2020) A crossover operator for improving the efficiency of permutation-based genetic algorithms. Expert Syst Appl 151:113381
Kora P, Yadlapalli P (2017) Crossover operators in genetic algorithms: a review. Int J Comput Appl 162(10)
Kumar A, Agrawal N, Sharma et al. (2018) Hilbert transform design based on fractional derivatives and swarm optimization.IEEE Trans Cyber 50(5):2311–2320
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–716
Pan L, Xu W, Li L, He C, Cheng R (2021) Adaptive simulated binary crossover for rotated multi-objective optimization. Swarm Evol Comput, 60
Gong M, Jiao L et al (2009) Research on evolutionary multi-objective optimization algorithm. J Softw 20(02):271–289
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–264
Srinivas M, Patnaik LM (1994) Genetic algorithms: a survey. Computer 27(6):17–26
Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221–248
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–87
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–393
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–1733
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–755
Zhang Q, Li H (2007) MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731
Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271
Zhao Z, Liu B, Zhang C et al (2019) An improved adaptive NSGA-II with multi-population algorithm. Appl Intell 49(2):569–580
Zitzler E,Deb K,Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2)
Acknowledgements
Authors thank for the support of National Natural Science Foundation of China (No. 52074205) and outstanding young scholars fund granted by Shaanxi Province (No. 2020JC-44).
Funding
This work is supported by the National Natural Science Foundation of China No. 52074205, and part of it is supported by the outstanding young scholars fund granted by Shaanxi Province No. 2020JC-44.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Gu, Q., Gao, S., Li, X. et al. An adaptive adjacent maximum distance crossover operator for multi-objective algorithms. Soft Comput 27, 7419–7438 (2023). https://doi.org/10.1007/s00500-023-07978-4
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-023-07978-4