Since the number of private cars in cities is growing increasingly and the phenomenon of traffic jams is more and more severe,how to utilize the current road network and improve the transportation efficiency more rati...
详细信息
Since the number of private cars in cities is growing increasingly and the phenomenon of traffic jams is more and more severe,how to utilize the current road network and improve the transportation efficiency more rational has become a research which highlights in today's academic world. With regard to this issue,Beijing ring road traffic system is taken as the model in this paper,what's more,a new dynamic route guidance algorithm is proposed to provide the humanized"optimal route"for the *** study builds a graph theory model of road network for Beijing ring road traffic system,and realizes the optimal route of calculation by classic dijkstra ***,based on the particularity of ring road traffic city,the study improves the calculation priority of ring road node in dijkstra algorithm. Compared with traditional dijkstra algorithm,the time complexity of this new algorithm decreases to 1/16k（k equals to the number of ring road in the road network）.In addition, when referring to control the middle and long distance of route guidance,the extra miles is less than 5%,which effectively promotes the algorithm practicability on large-scale ring road network.
We consider the security problems in dijkstra caused by routing on the vulnerable communication links. This work employs a SDN framework to mitigate the vulnerable links while maintaining satisfactory QoS request. SDN...
详细信息
ISBN:
(纸本)9781450384957
We consider the security problems in dijkstra caused by routing on the vulnerable communication links. This work employs a SDN framework to mitigate the vulnerable links while maintaining satisfactory QoS request. SDN is able to maintain an overall network awareness, through which a controller is capable of optimizing routing based on metrics of safety interest. A lot of useful link information, like link type, link ownership, interface bandwidth, transition delay and historical record, can be collected and computed by the SDN controller to enable more safe, reliable and efficient paths. In this way, we can consider the varying delay status of the communication network along with other network security parameters and get a presence of a passive/active adversary in the network routing area. The implement and experiment indicate that QS-dijkstra algorithm is able to minimize traffic routing through vulnerable links while satisfying the QoS constraints of the network.
The optimal path selection is a practical problem, and the application frequency in daily life is very high, which has practical research significance. The dijkstra algorithm is one of the most classical algorithms in...
详细信息
The optimal path selection is a practical problem, and the application frequency in daily life is very high, which has practical research significance. The dijkstra algorithm is one of the most classical algorithms in the algorithm of optimal path selection. It is also the theoretical basis of many experimental designs when solving the optimal path problem. When the traditional dijkstra algorithm calculates and selects the optimal path between nodes, a large number of nodes need to be calculated. The selection of the optimal path will be affected by many conditions. In the actual application, the selection conditions will often present multiple different priority conditions and comprehensive influence path selection. In this paper, the optimization algorithm is implemented and verified by experiments and practical applications.
Aiming at the problem of the shortest path's optimization for direct navigation of ships, the dijkstra algorithm search is improved. The environment of the ship's navigation area was modeled by rasterization a...
详细信息
ISBN:
(纸本)9781728158556
Aiming at the problem of the shortest path's optimization for direct navigation of ships, the dijkstra algorithm search is improved. The environment of the ship's navigation area was modeled by rasterization and swelling. Then the four-direction search,eight-direction search and arbitrary-angle search based on the dijkstra algorithm were improved, and the three search methods were compared. Simulation experiments and research results show that the improved arbitrary angle search method can best meet the requirement of the shortest direct flight path.
In large or medium retail enterprises, the downstream of the supply chain is usually composed by distribution centers or various warehouses. Since the distance of each distribution route is large, so the optimization ...
详细信息
ISBN:
(纸本)9781479983537
In large or medium retail enterprises, the downstream of the supply chain is usually composed by distribution centers or various warehouses. Since the distance of each distribution route is large, so the optimization of path is very important for the cost control and profit maximization of the enterprise. This paper uses dijkstra algorithm to solve the shortest path problem, and uses the method of map labeling, simplifying the solving process Finally through the abstracting model of the problem, and designing of structure and combining with the process oriented C language, the paper realizes this function.
In this paper is proposed a discrete ray tracing method by using dijkstra algorithm (DA) for electromagnetic field computation in complicated environments. The computational space is divided in terms of regularly arra...
详细信息
ISBN:
(纸本)9781509024612
In this paper is proposed a discrete ray tracing method by using dijkstra algorithm (DA) for electromagnetic field computation in complicated environments. The computational space is divided in terms of regularly arrayed rectangular solids with eight apex nodes for each rectangular solid. Connectivity of one node with others is allowed among twenty-six proximate nodes and the link costs between them is given by the traveling time of optical ray. The proposed DA procedures are classified into two stages. The first one treats source diffraction rays including incident rays, and the second one deals with image diffraction rays including reflection rays. Numerical examples show how the two types of diffraction rays, such as incident rays on floor or walls and reflection from there, can be traced from DA data in order to demonstrate the effectiveness of the present method.
In order to better solve the path planning problem, our paper extends the two-dimensional path planning to three-dimensional *** spatial modeling method based on the surface model rasterizes the three-dimensional spac...
详细信息
ISBN:
(纸本)9781728176871
In order to better solve the path planning problem, our paper extends the two-dimensional path planning to three-dimensional *** spatial modeling method based on the surface model rasterizes the three-dimensional space for environmental modeling, and by improving the dijkstra algorithm, the diagonal search and the linear search at any angle are designed. Experiments show that the linear search can effectively plan the optimal path.
This paper presents the integration of dijkstra's algorithm into a Blackboard framework to optimize the selection of web resources from service providers. The architectural framework of the implementation of the p...
详细信息
ISBN:
(纸本)9783319937137;9783319937120
This paper presents the integration of dijkstra's algorithm into a Blackboard framework to optimize the selection of web resources from service providers. The architectural framework of the implementation of the proposed Blackboard approach and its components in a real life scenario is laid out. For justification of approach, and to show practical feasibility, a sample implementation architecture is presented.
Wireless sensor networks (WSNs) consist of several wireless sensor nodes which have limited transmission power and processing capabilities. Hierarchical cluster-based routing protocols are considered an efficient tech...
详细信息
ISBN:
(纸本)9781538658963
Wireless sensor networks (WSNs) consist of several wireless sensor nodes which have limited transmission power and processing capabilities. Hierarchical cluster-based routing protocols are considered an efficient technique to route data from sensor nodes to base station. This paper proposes a scheme which considers K-means clustering in cluster formation phase and calculates a weight function for the cluster head selection process. Moreover, it considers an optimal fixed packet size with respect to radio parameters and channel conditions of the transceiver. In data transmission phase, it implements a multiobjective weight function as a link cost using traditional dijkstra algorithm. This technique results in balanced and efficient energy consumption of nodes within the network. Simulation results show that proposed scheme is better than the CERP and TEEN routing protocol in terms of energy conservation of nodes in the network and increases the throughput of the overall system. It also indicates high scalability and packet delivery rate due to the efficient use of energy in the system.
dijkstra algorithm is a classic algorithm of computing the shortest path between two points. In past the amount of urban vehicles is small, so the shortest path is the optimal one. However, with the increasing of cars...
详细信息
ISBN:
(纸本)9781479969890
dijkstra algorithm is a classic algorithm of computing the shortest path between two points. In past the amount of urban vehicles is small, so the shortest path is the optimal one. However, with the increasing of cars, traffic congestion is serious. The path calculated by using traditional dijkstra is still the shortest path, but it is not necessarily the optimal. Therefore, in order to solve the optimal route choice problem the improved dijkstra algorithm is put forward, which introduces traffic congestion weight function. Experiments show that the improved dijkstra algorithm can better meet the needs of drivers on the optimal path.
暂无评论