检索结果-南通市图书馆

Application of dijkstra algorithm to Proposed Tramway of a Potential World Class University

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Applied Mathematics 2016年第6期7卷 496-503页

作者： M. C. Agarana N. C. Omoregbe M. O. Ogunpeju Department of Mathematics Covenant University Ota Nigeria Department of Computer and Information Science Covenant University Ota Nigeria

Nowadays, the development of “smart cities” with a high level of quality of life is becoming a prior challenge to be addressed. In this paper, promoting the model shift in railway transportation using tram network towards more reliable, greener and in general more sustainable transportation modes in a potential world class university is proposed. “Smart mobility” in a smart city will significantly contribute to achieving the goal of a university becoming a world class university. In order to have a regular and reliable rail system on campus, we optimize the route among major stations on campus, using shortest path problem dijkstra algorithm in conjunction with a computer software called LINDO to arrive at the optimal route. In particular, it is observed that the shortest path from the main entrance gate (Canaan land entrance gate) to the Electrical Engineering Department is of distance 0.805 km.

关键词： Potential World Class University Optimization dijkstra algorithm Shortest Path Tramway

Design and Implementation of Bidirectional dijkstra algorithm

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Beijing Institute of Technology 2003年第4期12卷 366-370页

作者：付梦印李杰周培德 Department of Automatic Control Department of Computer Science and Engineering

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.

关键词： vehicle navigation system route-planning the shortest path dijkstra algorithm bidirectional dijkstra algorithm

Research on the Optimization and Simulation of the Shortest Path Based on algorithm of dijkstra

在线全文

学校读者我要写书评

暂无评论

Journal of Measurement Science and Instrumentation 2010年第S1期1卷 199-201,37页

作者： Chuan-xiang REN,Xin-gang HAO,Ying-rui WANG, Guang-hui PAN (College of Information and Electrical Engineering,Shandong University of Science and Technology,Qingdao 266510,China) College of Information and Electrical Engineering Shandong University of Science and Technology

dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved dijkstra algorithm is *** apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.

关键词： route optimization dijkstra algorithm fast sorting algorithm adjacency list and circular linked list

A Novel Method for Discrete Evidence Fusion Based on dijkstra Shortest Path algorithm

在线全文

学校读者我要写书评

暂无评论

A Novel Method for Discrete Evidence Fusion Based on Dijkstr...

Application of rough graph in relationship mining

第32届中国控制与决策会议

作者： Bo Liu Yang Yang Xinyang Deng Science and Technology on Avionics Integration Laboratory School of Electronics and Information Northwestern Polytechnical University

Discrete evidence generally exists in the fields of expert systems,pattern recognition,and decision *** to solve the fusion of discrete evidence is an open *** order to solve the problem that the number of calculations increases exponentially with the increase of the number of discrete evidences,a method for calculating the shortest path based on dijkstra is ***,the normalized discrete evidence is decomposed into the exact value of the evidence as far as possible,and then the Jousselme distance between the two pairs of evidence between the evidence groups is *** Jousselme distance is designed to measure the conflict between the *** the dijkstra shortest path algorithm is used to find the path with the largest and smallest Jousselme *** path here indicates the discrete evidence group with the largest fusion distance and smallest fusion *** use Dempster combination to fuse the evidence after weighted average and give the interval value of ***,two groups discrete evidence are given for verification to illustrate the rationality and effectiveness of the method.

关键词： Discrete evidence dijkstra algorithm Jousselme distance Dempster combination

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2008年第4期19卷 742-747页

作者： He Tong Xue Peijun Shi Kaiquan School of Mathematics and System Sciences Shandong Univ. Jinan 250100 P. R. China

Based on the definition of class shortest path in weighted rough graph, class shortest path algorithm in weighted rough graph is presented, which extends classical shortest path algorithm. The application in relations... 详细信息

关键词： rough graph weighted rough graph class shortest path dijkstra algorithm relationship mining

Multi-depots distribution problem study based on rich network road model

在线全文

学校读者我要写书评

暂无评论

Multi-depots distribution problem study based on rich networ...

The Method Based On dijkstra Of Multi-directional Ship’s Path Planning

第25届中国控制与决策会议

作者： Chunlong Yao Guijun Zhang Beijin Zhang Siheng Zhong College of Information Engineering Zhejiang University of Technology

ISBN: (纸本)9781467355339

The multi-depots distribution logistic is a particular combination of transportation and routing problems, in which items that have to be loaded into different customers within vehicles, and then delivered with minimum cost. In this paper, a model is built firstly and the weights between the target nodes are acquired based on actual network road by branch-and-cut and dijkstra algorithms;Next, the idea of the evolutionary tree classification is used to solve the nonlinear cost variables in the distribution model. Extensive computational results show that the proposed algorithm are capable of solving to optimality for a large number of small-size instances, and consistently outperform previous algorithms from the literature on large-size and real-world instances.

关键词： rich network model dijkstra algorithm linear programming path optimal time optimal

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

The Method Based On Dijkstra Of Multi-directional Ship’s Pa...

Optimal path planning method of electric vehicles considering power supply

第32届中国控制与决策会议

作者： Zihui Cheng Huajun Zhang Qin Zhao Automated Institute Wuhan University of Technology

Aiming at the problem of the shortest path’s optimization for direct navigation of ships,the dijkstra algorithm search is *** environment of the ship’s navigation area was modeled by rasterization and *** the four-direction search,eight-direction search and arbitrary-angle search based on the dijkstra algorithm were improved,and the three search methods were *** experiments and research results show that the improved arbitrary angle search method can best meet the requirement of the shortest direct flight path.

关键词： Path optimization Grid method Puffing process dijkstra algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Central South University 2022年第1期29卷 331-345页

作者： GUO Dong LI Chao-chao YAN Wei HAO Yu-jiao XU Yi WANG Yu-qiong ZHOU Ying-chao E Wen-juan ZHANG Tong-qing GAO Xing-bang TAN Xiao-chuan School of Transportation and Vehicle Engineering Shandong University of TechnologyZibo 255000China School of Rail Transportation Soochow UniversitySuzhou 215000China

Because of the limitations of electric vehicle(EV)battery technology and relevant supporting facilities,there is a great risk of breakdown of EVs during *** resulting driver“range anxiety”greatly affects the travel quality of *** limitations should be overcome to promote the use of *** this study,a method for travel path planning considering EV power supply was ***,based on real-time road conditions,a dynamic energy model of EVs was established considering the driving energy and accessory ***,a multi-objective travel path planning model of EVs was constructed considering the power supply,taking the distance,time,energy,and charging cost as the optimization ***,taking the actual traffic network of 15 km×15 km area in a city as the research object,the model was simulated and verified in MATLAB based on dijkstra shortest path *** simulation results show that compared with the traditional route planning method,the total distance in the proposed optimal route planning method increased by 1.18%,but the energy consumption,charging cost,and driving time decreased by 11.62%,41.26%and 11.00%,respectively,thus effectively reducing the travel cost of EVs and improving the driving quality of EVs.

关键词： electric vehicle vehicle special power charging path multi-objective optimization dijkstra algorithm

Optimal path finding algorithms based on SLSD road network model

在线全文

学校读者我要写书评

暂无评论

Journal of Southeast University(English Edition) 2010年第4期26卷 558-562页

作者：张小国王庆龚福祥东南大学仪器科学与工程学院南京210096

A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is *** the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network ***,a road node is abstracted as the linkage of two ordered single-directional *** model can describe turn restrictions,circular roads,and other real scenarios usually described using a *** a computing framework for optimal path finding（OPF）is *** is proved that classical dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD ***,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.

关键词： optimal path finding road network model conceptual model digital map vehicle navigation system A algorithm dijkstra algorithm