An improved genetic algorithm based on information entropy is presented in this paper. A new iteration scheme in conjunction with multi-population genetic strategy, entropy-based searching technique with narrowing down space and the quasi-exact penalty function is developed to solve nonlinear programming problems with equality and inequality constraints. A specific strategy of reserving the most fitness member with evolutionary historic information is effectively used to approximate the solution of the nonlinear programming problems to the global optimization. Numerical examples and an application in molecular docking demonstrate its accuracy and efficiency. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Li, C. L., Sun, Y., Guo, Y. S., Chu, F. M., & Guo, Z. R. (2005). An entropy-based multi-population genetic algorithm and its application. In Lecture Notes in Computer Science (Vol. 3644, pp. 957–966). Springer Verlag. https://doi.org/10.1007/11538059_99
Mendeley helps you to discover research relevant for your work.