检索结果-内蒙古大学图书馆

THE WEIGHTED REGION PROBLEM - FINDING SHORTEST PATHS THROUGH A WEIGHTED PLANAR SUBDIVISION

JOURNAL OF THE ACM 1991年第1期38卷 18-73页

作者： MITCHELL, JSB PAPADIMITRIOU, CH HUGHES AIRCRAFT CO HUGHES ARTIFICIAL INTELLIGENCECULVER CITYCA 90230 STANFORD UNIV STANFORDCA 94305 UNIV CALIF SAN DIEGO DIV COMP SCILA JOLLACA 92093

The problem of determining shortest paths through a weighted planar polygonal subdivision with n vertices is considered. Distances are measured according to a weighted Euclidean metric: The length of a path is defined to be the weighted sum of (Euclidean) lengths of the subpaths within each region. An algorithm that constructs a (restricted) "shortest path map" with respect to a given source point is presented. The output is a partitioning of each edge of the subdivision into intervals of epsilon-optimality, allowing an epsilon-optimal path to be traced from the source to any query point along any edge. The algorithm runs in worst-case time O(ES) and requires O(E) space, where E is the number of "events" in the algorithm and S is the time it takes to run a numerical search procedure. In the worst case, E is bounded above by O(n4) (and we give an OMEGA(n4) lower bound), but it is likely that E will be much smaller in practice. We also show that S is bounded by O(n4L), where L is the precision of the problem instance (including the number of bits in the user-specified tolerance epsilon). Again, the value of S should be much smaller in practice. The algorithm applies the "continuous dijkstra" paradigm and exploits the fact that shortest paths obey Snell's Law of Refraction at region boundaries, a local optimality property of shortest paths that is well known from the analogous optics model. The algorithm generalizes to the multi-source case to compute Voronoi diagrams.

关键词： algorithmS THEORY dijkstra algorithm SHORTEST PATHS TERRAIN NAVIGATION VORONOI DIAGRAMS WEIGHTED DISTANCE FUNCTIONS

来源：评论

学校读者我要写书评

暂无评论

The Optimal Path algorithm Analysis of GPS Navigation in Taxi Management System Based on A＊ algorithm

引用

International English Education Research 2013年第12期 10-12页

The optimal path algorithm analysis of GPS navigation in taxi management system based on A＊ algorithm was introduced in this paper. Through improving the traditional dijkstra algorithm and avoiding problems such as ＂time-consuming and low efficiency＂ in dijkstra algorithm with traversal search for each node, A＊ algorithm could help the taxi find the optimal path and bring convenience for traffic management.

关键词： GPS navigation A＊ algorithm dijkstra algorithm the optimal path

来源：评论

学校读者我要写书评

暂无评论

Routing Protocol based on Floyd-Warshall algorithm Allowing Maximization of Throughput

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2020年第6期11卷 436-441页

作者： Arai, Kohei Saga Univ Grad Sch Sci & Engn Saga Japan

Routing protocol based on Floyd-Warshall algorithm which allows maximization of throughput is proposed. The metric function in the proposed routing protocol is throughput including not only send packets but also retransmission packets in order for improving effectiveness and efficiency of the network in concern. Through simulation studies, it is found that the proposed routing protocol is superior to the conventional Open Shortest Path First: OSPF based on dijkstra algorithm for shortest path determination from the point of view of maximizing throughput. A routing protocol for Virtual Private Network (VPN) in Autonomous System (AS) based on maximizing throughput is proposed. Through a comparison between the proposed protocol and the existing protocols, OSPF (Widely used), it is also found that the required time for transmission of packets from one node to another node of the proposed protocol is 56.54% less than that of the OSPF protocol.

关键词： Network routing protocol virtual private network autonomous system open shortest path first Floyd-Warshall algorithm dijkstra algorithm throughput

来源：评论

学校读者我要写书评

暂无评论

Optimal path in two and three dimensions

引用

Physical Review E 1998年第6期58卷 7642-7642页

作者： Nehemia Schwartz Alexander L. Nazaryev Shlomo Havlin Minerva Center and Department of Physics Jack and Pearl Resnick Institute of Advanced Technology Building Bar-Ilan University 52900 Ramat-Gan Israel

We apply the dijkstra algorithm to generate optimal paths between two given sites on a lattice representing a disordered energy landscape. We study the geometrical and energetic scaling properties of the optimal path where the energies are taken from a uniform distribution. Our numerical results for both two and three dimensions suggest that the optimal path for random uniformly distributed energies is in the same universality class as the directed polymers. We present physical realizations of polymers in a disordered energy landscape for which this result is relevant.

关键词： .sites disordered assigned realizations energy landscape universality class optimal paths Directed polymers Cieplak dijkstra algorithm uniform distribution distributed energies d-dimensional energy value

来源：评论

学校读者我要写书评

暂无评论

Orthogonal Analysis of the Weights based on the Factors Influencing the Total Time of Community Opening

Orthogonal Analysis of the Weights based on the Factors Infl...

引用

2017 2nd International Conference on Education,Sports,Arts and Management Engineering(ICESAME 2017)

作者： Zengji Wang School of North China Electric Power University

According to the urban planning and construction, open community becomes more and more popular in recent years. However, the study of the impact of people on the travel after the opening of the community is not deep. Moreover, the impact of each factor on the degree of travel is not the same. Therefore, this paper takes the total travel time of the crowd as the total index and the free flow time in the district, the influence coefficient of the internal road delay, the free flow time of the external roads, the influence coefficient of the external road delay, the intersection delay time as the five influencing factors of the index. Then we use dijkstra algorithm getting the simulation data and carry out two levels of seven factors orthogonal test. Later we use the range analysis method to get the weight. Furthermore, the influence degree of each factor on travel time is obtained.

关键词： community opening orthogonal analysis factors' weight dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of distribution routing optimization for warehousing logistics based on GIS

Design and implementation of distribution routing optimizati...

引用

2014 International Conference on Remote Sensing and Smart City(RSSC2014)

作者： Z.C.Zhang School of Management Science and Engineering Guangxi University of Finance and Economics

ISBN: (纸本)9781784660291

To improve the logistics service level and reduce the cost of logistics distribution, this paper focuses on the optimization problem of logistics distribution route. Firstly, common Vehicle Routing Problem(VRP) solving methods are analyzed. Then, by means of the powerful spatial geographic information and data processing ability of Geographic Information System(GIS) technology, dijkstra algorithm is implemented and its result is taken as the initial value to implement C-W saving mileage algorithm in GIS environment. Logistics distribution route optimization scheme is designed, and the optimization of distribution route is directly output in the electronic map. The visual output control for warehousing and distribution management is thus realized.

关键词： vehicle routing problem geographic information system distribution routing optimization dijkstra algorithm C-W saving mileage algorithm

来源：评论

学校读者我要写书评

暂无评论

Taxi Intelligent Dispatch System Based On GPS

Taxi Intelligent Dispatch System Based On GPS

引用

2013 International Conference on Civil,Materials and Environmental Sciences(CMES 2013)

作者： Zhongmin Yao Zhaopeng Long Qiang Li Communication and Electronic Engineering of Qiqihar University

GPS positioning system is installed in taxis and most mobile phones support GPS positioning function at present. GPS phones are used in the taxi to achieving intelligent scheduling based on this basis. The taxi intelligent dispatch system based on GPS is proposed, improve the traditional dijkstra scheduling algorithms by setting taxi maximum reasonable scheduling range, experimental results show that improved algorithms reduce the time complexity and improve scheduling efficiency. Meanwhile the traffic jam information can be sent to the dispatch center and make scheduling algorithm more reasonable by combined with above information.

关键词： Global Positioning System(GPS) dijkstra algorithm intelligent scheduling system GPS mobile phones General Packet Radio Service(GPRS)

来源：评论

学校读者我要写书评

暂无评论

The Shortest Path algorithm Based on Petri Net

The Shortest Path Algorithm Based on Petri Net

引用

2012 IEEE 19th International Conference on Industrial Engineering and Engineering Management(IE&EM 2012)

作者： Yu-jie Zheng Kai-hu Hou Wei-zhen Liao Lin Yang Department of Industrial Engineering Kunming University of Science and Technology

The dijkstra algorithm is the classic algorithm to solve the shortest path problem, but the solving process is relatively complicated. As the visual graphics ability and good computer skills of Petri Net, it is used to solve the shortest path problem, and according to the thought of directed Petri Net and transition enabled rules, Petri Net algorithm of solving the shortest path problem is designed. Compared to the dijkstra algorithm, this algorithm which omits the P, T tabs and λ, S functions of the dijkstra algorithm, can make the solution of the shortest path simpler and more convenient, improve the solution efficiency, and at the same time provide convenience for achieving algorithm objectively using computer.

关键词： dijkstra algorithm Petri Net algorithm Petri Net of directed network the shortest path problem

来源：评论

学校读者我要写书评

暂无评论

A PARTITIONING algorithm OF SMALL WATER SUPPLY NETWORK BASED ON INFOWORKS WS SOFTWARE

A PARTITIONING ALGORITHM OF SMALL WATER SUPPLY NETWORK BASED...

引用

第26届中国过程控制会议（CPCC2015）

作者： Chen Yao Shaoyuan Li Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education

By analyzing operating principle and topology structure, complex water supply network can be abstracted into a weighted directed graph. Using dijkstra algorithm, minimum dissipated power paths from water sources to all nodes have been calculated to simplify the original network. Combining Sugiyama algorithm, the main network layout with a hierarchical structure and initial District Metering Area can be defined. For those nodes who are far away from the water sources and close to the border area, a boundary criterion has been proposed to check the belongings and to determine the final District Metering Area partition. Finally, a sample town with real data in Info Works WS software has been set up. This case study is presented to illustrate the effectiveness of our proposed method.

关键词： District Metering Area dijkstra algorithm Sugiyama algorithm Boundary Criterion

来源：评论

学校读者我要写书评

暂无评论

Nash Differential Evolution (NashDE) algorithm for WAMS Planning 8

Nash Differential Evolution (NashDE) Algorithm for WAMS Plan...

引用

8th IEEE India International Conference on Power Electronics (IICPE)

作者： Thasnimol, C. M. Rajathy, R. Pondicherry Engn Coll Dept EEE Pondicherry India

ISBN: (纸本)9781538649961

Wide Area Monitoring System (WAMS) is an inevitable component in todays power system since a small catastrophe like fluctuations caused by the renewable energy sources, fast changing loads, electric vehicles, etc. will lead to the collapse of the whole system. This paper addresses the optimal planning of WAMS by Nash Differential Evolution (NashDE) algorithm, in which the variables of the problem are clustered into number of clusters, and will evolve parallelly by Differential Evolution (DE) towards the global objective of the problem. For optimization problems which are based on the connectivity of variables involved as in most of the power system planning processes, the convergence speed will greatly improve if variables in a cluster are physically connected. Further, this will ensure global convergence of the problem. Hence, this paper proposes a NashDE algorithm in which the variables are clustered based on their connectivity. Markov Clustering algorithm (MCL) is used for clustering the variables based on their connectivity. This is the first paper of such kind which addresses WAMS planning problem by Evolutionary Game Theory. Simulations are carried out for IEEE 14 and 30 bus test system using Python programming and the results are presented graphically.

关键词： PMU PDC WAMS NashDE Differential Evolution Evolutionary Game Theory MCL algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：