By Topic

Solving Shortest Path Problem Using Hopfield Networks and Genetic Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Matheus Giovanni Pires ; Dept. of Electr. Eng., Sao Paulo Univ., Sao Paulo ; Ivan Nunes da Silva ; Fabiana Cristina Bertoni

Dynamic programming has provided a powerful approach to optimization problems, but its applicability has been somewhat limited because of the large computational requirements of the standard computational algorithm. In recent years a number of new procedures with reduced computational requirements have been developed. 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 optimization problems. Experimental results are presented and discussed.

Published in:

Hybrid Intelligent Systems, 2008. HIS '08. Eighth International Conference on

Date of Conference:

10-12 Sept. 2008