An Optimization Method of SNNs for Shortest Path Problem
In this paper we propose a new optimization method of integrate-and-fire neural model for shortest path problem and compare it with Dijkstra algorithm. The proposed algorithm improves the speed of path planning by parallel property of spike spreading in the network and makes efficiency independent from the number of connections of the network which is only related to the length of the shortest path in the network with determined number of edges. Mathematical analysis and simulations demonstrate that planing shortest path by utilizing connections between transmission time in integrate-and-fire model and edge weights is feasible. The comparisons with Dijkstra algorithm manifest that the new algorithm does have superiority in some application scenarios.
KeywordsShortest path problem Spike spreading Integrate-and-fire model
Unable to display preview. Download preview PDF.
- 2.Yan, G., Zhou, T., Hu, B., Fu, Z.Q., Wang, B.H.: Efficient routing on complex networks. Physical Review E 73(4), 046108 (2006)Google Scholar
- 3.Alazab, A., Venkatraman, S., Abawajy, J., Alazab, M.: An optimal transportation routing approach using GIS-based dynamic traffic flows. In: ICMTA 2010: Proceedings of the International Conference on Management Technology and Applications, pp. 172–178. Research Publishing Services (2010)Google Scholar
- 4.Xi, Y., Schwiebert, L., Shi, W.: Privacy preserving shortest path routing with an application to navigation. Pervasive and Mobile Computing (2013)Google Scholar
- 8.Fuhao, Z., Jiping, L.: An algorithm of shortest path based on Dijkstra for huge data. In: Sixth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2009, vol. 4, pp. 244–247. IEEE (August 2009)Google Scholar
- 13.GMaass, W., Bishop, C.M. (eds.): Pulsed neural networks. MIT Press (2001)Google Scholar