Dynamic Shortest Path Algorithm in Stochastic Traffic Networks Using PSO Based on Fluid Neural Network

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

[1]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[2]  Iordanis Kerenidis,et al.  Weak coin flipping with small bias , 2004 .

[3]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..

[4]  Faouzi Kamoun,et al.  Neural networks for shortest path computation and routing in computer networks , 1993, IEEE Trans. Neural Networks.

[5]  G. Lei.  A neuron model with fluid properties for solving labyrinthian puzzle , 1990, Biological Cybernetics.

[6]  Emmanuel Dotaro,et al.  Routing foreseeable lightpath demands using a tabu search meta-heuristic , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[7]  Yang Zhaosheng,et al.  Study on the shortest path algorithm based on fluid neural network of in-vehicle traffic flow guidance system , 1999, Proceedings of the IEEE International Vehicle Electronics Conference (IVEC'99) (Cat. No.99EX257).

[8]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[9]  Donald E. Grierson,et al.  Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

[10]  Bryant A. Julstrom,et al.  A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem , 2000, SAC '00.

[11]  A. Goldberg,et al.  A heuristic improvement of the Bellman-Ford algorithm , 1993 .

[12]  Kozo Okazaki,et al.  A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network , 2009, Soft Comput..

[13]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[14]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[15]  Yuanwei Jing,et al.  Traffic dynamics based on the shortest path routing strategy , 2009, 2009 Chinese Control and Decision Conference.

[16]  FuL.,et al.  Heuristic shortest path algorithms for transportation applications , 2006 .

[17]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[18]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[19]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[20]  C. Mouser,et al.  Comparing genetic algorithms and particle swarm optimisation for an inverse problem exercise , 2005 .

[21]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[22]  Laurence R. Rilett,et al.  Heuristic shortest path algorithms for transportation applications: State of the art , 2006, Comput. Oper. Res..