نتایج جستجو برای: distribution expansion planning

تعداد نتایج: 925088  

2012
H. Shayeghi M. Mahdavi

Transmission network expansion planning (TNEP) is a basic part of power system planning that determines where, when and how many new transmission lines should be added to the network. Up till now, various methods have been presented to solve the static transmission network expansion planning (STNEP) problem. But in all of these methods, lines adequacy rate has not been considered at the end of ...

2012
H. Shayeghi H. Hosseini A. Shabani M. Mahdavi

In this paper, optimal generation expansion planning (GEP) is investigated considering purchase prices, profits of independent power producers (IPPs) and reliability criteria using a new method based on hybrid coded Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). In this approach, optimal purchase price of each IPP is obtained by HCGA and reliability criteria are calculated by PSO...

Journal: :ECTI Transactions on Electrical Engineering, Electronics, and Communications 2022

Distribution network expansion planning is a technique for managing the system effectively in face of future challenges. This work investigates design mesh distribution to allocate substations, DGs, voltage regulators, feeder routing, switch placement, and integration multiple energy carrier systems. Dynamic modeling multi-objective proposed this study identify optimal plan operational strategy...

Journal: :Comput. Manag. Science 2012
Claudia A. Sagastizábal Mikhail V. Solodov

We discuss the energy generation expansion planning with environmental constraints, formulated as a nonsmooth convex constrained optimization problem. To solve such problems, methods suitable for constrained nonsmooth optimization need to be employed. We describe a recently developed approach, which applies the usual unconstrained bundle techniques to a dynamically changing “improvement functio...

Journal: :Journal of Broadcast Engineering 2017

2001
Thomas Frontzek Thomas Navin Lal Rolf Eckmiller

For solving complex robot tasks it is necessary to incorpo rate path planning methods that are able to operate within di erent high dimensional con guration spaces containing an unknown number of obstacles Based on Advanced A algorithm AA using expansion matrices instead of a simple expansion logic we propose a further im provement of AA enabling the capability to learn directly from sample pla...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید