Parallel Computing Based Solution for Reliability-Constrained Distribution Network Planning
The main goal of distribution network (DN) expansion planning is essentially to achieve minimal investment constrained with specified reliability requirements. The reliability-constrained distribution network planning (RcDNP) problem can be cast an instance of mixed-integer linear programming (MILP) which involves ultra-heavy computation burden especially for large scale DNs. In this paper, we propose a parallel computing-based acceleration algorithm for solve RcDNP problem. The RcDNP is decomposed into a backbone grid and several lateral grid problems with coordination. Then a parallelizable augmented Lagrangian algorithm with acceleration strategy is developed to solve the coordination planning problems. In this method, the lateral grid problems are solved in parallel through coordinating with the backbone grid planning problem. To address the presence of nonconvexity, Gauss-Seidel iteration is adopted on the convex hull of the feasible region constructed by the decomposition method. Under mild conditions, the optimality and convergence of this algorithm is proven. The numerical tests show the proposed method can significantly reduce the computation time and make the RcDNP applicable for real-world problems.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Receptive Field-based Segmentation for Distributed CNN Inference Acceleration in Collaborative Edge Computing
This paper studies inference acceleration using distributed convolutional neural networks (CNNs) in collaborative edge computing network. To avoid inference accuracy loss in inference task partitioning, we propose recept…
Edge-computingQuantum Computing and Neuromorphic Computing for Safe, Reliable, and explainable Multi-Agent Reinforcement Learning: Optimal Control in Autonomous Robotics
This paper investigates the utilization of Quantum Computing and Neuromorphic Computing for Safe, Reliable, and Explainable Multi_Agent Reinforcement Learning (MARL) in the context of optimal control in autonomous roboti…
Multi-agent Reinforcement LearningAnalysis and Optimization of the Latency Budget in Wireless Systems with Mobile Edge Computing
We present a framework to analyse the latency budget in wireless systems with Mobile Edge Computing (MEC). Our focus is on teleoperation and telerobotics, as use cases that are representative of mission-critical uplink-i…
Data CompressionEdge-computingFaithful Density-Peaks Clustering via Matrix Computations on MPI Parallelization System
Density peaks clustering (DP) has the ability of detecting clusters of arbitrary shape and clustering non-Euclidean space data, but its quadratic complexity in both computing and storage makes it difficult to scale for b…
ClusteringCommunity DetectionSerial Parallel Reliability Redundancy Allocation Optimization for Energy Efficient and Fault Tolerant Cloud Computing
Serial-parallel redundancy is a reliable way to ensure service and systems will be available in cloud computing. That method involves making copies of the same system or program, with only one remaining active. When an e…
Cloud Computing