An optimization technique to solve distribution network planning (DNP) problem is presented. This is a very complex mixed binary nonlinear programming problem. A constructive heuristic algorithm (CHA) aimed at obtaini...
详细信息
ISBN:
(纸本)9781424442409
An optimization technique to solve distribution network planning (DNP) problem is presented. This is a very complex mixed binary nonlinear programming problem. A constructive heuristic algorithm (CHA) aimed at obtaining an excellent quality solution for this problem is presented. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution network. This sensitivity index is obtained solving the DNP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. A local improvement phase and a branching technique were implemented in the CHA. Results of two tests using a distribution network are presented in the paper in order to show the ability of the proposed algorithm.
This paper introduces a new heuristic method called uniform voltage distribution based constructivealgorithm (UVDA) especially intended for optimal reconfiguration of large-scale distribution networks. The algorithm ...
详细信息
This paper introduces a new heuristic method called uniform voltage distribution based constructivealgorithm (UVDA) especially intended for optimal reconfiguration of large-scale distribution networks. The algorithm starts with expanding a subnetwork through tracing maximum bus voltage and performing a series of branch exchange operation concurrently. By the aid of tracing nature of UVDA, no radial constraints are imposed. To exemplify the presented method, UVDA has been rigorously explained in details using a widely studied 33 bus test system. The validity of the proposed algorithm was confirmed through successful performance on numerous practical distribution networks, ranged from 16-bus system with 3 tie-switches up to 835-bus system with 146 tie-switches. Furthermore, comparisons are made with the other recent approaches available in the literatures. The test results demonstrate that the proposed algorithm successfully finds a globally optimal configuration for all the test systems in a conspicuously short time. (c) 2013 Elsevier B.V. All rights reserved.
An optimisation technique to solve transmission network expansion planning problem, using the AC model, is presented. This is a very complex mixed integer nonlinear programming problem. A constructiveheuristic algori...
详细信息
An optimisation technique to solve transmission network expansion planning problem, using the AC model, is presented. This is a very complex mixed integer nonlinear programming problem. A constructive heuristic algorithm aimed at obtaining an excellent quality solution for this problem is presented. An interior point method is employed to solve nonlinear programming problems during the solution steps of the algorithm. Results of the tests, carried out with three electrical energy systems, show the capabilities of the method and also the viability of using the AC model to solve the problem.
暂无评论