N. R. Raidl and B. A. Julstrom, “A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem,” Proceedings of the 2000 ACM Symposium on Applied Computing, Como, 2000. doi:10. 1145/335603.335888

has been cited by the following article:

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

  AUTHORS: Yanfang Deng, Hengqing Tong

  KEYWORDS: Particle Swarm Optimization, Fluid Neuron Network, Shortest Path, Traffic Networks

  JOURNAL NAME: Journal of Intelligent Learning Systems and Applications, Vol.3 No.1, February 24, 2011

  ABSTRACT: 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.