Proceedings of the 2014 International Conference on Control, Instrumentation, Energy and Communication (CIEC) 2014
DOI: 10.1109/ciec.2014.6959147
|View full text |Cite
|
Sign up to set email alerts
|

Improved-mosquitoes-behaviour based (I-MOX) evolutionary algorithm in transmission network expansion planning

Abstract: To solve the direct current (DC) power flow model based static transmission network expansion planning (STNEP), a modified version of MOX algorithm named Improved-MOX which has fast computation time and having better exploration capability then the MOX algorithm is presented in this paper. The objective is to minimize the transmission investment cost. Transmission network expansion planning (TNEP) helps to find out the new line configurations to meet the necessary requirements of the system operator in order t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 16 publications
0
0
0
Order By: Relevance
“…Without considering losses, and not allowing generation redispatch (generation scenario G1 [47]), according to [50], [51] and other authors, the optimal solution is composed of fifteen circuits connected on nine branches (#1-5=1, #3-24=1, #6-10=1, #7-8=2, #14-16=1, #15-24=1, #16-17=2, #16-19=1, #17-18=2) and costs US$ 390 million. The BATp optimizer, with đť‘ź đť‘–đť‘— = 0, has also found this solution.…”
Section: V11 Lossless Optimal Solutionsmentioning
confidence: 99%
“…Without considering losses, and not allowing generation redispatch (generation scenario G1 [47]), according to [50], [51] and other authors, the optimal solution is composed of fifteen circuits connected on nine branches (#1-5=1, #3-24=1, #6-10=1, #7-8=2, #14-16=1, #15-24=1, #16-17=2, #16-19=1, #17-18=2) and costs US$ 390 million. The BATp optimizer, with đť‘ź đť‘–đť‘— = 0, has also found this solution.…”
Section: V11 Lossless Optimal Solutionsmentioning
confidence: 99%