×

A dynamic genetic algorithm based on continuous neural networks for a kind of non-convex optimization problems. (English) Zbl 1161.65333

Summary: This paper presents a kind of dynamic genetic algorithm based on a continuous neural network, which is intrinsically the steepest decent method for constrained optimization problems. The proposed algorithm combines the local searching ability of the steepest decent methods with the global searching ability of genetic algorithms. Genetic algorithms are used to decide each initial point of the steepest decent methods so that all the initial points can be searched intelligently. The steepest decent methods are employed to decide the fitness of genetic algorithms so that some good initial points can be selected. The proposed algorithm is motivated theoretically and biologically. It can be used to solve a non-convex optimization problem which is quadratic and even more non-linear. Compared with standard genetic algorithms, it can improve the precision of the solution while decreasing the searching scale. In contrast to the ordinary steepest decent method, it can obtain global sub-optimal solution while lessening the complexity of calculation.

MSC:

65K05 Numerical mathematical programming methods
90C20 Quadratic programming
90C26 Nonconvex programming, global optimization
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bagley, J. D., The behavior of adaptive systems which employ genetic and correlation algorithms, Dissertation Abstracts International, 28, 12 (1968)
[2] Goldberg, D. E., Genetic Algorithm-In Search, Optimization and Machine Learning (1989), Addison Wesley: Addison Wesley New York · Zbl 0721.68056
[3] Koza, J. R., Genetic Programming: On the Programming of Computers by Means of Natural Selection (1992), MIT Press: MIT Press Cambridge · Zbl 0850.68161
[4] Koza, J. R., Genetic Programming II: Automatic Discovery of Reusable Programs (1994), MIT Press: MIT Press Cambridge · Zbl 0850.68160
[5] Zak, S. H.; Uptising, V.; Hui, S., Solving linear programming problems with neural networks: a comparative study, IEEE Transactions on Neural Networks, 6, 1, 94-104 (1995)
[6] Kennedy, M. P.; Chua, L. O., Neural networks for nonlinear programming, IEEE Transactions on Circuits and Systems, 35, 5, 554-562 (1988)
[7] Xia, Y., A new neural network for solving linear and quadratic programming problems, IEEE Transactions on Neural Networks, 7, 6, 1544-1547 (1996)
[8] Xia, Y., New neural network for solving extended linear programming problems, IEEE Transactions on Neural Networks, 8, 3, 803-806 (1997)
[9] J.D. Schaffer, D. Whitley, L.J. Eshelman. Combinations of genetic algorithms and neural networks: A survey of the state of the art. in: Proceedings of the International Workshop on Combinations of Genetic Algorithms and Neural Networks, 1992, pp. 1-32; J.D. Schaffer, D. Whitley, L.J. Eshelman. Combinations of genetic algorithms and neural networks: A survey of the state of the art. in: Proceedings of the International Workshop on Combinations of Genetic Algorithms and Neural Networks, 1992, pp. 1-32
[10] Mehrotha, K.; Mohan, C. K.; Ranka, S., Elements of Artificial Neural Network (1997), MIT Press: MIT Press Cambridge, MA
[11] Tao, Q.; Cao, Jd.; Sun, Dm., A simple and high performance neural network for quadratic programming problems, Applied Mathematics and Computation, 124, 2, 251-260 (2001) · Zbl 1162.90532
[12] Tao, Q.; Cao Meisheng Xue, Jd.; Xue, M.; Qiao, H., A high performance neural network for solving nonlinear programming problems with hybrid constraints, Physics Letters A, 288, 88-94 (2001) · Zbl 0971.68132
[13] Li, J.; Michel, A. N.; Porod, W., Analysis and synthesis of a class of neural networks: Linear systems operating on a closed hypercuber, IEEE Transactions on Neural Networks, 36, 11, 1405-1422 (1989) · Zbl 0689.94004
[14] Tao, Q.; Fang, Tj., The neural network based on the constraint domain and LSSM, Chinese Artificial Intelligence and Pattern Recognition, 13, 1, 20-25 (2000), (in Chinese)
[15] Tao, Q.; Fang, Tj.; Qiao, H., A novel continuous-time neural network for realizing associative memory, IEEE Transactions on Neural Networks, 12, 2, 418-423 (2001)
[16] Kinderlerer, D.; Stampcchia, G., An Introduction to Variational Inequalities and their Applications (1980), Academic: Academic New York
[17] Zhang, Xm.; Li, Xj.; Chen, Zh., The Theory of Ordinary Differential Equations in Optimal Control Theory (1982), Chinese Advanced Educational Press: Chinese Advanced Educational Press Beijing, (in Chinese)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.