Manizheh Ghaemi

Manizheh Ghaemi

Auto-generated profile, based on publicly available information

Manizheh Ghaemi

Faculty of Computer Engineering, K. N. Toosi University of Technology, Tehran, Iran

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2014 in Expert Systems with Applications
Verified
Journal Article
Closed access
MGManizheh Ghaemi
Manizheh Ghaemi
MDMohammad Reza Feizi Derakhshi
Mohammad Reza Feizi Derakhshi

1 December 2016 in Pattern Recognition
Verified
Journal Article
Closed access
MGManizheh Ghaemi
Manizheh Ghaemi
MDMohammad Reza Feizi Derakhshi
Mohammad Reza Feizi Derakhshi

1 June 2020 in Applied Soft Computing
Verified
Journal Article
Closed access
MGManizheh GhaemiDizaji
Manizheh GhaemiDizaji
CDChitra Dadkhah
Chitra Dadkhah
HLHenry Leung
Henry Leung

1 October 2018
Verified
Conference Paper
Closed access
MGManizheh Ghaemidizaji
Manizheh Ghaemidizaji
CDChitra Dadkhah
Chitra Dadkhah
Henry LeungHenry Leung
Henry Leung
The most challenging problem of these days is dealing with the high dimensionality and any progress in this area is very welcomed. This paper is an attempt to propose a new optimization algorithm that performs well in problems with high dimensions. As the result, a new optimization algorithm based on the behavior of a special flower named as Brunsvigia is proposed. The distinguishing property of this algorithm is its simplicity as well as efficiency in angular movement. The special seeding behavior of this flower has been simulated to propose a search algorithm named as Brunsvigia Optimization Algorithm (BVOA) which has two major phases as information sharing through pollination and solution movement based on the head tumbling behavior of the flower in nature. The performance of the proposed algorithm is evaluated on some test functions used in CEC2005 and the results are compared with four other optimization algorithms. The results show that the proposed algorithm has a better performance in high dimensions.