Distribution Network Expansion Using Hybrid SA/TS Algorithm
Authors
Abstract:
Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints and reliability limits, make it a combinatorial problem which should be solved by optimization algorithms. This paper presents a new hybrid simulated annealing and tabu search algorithm for distribution network expansion problem. Proposed hybrid algorithm is based on tabu search and an auxiliary simulated annealing algorithm controls the tabu list of the main algorithm. Also, another auxiliary simulated annealing based algorithm has been added to local searches of the main algorithm to make it more efficient. The numerical results show that the method is very accurate and fast comparing with the other algorithms.
similar resources
fault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Improved Hybrid Ts/pso Algorithm for Multistage Distribution Network Expansion Planning
Optimal multistage expansion of medium-voltage power network because of load growth is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints, make it a combinatorial problem which should be solved by optimization algorithms. In this paper, a new improved hybrid Tabu Search/ Particle Swarm Optimization algorithm is proposed...
full textA Novel Hybrid Whale Optimization Algorithm to Solve a Production-Distribution Network Problem Considering Carbon Emissions
Nowadays, there is a great deal of attention for regulations of carbon emissions to enforce the decision-makers of production and distribution networks to redesign their systems satisfactorily. The literature has seen a rapid interest in developing novel metaheuristics to solve this problem as a complicated optimization problem. Such difficulties motivate us to address a production-distribution...
full textDistribution Network Expansion Planning Based on Multi-objective PSO Algorithm
This paper presents a novel approach for electrical distribution network expansion planning using multi-objective particle swarm optimization (PSO). The optimization objectives are: investment and operation cost, energy losses cost, and power congestion cost. A two-phase multi-objective PSO algorithm is employed to solve this optimization problem, which can accelerate the convergence and guaran...
full textDeveloping a hybrid algorithm for distribution network design problem
Distribution network design is one of the important issues in supply chain management. Two important sub-problems of distribution network design are inventory and location decisions. Traditional approaches considered inventory and location decisions separately which might result in suboptimal solutions. This paper considers the design of a distribution network and simultaneously determines the ...
full textEstimation of groundwater level using a hybrid genetic algorithm-neural network
In this paper, we present an application of evolved neural networks using a real coded genetic algorithm for simulations of monthly groundwater levels in a coastal aquifer located in the Shabestar Plain, Iran. After initializing the model with groundwater elevations observed at a given time, the developed hybrid genetic algorithm-back propagation (GA-BP) should be able to reproduce groundwater ...
full textMy Resources
Journal title
volume 5 issue 2
pages 122- 130
publication date 2009-06
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023