Topic
Prim's algorithm
About: Prim's algorithm is a research topic. Over the lifetime, 775 publications have been published within this topic receiving 17971 citations. The topic is also known as: DJP algorithm & Jarník algorithm.
Papers published on a yearly basis
Papers
More filters
01 Oct 2018
TL;DR: The Prim's algorithm to generate the radiation network and the binary particle swarm optimization algorithm to achieve network reconfiguration are used, which verifies the validity and convergence of the algorithm.
Abstract: This paper deals with the problem of network reconfiguration of distribution networks with high proportional Distributed Generation(DG). Firstly, this paper studies the types of Distributed Generation and their characteristics, discusses the influence of distributed power supply to distribution network, and studies their computing model. Secondly, the forward and backward substitution method is introduced to calculate the load flow. Then, the reconfiguration model of distribution network is established, and the objective function of Pareto multi-objective optimization is to minimize the loss of the net and voltage deviation and to maximize reliability. This paper uses the Prim's algorithm to generate the radiation network and uses the binary particle swarm optimization algorithm to achieve network reconfiguration. At the same time, the strategy of randomly initializing velocity vectors is adopted to prevent the local optimal. At last, the optimization analysis of the 33-node of the distribution network is carried out, and good results are obtained, which verifies the validity and convergence of the algorithm.
1 citations
19 Apr 2015
TL;DR: This paper presents a general framework for generating greedy algorithms for solving convex constraint satisfaction problems for sparse solutions by mapping the satisfaction problem into one of graph traversal on a rooted tree of unknown topology.
Abstract: This paper presents a general framework for generating greedy algorithms for solving convex constraint satisfaction problems for sparse solutions by mapping the satisfaction problem into one of graph traversal on a rooted tree of unknown topology. For every pre-walk of the tree an initial set of generally dense feasible solutions is processed in such a way that the sparsity of each solution increases with each generation unveiled. The specific computation performed at any particular child node is shown to correspond to an embedding of a polytope into the polytope received from that nodes parent. Several issues related to pre-walk order selection, computational complexity and tractability, and the use of heuristic and/or side information is discussed. An example of a single-path, depth-first algorithm on a tree with randomized vertex reduction and a run-time path selection algorithm is presented in the context of sparse lowpass filter design.
1 citations
TL;DR: A dynamic programming algorithm for the tree mapping problem (i.e., the variant of the problem in which the input graphs are trees), which is still NP-hard, is introduced, and its performance with computational experiments is evaluated.
1 citations
10 Jan 2000
TL;DR: An O(n^2) time approximation algorithm for the minimum rectilinear Steiner tree is proposed and the computing performances show the costs of the spanning trees produced by the algorithm are only 0.8% away from the optimal ones.
Abstract: An O(n^2) time approximation algorithm for the minimum rectilinear Steiner tree is proposedThe approximation ratio of the algorithm is strictly less than 15The computing performances show the costs of the spanning trees produced by the algorithm are only 08% away from the optimal ones
1 citations