By Topic

Solving the shortest path routing problems by integrating a fast searching strategy into a hysteretic neural network with transient chaos

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
$31 $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

2 Author(s)
Xiuhong Wang ; Sch. of Manage., Tianjin Univ., Tianjin, China ; Qingli Qiao

In this paper a new shortest path routing algorithm is presented. This algorithm integrates a fast searching strategy into the hysteretic transiently chaotic neural network model which has higher ability of searching optimal solution. By eliminating the components of the eigenvectors with eminent negative eigenvalues of the weight matrix, this proposed method can avoid oscillation and offer a considerable acceleration of converging to the optimal solution when being used to solve the shortest path problems. The numerical simulation results show that the proposed method can quickly find the global optimization solution of the shortest problems.

Published in:

Natural Computation (ICNC), 2010 Sixth International Conference on  (Volume:2 )

Date of Conference:

10-12 Aug. 2010