dynamic shortest path algorithm in stochastic traffic networks using pso based on fluid neural network在随机交通网络动态最短路径算法使用基于流体神经网络算法.pdfVIP

下载本文档

2
0
约3.97万字
约 6页
2017-08-28 发布于上海
举报
版权申诉

dynamic shortest path algorithm in stochastic traffic networks using pso based on fluid neural network在随机交通网络动态最短路径算法使用基于流体神经网络算法.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

dynamic shortest path algorithm in stochastic traffic networks using pso based on fluid neural network在随机交通网络动态最短路径算法使用基于流体神经网络算法

Journal of Intelligent Learning Systems and Applications, 2011, 3, 11-16 11 doi:10.4236/jilsa.2011.31002 Published Online February 2011 (http://www.SciRP.org/journal/jilsa) Dynamic Shortest Path Algorithm in Stochastic Traffic Networks Using PSO Based on Fluid Neural Network Yanfang Deng, Hengqing Tong School of Science, Wuhan University of Technology, Wuhan, China Email: dengyf@, tonghq2005@ Received March 23rd, 2010; revised June 23rd, 2010; accepted September 10th, 2010 ABSTRACT The shortest path planning issure is critical for dynamic traffic assignment and route guidance in intelligent transporta- tion 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 topolo- gies 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. Keywords : Particle Swarm Optimization, Fluid Neuron Network, Shortest Path, Traffic Networks 1. Introduction The well-known algorithms including the Bellman’s dy- namic programming algorithm [3], the Dijkstra algorithm In recent years there has been a resurgence of interest in [4] and Bellman-Ford successive algorithm [5]