Author:
Ismailov Mirxalil,Ziyadullaev Davron,Muhamediyeva Dilnoz,Gazieva Rano,Dzholdasbaeva Aksulu,Aynaqulov Sharofiddin
Abstract
Today, in public transport planning systems, it is relevant to a search for a possible route with a minimum time. The aim of the work is the development of intelligent algorithms for constructing public transport routes, the development of programs, and the conduct of a computational experiment. Research methods are the theory of neural networks. The paper considers Hopfield neural networks and proposed recurrent neural networks. However, in Hopfield neural networks, the chances of solving this optimization problem decrease as the matrix size increases. A recurrent neural network is proposed, represented by a differential equation to solve this problem. As a result, the number of iterative computations can be reduced by n2 times than in the Hopfield network.
Reference20 articles.
1. Muller-Hannemann M., Schulz F., Wagner D., and Zaroliagis C., Algorithmic methods for railway optimization. Lecture Notes in Computer Science, vol. 4359, Timetable Information: Models and Algorithms, pp. 67–90, Springer Berlin / Heidelberg, September 2007.
2. Time depending shortest-path problems with applications to railway networks
3. Pyrga E., Schulz F., Wagner D., and Zaroliagis C., Experimental comparison of shortest path approaches for timetable information. Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments (ALENEX), SIAM, 2004, pp. 88–99.
4. All pairs shortest paths using bridging sets and rectangular matrix multiplication
5. Hagerup T., Improved. Shortest Paths in the Word RAM, 27th Int. Colloq. on Automata, Languages and Programming, Geneva, Switzerland, 2000, pp. 61–72.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献