Neurogenetic approach for solving dynamic programming problems

The shortest path problem is the classical combinatorial optimization problem arising in numerous planning and designing contexts. This paper presents a association of a modified Hopfield neural network, which is a computing model capable of solving a large class of optimization problems, with a genetic algorithm, that to make possible cover nonlinear and extensive search spaces, which guarantees the convergence of the system to the equilibrium points that represent solutions for the dynamic optimization problems. Experimental results are presented and discussed.

[1]  Gary G. Yen,et al.  A generic framework for constrained optimization using genetic algorithms , 2005, IEEE Transactions on Evolutionary Computation.

[2]  Gang Feng,et al.  A new neural network for solving nonlinear projection equations , 2007, Neural Networks.

[3]  Dingwei Wang,et al.  Genetic algorithms for solving shortest path problems , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[4]  Stefen Hui,et al.  Solving linear programming problems with neural networks: a comparative study , 1995, IEEE Trans. Neural Networks.

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  Jun Wang.  A recurrent neural network for solving the shortest path problem , 1996 .

[7]  Chinchuan Chiu,et al.  Energy function analysis of dynamic programming neural networks , 1991, IEEE Trans. Neural Networks.

[8]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[9]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[10]  Mahesan Niranjan,et al.  A theoretical investigation into the performance of the Hopfield model , 1990, IEEE Trans. Neural Networks.

[11]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[12]  Jiangang Lu,et al.  An Improved Multi-Population Genetic Algorithm for Constrained Nonlinear Optimization , 2006, 2006 6th World Congress on Intelligent Control and Automation.

[13]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[14]  Zhaowang Ji,et al.  Finding multi-objective paths in stochastic networks: a simulation-based genetic algorithm approach , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[15]  Alexander Graham,et al.  Kronecker Products and Matrix Calculus: With Applications , 1981 .

[16]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[17]  Alessandro Goedtel,et al.  The modified Hopfield architecture applied in dynamic programming problems and bipartite graph optimization , 2007, Int. J. Hybrid Intell. Syst..