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

35th Youth Academic Annual Conference of Chinese-Association-of-Automation (YAC)

作者： Luo, Linhuan Ma, Jieran Wang, Hongbin Luo, Simin Guangdong Power Grid Co Ltd Guangzhou Power Supply Guangzhou Peoples R China

ISBN: (纸本)9781728176840

Network reconfiguration is always used to find the optimal structure of a distribution network, with less power loss, higher power quality, and better load balancing. In this paper, optimal network reconfiguration using beetle antennae search based on the prim algorithm is proposed to find the optimal structure of a distribution system. This problem can be formulated as a multi-objective optimization problem and beetle antennae search is used to solve it, applying prim algorithm to make sure that a radial network structure would remain after reconfiguration and all loads would be energized. Roulette wheel selection is used in the path selection procedure to avoid trapping in local optimum. The proposed method is validated in a system. The results proved that the proposed method completes the integrated optimization of network reconfiguration and leads to significant reduction on the calculation amount and fast convergence, which is suitable for engineering application.

关键词： network reconfiguration beetle antennae search prim algorithm roulette wheel selection distribution system

来源：评论

学校读者我要写书评

暂无评论

Improved prim algorithm and Its Application in Unmanned Aerial Vehicle Cruise System 29

Improved Prim Algorithm and Its Application in Unmanned Aeri...

引用

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

作者： Funa Zhou Po Hu Xiaoliang Feng Yansui Song School of Computer and Information Engineering Henan University College of Electrical Engineering Henan University of Technology College of Automation Northwestern Polytechnic University

ISBN: (纸本)9781509046584

Unmanned Aerial Vehicle(UAV) can perform tasks such as military reconnaissance,monitoring,search and target *** a UAV is used to perform a reconnaissance task on a cruise path planning,and certain set of multi-target point,the optimal cruise path should be well scheduled to ensure that the cruise time is *** this paper,an improved prim algorithm is studied by introducing constraint condition to improve the effect of UAV path *** on the data provided by GPS module,the weight matrix between the target points is obtained by using coordinate transformation,and the optimal cruise sequence is obtained by using the improved prim *** results and success application in cruise path planning of UAV show the efficiency of this improved prim algorithm.

关键词： UAV path planning prim algorithm coordinate transformation

来源：评论

学校读者我要写书评

暂无评论

Optimization of Highway Construction based on prim algorithm

引用

International Conference on Frontiers of Manufacturing and Design Science (ICFMD2010)

作者： Zhao, Hong Qin, Shaochong Zhu, Song Shenyang Univ Technol Sch Management Shenyang Peoples R China Northeast Elect Power Res Inst Co Ltd Shenyang Peoples R China

ISBN: (纸本)9783037850046

In this paper, prim algorithm is used to solve the problem of optimizing inter-city highway paving in highway construction project. In the paper circles are used to indicate the cities, the inter-city highway with the line between circles, and the line weights on the behalf of the relative costs of highway construction. prim minimum spanning tree algorithm is constructed on the n inter-city highway, and finally make the project cost cut down from 53 to 20 in highway construction project and obtain a better eco-efficiency and social benefits under cutting down of the project cost.

关键词： prim algorithm Cost control Minimum spanning tree Project management Optimization

来源：评论

学校读者我要写书评

暂无评论

Planning for Network Expansion Based on prim algorithm and Reinforcement Learning

Planning for Network Expansion Based on Prim Algorithm and R...

引用

IEEE/IAS Industrial and Commercial Power System Asia (IEEE I and CPS Asia)

作者： Dong, Fude Li, Zilv Xu, Yuantu Zhu, Deqiang Huang, Rongjie Zou, Haobin Wu, Zelin Wang, Xinghua Guangdong Power Grid Co Ltd Qingyuan Power Supply Bur Qingyuan Peoples R China Guangdong Univ Technol Sch Automat Guangzhou Peoples R China

ISBN: (纸本)9798350339345

Existing methods for expanding distribution network grids lack flexibility in handling multiple scenarios, particularly in the expansion planning of photovoltaic(PV)-enabled distribution networks where the problem of adding load points is mainly addressed based on empirical knowledge without considering the economic and reliability aspects throughout the entire planning process. To address this issue, this paper proposes a planning method that combines prim algorithm and reinforcement learning (RL). Firstly, historical data of PV and load characteristics are extracted, and multiple typical PV and corresponding load scenarios are generated using clustering algorithms as planning scenarios. Secondly, the prim algorithm is introduced to improve the action rules and environment of RL, and the mathematical model of planning is transformed into a corresponding reward function. By using RL, the optimal planning path can be found, which enhances the overall operational efficiency of the network and ensures the power supply of the new load points, providing a reference for future operation planning scenarios. Finally, calculations and data analysis based on IEEE standard cases verify the scientific and efficient nature of the proposed method.

关键词： distribution network planning prim algorithm reinforcement learning clustering algorithm

来源：评论

学校读者我要写书评

暂无评论

The analysis and application of prim algorithm,Kruskal algorithm,Boruvka algorithm

The analysis and application of Prim algorithm,Kruskal algor...

引用

作者： Jiayu Chen Beijing Normal University-Hong Kong Baptist University United International College

Minimum spanning tree has many applications in real *** example,the government needs to build roads between many ***,it is necessary to find the plan with the shortest path to save the *** problem is essentially generating a minimal spanning tree,and it require a suitable algorithm to find the minimum spanning *** this paper,the author analyzes the structure and time complexity of the prim algorithm,the Kruskal algorithm and the Boruvka *** this research,the author finds prim algorithm is suitable for dense *** Kruskal algorithm can generate the minimum spanning tree in sparse *** the Boruvka algorithm is suitable for graphs that have some special *** on the above conclusions,the author gives some suggestions for urban highway network planning.

关键词： minimum spanning tree prim algorithm Kruskal algorithm Boruvka algorithm graph

来源：评论

学校读者我要写书评

暂无评论

Realization of the Minimum Cost Spanning Tree’s Storage and Optimization in prim algorithm

Realization of the Minimum Cost Spanning Tree’s Storage and...

引用

2010 The 3rd International Conference on Computational Intelligence and Industrial Application (PACIIA2010)

作者： Pan Da-zhi1,2 and Liu Zhi-bin2 1 College of mathematic and information China west normal university nanchong 637009,china Chen You-jun1 and Ding Xian-feng2 2 school of sciences Southwest petroleum university Chengdu 610050,china

This paper designs a special data structure for vertices in the network. the storage of edges in minimum cost spanning tree(for short, MCST) has been realized by the vertex array ,which is created by the special data structure. Through the vertex array, the vertices in V-U set constitute a static bi- directional circular linked list, so prim algorithm realizes truly operation selecting the shortest side though the V-U set, by which the prim algorithm is optimized to improve the efficiency of the operation. For the same vertex lying in U and V-U at the different moments, the special data structure makes storage space to be fully used and improves space utilization..

关键词： network prim algorithm minimum cost spanning tree bi-directional circular linked list static linked list.

来源：评论

学校读者我要写书评

暂无评论

VANET Cluster-on-Demand Minimum Spanning Tree (MST) prim Clustering algorithm

VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim Clu...

引用

International Conference on Computational Problem-Solving (ICCP)

作者： Kponyo, Jerry John Kuang, Yujun Zhang, Enzhan Domenic, Kamenyi Univ Elect Sci & Technol China Mobilelink Lab Chengdu 610054 Peoples R China

ISBN: (纸本)9781479921508

Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information through cluster-heads (CHs) has several advantages over allowing all the vehicles to broadcast the information. Forming and maintaining stable clusters as well as ensuring good QoS in intra-cluster communications has always been a great challenge. In this paper we present a VANET Cluster-on-Demand (CoD) Minimum Spanning Tree (MST) prim algorithm which clusters vehicles taking into consideration the intra-cluster QoS. Matlab simulation results of the algorithm applied to real traffic data has shown the algorithm's ability to successfully form clusters with good QoS. The algorithm has also been shown to compare very well with Dijkstra's algorithm which is one of the best clustering algorithms.

关键词： Dijkstra's algorithm Minimum spanning tree (MST) prim algorithm Vehicular ad hoc networks (VANETs)

来源：评论

学校读者我要写书评

暂无评论

prim-based support-graph preconditioners for min-cost flow problems

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2007年第2-3期36卷 271-287页

作者： Frangioni, A. Gentile, C. Univ Pisa Dept Comp Sci I-56127 Pisa Italy CNR Ist Anal Sist & Informat A Ruberti I-00185 Rome Italy

Support-graph preconditioners have been shown to be a valuable tool for the iterative solution, via a Preconditioned Conjugate Gradient method, of the KKT systems that must be solved at each iteration of an Interior Point algorithm for the solution of Min Cost Flow problems. These preconditioners extract a proper triangulated subgraph, with "large" weight, of the original graph: in practice, trees and Brother-Connected Trees (BCTs) of depth two have been shown to be the most computationally efficient families of subgraphs. In the literature, approximate versions of the Kruskal algorithm for maximum-weight spanning trees have most often been used for choosing the subgraphs;prim-based approaches have been used for trees, but no comparison have ever been reported. We propose prim-based heuristics for BCTs, which require nontrivial modifications w.r.t. the previously proposed Kruskal-based approaches, and present a computational comparison of the different approaches, which shows that prim-based heuristics are most often preferable to Kruskal-based ones.

关键词： min-cost flow problems interior point algorithms preconditioned conjugated gradient method prim algorithm

来源：评论

学校读者我要写书评

暂无评论

PST-prim Heuristic for the Open Vehicle Routing Problem

引用

IEEE LATIN AMERICA TRANSACTIONS 2019年第2期17卷 253-259页

作者： Campo Zuniga, Byron Mendoza Mendoza, Adel Univ Atlantico Fac Engn Barranquilla Atlantico Colombia

The objective of this paper is to present and demonstrate the validation of the functioning of a recursive heuristic based on the algorithm of prim and that gives solution to the open vehicle routing problem (OVRP). Today this problem has a considerable approach, so a literature review that sets the theoretical basis for the work, is made. The OVRP is formally shown and the covering tree with paths (PST) is defined. Next, the subroutine that follows the PST-prim algorithm is indicated to construct the PST of any graph, as well as the modification that must be made to arrive at the PST-prim Heuristic that gives solution to the OVRP. An illustrative example of the construction of PST to an example graph is presented. To illustrate and validate its effectiveness of the heuristic, it is used to solve 17 widely used problems to verify and compare the behavior of this type of algorithms. In addition, the PST-prim heuristic performance is compared with other seven algorithms;the value of the objective function and the computation time for each algorithm on the 17 instances is presented. The PST-prim propose the best solutions on 12 of the 17 instances. At the end, the performance, use and importance of the heuristic is discussed.

关键词： Heuristic algorithms Vehicle routing IEEE transactions Manganese Bibliographies Linear programming Path Spanning Tree prim algorithm PST-prim heuristic Open vehicle routing problem

来源：评论

学校读者我要写书评

暂无评论

Comparison of prim and Kruskal on Shanghai and Shenzhen 300 Index hierarchical structure tree

Comparison of Prim and Kruskal on Shanghai and Shenzhen 300 ...

引用

International Conference on Web Information Systems and Mining

作者： Huang, Feixue Gao, Pengfei Wang, Yu Dalian Univ Technol Dept Econ Dalian 116024 Liaoning Prov Peoples R China Dalian Univ Technol Sch Software Dalian 116024 Liaoning Prov Peoples R China

ISBN: (纸本)9780769538174

This study's objective is to assess the performance of the common prim and the Kruskal of the minimum spanning tree in building up super metric space. We proposed the use of complexity analysis and experimental methods to assess these two methods. After the analysis of the sample data of Shanghai and Shenzhen 300 index daily from the second half of 2005 to the second half of 2007, The results showed that when the number of shares is less than 100, judging from the space complexity, Kruskal algorithm is relatively superior to prim algorithm;however, when the number of shares is greater than 100, from the time complexity's aspect, prim algorithm is more superior. This study's conclusion indicates that matrix of Shanghai and Shenzhen 300 stock the inter-continental distance formed by the edge map more, so prim better than Kruskal.

关键词： Super metric Spaces Hierarchical structure tree index Minimum spanning tree(MST) prim algorithm Kruskal algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：