By Topic

Dynamic shortest path in stochastic traffic networks based on fluid neural network and Particle Swarm Optimization

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)
Yanfang Deng ; School of science, Wuhan University of Technology, Hubei, 430070, China ; Hengqing Tong ; Xiedong Zhang

The shortest path algorithm is critical for dynamic traffic assignment and for the realization of route guidance in intelligent transportation systems (ITS). In this paper, a hybrid Particle Swarm Optimization (PSO) algorithm combined fluid neural network (FNN) to search for the shortest path in stochastic traffic networks is introduced. The algorithm overcomes the weight coefficient symmetry restrictions of the traditional FNN and disadvantage of easily getting into a local optimum for PSO algorithm. Simulation experiments have been carried out on different traffic network topologies consisting of 15-70 nodes and the results showed that the proposed approach can find the optimal path with good success rates and also can find closer sub-optimal paths with high success ratio for all the tested traffic networks. At the same time, the hybrid algorithms improve greatly the efficiency of the convergence of the fluid neuron network, and decrease the computation time of optimization path.must

Published in:

2010 Sixth International Conference on Natural Computation  (Volume:5 )

Date of Conference:

10-12 Aug. 2010