• Login
  • Register
  • Search

Optimization Research Based on Improved Genetic Algorithm

HongLing Chen


Genetic algorithm itself has the characteristics of openness and parallel processing. Promoting its efficiency in optimizing recognition, widely applied in fields such as engineering, science, economics and computer science. However, the structural analysis time of traditional genetic algorithms is long and “premature” , the problem of low efficiency in designing and facing large-scale data still exists. In view of this, the article deeply analyzes the current shortcomings of genetic algorithms, and proposes suggestions to improve genetic algorithms with moderate functions, promote the integration of other optimization algorithms into genetic algorithms, and use big data technology to optimize genetic algorithms. Improvements are made to address the above issues, in order to provide useful references for optimizing genetic algorithms.


Genetic algorithm; Evolution process; Improvement path; Local optimal solution

Full Text:


Included Database


[1] D L.J. (2018). Research on Complementary Problems Based on Improved Genetic Algorithms, Journal of Tonghua Normal University, 39 (4): 35-37.

[2] He P.B., Wu C.X. (2018). Improved Genetic Algorithm Path Planning Based on Multiple Constraints , Software Guide, 17 (7): 180-183+188.

[3] Song Y.J., Wang P., Zhang Z.S, et al. (2019). Improved Genetic Algorithm for Multi satellite Task Planning Problems, Control Theory and Applications, 36 (9): 1391-1397.

[4] Hao P. (2023). Improved Genetic Algorithm Based on Growth Mechanism and Its Application, Journal of Ezhou University, 30 (3): 99-101.

[5] Luo J.Y., Lu T. (2008). Optimization Research Based on Improved Genetic Algorithm [J]. Journal of Xi’an University of Arts and Sciences (Natural Science Edition), (2): 40-42.

DOI: http://dx.doi.org/10.18686/ahe.v7i28.10618