2017
DOI: 10.1504/ijsi.2017.10008729
|View full text |Cite
|
Sign up to set email alerts
|

Fibonacci series-based local search in spider monkey optimisation for transmission expansion planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…Sharma et al (2016) has proposed a modified version of SMO namely Fibonacci inspired SMO (FSMO) to solve TNEP. The FSMO was based on mathematical Fibonacci series and TNEP problem for IEEE 24 bus system has been solved by this algorithm (Sharma et al, 2017).…”
Section: Smo Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Sharma et al (2016) has proposed a modified version of SMO namely Fibonacci inspired SMO (FSMO) to solve TNEP. The FSMO was based on mathematical Fibonacci series and TNEP problem for IEEE 24 bus system has been solved by this algorithm (Sharma et al, 2017).…”
Section: Smo Algorithmmentioning
confidence: 99%
“…In this work, researcher compares the result of this strategy from PSO and GA for TNEP problem. (1995a, 1995b) approach has been used to solve TNEP da Silva et al (1999) IGA An improved GA has been designed to solve TNEP de Silva et al (2005) SGA Specialised GA has been presented to solve security constraint TNEP Correa et al (2015) GA NSGA-II crowded distance features and the Chu-Beasley GA has been used to solve security constraint TNEP Sensarma et al (2002) PSO Risk constrained TNEP has been solved by PSO Kavitha and Swarup (2006) LPSO Linear programming-based PSO is used to solve TNEP Barreto et al (2013) PSO TNEP has been solved by different variations of PSO like GPSO, LPSO, and QPSO also the results are compared Sisodia et al (2016) GA + PSO Hybrid tool of GA and PSO has been used to solve TNEP Sum-Im et al 2009, DE Multi-stage TNEP has been Rezende et al (2009) solved using DE Georgilakis (2010b) IDE Improve DE algorithm has been used to solve TNEP problem in deregulated environment Orfanos et al (2011) EDE Enhanced DE algorithm has been developed to solve TNEP Rathore et al (2013a) ABC ABC algorithm has been used to solve STNEP Rathore and Roy (2016) ABC TNEP problem with incorporating of wind power and plugin-electrical vehicles has been solved using ABC algorithm Fuchs and Gjengedal (2011) ACO TNEP problem with integration of wind power has been solved using ACO algorithm Verma et al (2010) HS Security constrained TNEP problem has been solved using HS algorithm Sharma et al (2017) FSMO TNEP problem has been solved using Fibonacci series inspired SMO algorithm Khandelwal et al (2017a) GWO TNEP problem has been solved using modified GWO algorithm Rathore et al (2013b) MOX TNEP problem has been solved using modified MOX algorithm 4 Significant works for TNEP…”
Section: Other Algorithmsmentioning
confidence: 99%