The shortcomings of traditional methods to find the shortest path are revealed, and a strategy of finding the self- organizing shortest path based on thermal flux diffusion on complex networks is presented. In our met...The shortcomings of traditional methods to find the shortest path are revealed, and a strategy of finding the self- organizing shortest path based on thermal flux diffusion on complex networks is presented. In our method, the shortest paths between the source node and the other nodes are found to be self-organized by comparing node temperatures. The computation complexity of the method scales linearly with the number of edges on underlying networks. The effects of the method on several networks, including a regular network proposed by Ravasz and Barabasi which is called the RB network, a real network, a random network proposed by Ravasz and Barabasi which is called the ER network and a scale-free network, are also demonstrated. Analytic and simulation results show that the method has a higher accuracy and lower computational complexity than the conventional methods.展开更多
Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The alg...Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The algorithm takes advantage of the adjacent link and the mechanism of bidirectional search, that is, the algorithm processes the positive search from start point to destination point and the negative search from destination point to start point at the same time. Finally, combining with the practical application of route-planning algorithm in embedded real-time vehicle navigation system (ERTVNS), one example of its practical applications is given, analysis in theory and the experimental results show that compared with the Dijkstra algorithm, the new algorithm can reduce time complexity, and guarantee the searching precision, it satisfies the needs of ERTVNS.展开更多
In this paper, the open queueing network model is proposed for solving the problem of public transportation in cities. The vertices of the networks(i.e., the bus stops) are determined by means of the fuzzy clusteri...In this paper, the open queueing network model is proposed for solving the problem of public transportation in cities. The vertices of the networks(i.e., the bus stops) are determined by means of the fuzzy clustering method. The arcs (i.e., the paths of the public transportation) can be set up by using the shortest path model in the time sense or the 0 1 integer programming method.Applying the statistics method, we can calculate the parameters(such as the passenger flow's distribution, passenger flow's transition probability, mean waiting time for the bus etc. ) of the public transportation network. In this paper, we suggest to divide the network into two or three stages to implement the public transportation system in the form of ``frog jumping' fast transfer and ``permeation' fast dispersion.Combining the computer simulation and the evaluation of the achievement and effect of public transportation system, we modify the model so as to solve the public transportation problem better.展开更多
基金supported by the National Natural Science Foundation of China (Grant No 60672095)the National High-Tech Research and Development Program of China (Grant No 2007AA11Z210)+3 种基金the Doctoral Fund of Ministry of Education of China (Grant No 20070286004)the Natural Science Foundation of Jiangsu Province,China (Grant No BK2008281)the Science and Technology Program of Southeast University,China (Grant No KJ2009351)the Excellent Young Teachers Program of Southeast University,China (Grant No BG2007428)
文摘The shortcomings of traditional methods to find the shortest path are revealed, and a strategy of finding the self- organizing shortest path based on thermal flux diffusion on complex networks is presented. In our method, the shortest paths between the source node and the other nodes are found to be self-organized by comparing node temperatures. The computation complexity of the method scales linearly with the number of edges on underlying networks. The effects of the method on several networks, including a regular network proposed by Ravasz and Barabasi which is called the RB network, a real network, a random network proposed by Ravasz and Barabasi which is called the ER network and a scale-free network, are also demonstrated. Analytic and simulation results show that the method has a higher accuracy and lower computational complexity than the conventional methods.
文摘Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The algorithm takes advantage of the adjacent link and the mechanism of bidirectional search, that is, the algorithm processes the positive search from start point to destination point and the negative search from destination point to start point at the same time. Finally, combining with the practical application of route-planning algorithm in embedded real-time vehicle navigation system (ERTVNS), one example of its practical applications is given, analysis in theory and the experimental results show that compared with the Dijkstra algorithm, the new algorithm can reduce time complexity, and guarantee the searching precision, it satisfies the needs of ERTVNS.
文摘In this paper, the open queueing network model is proposed for solving the problem of public transportation in cities. The vertices of the networks(i.e., the bus stops) are determined by means of the fuzzy clustering method. The arcs (i.e., the paths of the public transportation) can be set up by using the shortest path model in the time sense or the 0 1 integer programming method.Applying the statistics method, we can calculate the parameters(such as the passenger flow's distribution, passenger flow's transition probability, mean waiting time for the bus etc. ) of the public transportation network. In this paper, we suggest to divide the network into two or three stages to implement the public transportation system in the form of ``frog jumping' fast transfer and ``permeation' fast dispersion.Combining the computer simulation and the evaluation of the achievement and effect of public transportation system, we modify the model so as to solve the public transportation problem better.
