We proposes a novel routing decisions method based on comprehensive trust value to solve the multi-source heterogeneous data routing problem in the smart city. The method combines four parameters-trust value, intensit...
详细信息
We proposes a novel routing decisions method based on comprehensive trust value to solve the multi-source heterogeneous data routing problem in the smart *** method combines four parameters--trust value,intensity,noda...
详细信息
ISBN:
(纸本)9781467397155
We proposes a novel routing decisions method based on comprehensive trust value to solve the multi-source heterogeneous data routing problem in the smart *** method combines four parameters--trust value,intensity,nodal pitch and forward capability--to work out information backtrack issue in the routing decisions *** the statistical analysis,we obtain indirect trust value and direct trust value and present a comprehensive trust evaluation ***,the cluster node selection method is *** results show that the established trust value model is considerably reliable,and with the increase of cycle number,the trust value gradually tends to *** comparison with original algorithm and dijkstra algorithm,this algorithm improves convergence speed largely and is stable when in the information transfer *** the network topology changes,this algorithm can do fast *** shows that the algorithm has a significant effect in smart city data routing.
The shortest path is one of the main problems appeared in application of *** to the character of depot network management,it put forward the optimized algorithm of the shortest path based on the dijkstra algorithm,rea...
详细信息
The shortest path is one of the main problems appeared in application of *** to the character of depot network management,it put forward the optimized algorithm of the shortest path based on the dijkstra algorithm,realized the quick search of the shortest *** was used properly to choose of practical path and make the whole system have a better practicability.
To research the optimal path problem in wireless sensor network (WSN), Genetic algorithms, Differential Evolution, Particle Swarm Optimization and dijkstra algorithm are used in this study. Experimental comparisons sh...
详细信息
ISBN:
(纸本)9781509023967
To research the optimal path problem in wireless sensor network (WSN), Genetic algorithms, Differential Evolution, Particle Swarm Optimization and dijkstra algorithm are used in this study. Experimental comparisons show that the different algorithms may represent obvious difference under different network size. During small-scale network, the dijkstra algorithm needs the least run time and obtains the highest success rate to find optimal solutions. However, the Differential Evolution and Particle Swarm Optimization provide the better performance than dijkstra algorithm under big-scale network. In a word, dijkstra algorithm and Differential Evolution show up better performance and greater adaptability among the above algorithms, respectively.
The shortest path is one of the main problems appeared in application of GIS. According to the character of depot network management, it put forward the optimized algorithm of the shortest path based on the dijkstra A...
详细信息
The shortest path is one of the main problems appeared in application of GIS. According to the character of depot network management, it put forward the optimized algorithm of the shortest path based on the dijkstra algorithm, realized the quick search of the shortest path. It was used properly to choose of practical path and make the whole system have a better practicability.
The minimum vertex cover problem is a basic combinatorial optimization problem. Given an undirected graph the objective is to determine a subset of the vertices which covers all edges such that the number of the verti...
详细信息
The minimum vertex cover problem is a basic combinatorial optimization problem. Given an undirected graph the objective is to determine a subset of the vertices which covers all edges such that the number of the vertices in the subset is minimized. In the paper, based on dijkstra algorithm, an approximation algorithm is obtained for the minimum vertex cover problem. In the process of getting a vertex cover, the maximum value of shortest paths is considered as a standard, and some criteria are defined. The time complex of the algorithm is O ( n 3) where n is the number of vertices in a graph. In the end, an example is given to illustrate the process and the validity of the algorithm.
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.
This paper gives a detailed analysis of the existing city shortest path algorithm[1], aiming at the high time complexity and can not represent the real situation of the problem of the existing city shortest path selec...
详细信息
This paper gives a detailed analysis of the existing city shortest path algorithm[1], aiming at the high time complexity and can not represent the real situation of the problem of the existing city shortest path selection algorithm, and bases on the idea of dijkstra algorithm, puts forwarda fast algorithm of optimal path of the cityThis algorithm can be considered to simulate the real situation may in the road grade, the degree of congestion, traffic light quantity and other factors, at the same time can be optimized in the time complexity of the algorithm, to achieve the shortest path fast searchThe experimental results show that this method can simulate the real situation in as far as possible under the condition, reduces the time complexity of the algorithm, and get feasible result.
The combinatorial optimization problem of university classroom schedule assignments is formulated using multiagent simulation and genetic algorithms in the evaluation and optimization process. The method we propose co...
详细信息
The combinatorial optimization problem of university classroom schedule assignments is formulated using multiagent simulation and genetic algorithms in the evaluation and optimization process. The method we propose consists of global and local multiagent planning. Conventional global planning requires setting subgoals manually, which became a bottleneck in optimization. To solve this problem, a multi-resolution dijkstra method for selected autonomously, assuming eight classrooms as a real University of Tsukuba building and 250 agents, we confirmed the effectiveness of the proposed multi-resolution dijkstra's algorithm as for both global and local route selections, compared to the uniform dijkstra's method.
This paper presents a method for incremental updating on consumer electronic devices, called differential compression based on dijkstra algorithm (DDIFF). It describes the similarities between the old and new versions...
详细信息
This paper presents a method for incremental updating on consumer electronic devices, called differential compression based on dijkstra algorithm (DDIFF). It describes the similarities between the old and new versions as a directed weighted graph. In the graph, the shortest path between the start and end vertices corresponds to the minimal delta. As a result, the delta-encoding problem is reduced to the single-source shortest path problem. Experiments show that the proposed method is feasible, and average data transmission saving is as high as 69.3%. In comparison with the existing methods, DDIFF constructs the minimal patch, and the patch costs less time to apply(1).
暂无评论