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

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

来源：评论

学校读者我要写书评

暂无评论

Optimal Network Reconfiguration Using Beetle Antennae Search Based on the prim algorithm 35

Optimal Network Reconfiguration Using Beetle Antennae Search...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems

引用

ECONOMIC THEORY 2024年第1期78卷 101-124页

作者： Han, Changyong Kim, Bawoo Chun, Youngsub Korea SMEs & Startups Inst Seoul South Korea Samsung Elect Suwon South Korea Seoul Natl Univ Dept Econ Seoul South Korea

Granot and Huberman (Math Program 29:323-347, 1984) introduced two demand operators, the weak demand operator and the strong demand operator, for minimum cost spanning tree problems, which are intended to measure the maximum amount that each agent can demand from her followers in compensation for making a link to her. We investigate the implications of these demand operators by introducing a procedure which enables us to sequentially calculate the maximum for each agent. On the irreducible cost matrix, by applying the weak demand operator sequentially to each agent, the Dutta-Kar allocation (Dutta and Kar in Games Econ Behav 48:223-248, 2004) is obtained if the procedure is initiated from any efficient allocation. For the strong demand operator, the Dutta-Kar allocation is obtained if the procedure is initiated from any allocation in the irreducible core.

关键词： Minimum cost spanning tree problems Demand operators Irreducible cost matrix Dutta-Kar rule prim algorithm C71

来源：评论

学校读者我要写书评

暂无评论

A bi-level programming model and differential evolution for optimizing offshore wind farm layout

引用

ENERGY SCIENCE & ENGINEERING 2023年第8期11卷 2775-2792页

作者： Song, Erping Qinghai Univ Sch Math & Phys Xining Peoples R China Qinghai Univ Sch Math & Phys Xining 810016 Peoples R China

The optimization of offshore wind farms is mainly performed through the deployment of wind farms and submarine cables to maximize power output and minimize cable costs. However, the above results are affected by the wake effect, equipment layout, and the cost of cables. To effectively complete the deployment of wind turbines and submarine cable lines, first, a bi-level constrained optimization model based on maximum profit and the shortest route of cable is proposed in this paper;then, a differential evolution and improved prim algorithm (IPADE) are used to optimize the upper- and lower-level objective function, respectively. Moreover, the fitness values are used to divide the population, and a surrogate model is used to evaluate approximate fitness values for the sub-population with poor performance;the best individual is selected as the offspring individual according to the approximate fitness values. Next, a clustering method is used to divide the position of the wind farm, and a prim algorithm based on roulette wheel selection is designed to deploy submarine cables of every subwind farm. Finally, the proposed algorithm is compared with five other popular algorithms under the two wind conditions. The simulation experimental results show that algorithm IPADE performs better than other algorithms in terms of the power output, profit, and the length of cables.

关键词： cable layout differential evolution optimum prim algorithm wind farm layout

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Graph Theory-Based Method for Regional Integrated Energy Network Planning: A Case Study of a China-US Low-Carbon Demonstration City

引用

ENERGIES 2019年第23期12卷 4491页

作者： Chen, Yingying Zhu, Jian Hefei Univ Technol Sch Civil Engn Hefei 230009 Anhui Peoples R China

With the significant attention on global climate change, regional integrated energy systems (RIES) in low-carbon city planning has become one of the most important ways for global cities to achieve the goal of energy conservation and emission reduction. However, the planning strategy used in the primary stage of RIES establishment will greatly affect the system economy and environment. In view of the lack of planning guidance mechanisms for the large-scale RIES in China, a method for RIES preliminary overall planning, focused on energy types and use, is proposed in this paper. A graph theory-based mathematical optimal model was established with the lifetime costs of the whole system as the economic goal, and an improved prim algorithm was put forward to solve the costs of the transmission and distribution network with the dynamic weight set of pipeline flow. The model was solved by an algorithm based on the idea of a dynamic minimum spanning tree and optimal path planning. The model and method were applied in a China-U.S. low-carbon demonstration city to verify feasibility and validity. The results could help us to comprehensively integrate regional energy and accurately plan future cities.

关键词： regional integrated energy system graph theory prim algorithm transmission and distribution network network layout

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Reliability assessment method for geographically distributed information systems 12

Reliability assessment method for geographically distributed...

引用

12th IEEE International Conference on Application of Information and Communication Technologies (AICT)

作者： Akimova, G. P. Solovyev, A. V. Tarkhanov, I. A. Russian Acad Sci Fed Res Ctr Comp Sci & Control Moscow Russia

ISBN: (纸本)9781538664681

this research defines reliability assessment method for information systems (hereinafter IS) in geographically distributed organizations. The article starts with the description of reliability indicators and general task formulation. The approach towards the design of a mathematical reliability model for geographically distributed systems based on the reliability scheme in the form of a graph is validated. There is the calculation of reliability indicators for a 3-level hierarchical system in the article. Advantage of the presented model is that it is suitable for both centralized and distributed information systems. In conclusion, there are some examples of implementation of the suggested approach in three geographically distributed information systems and comparison with the similar studies.

关键词： reliability information system prim algorithm geographical distribution reliability scheme graph tree

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：