Hoda Zamani

Dr. Hoda Zamani

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
16 July 2022 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
Mohammad H. Nadimi-ShahrakiMohammad H. Nadimi-Shahraki
Mohammad H. Nadimi-Shahraki
Hoda ZamaniHoda Zamani
Hoda Zamani
SMSeyedali Mirjalili
Seyedali Mirjalili

1 December 2019 in Applied Soft Computing
Verified
Journal Article
Closed access
Hoda ZamaniHoda Zamani
Hoda Zamani
Mohammad H. Nadimi-ShahrakiMohammad H. Nadimi-Shahraki
Mohammad H. Nadimi-Shahraki
Amir H GandomiAmir H Gandomi
Amir H Gandomi

25 October 2021 in Computers
Verified
Journal Article
Open access
PDF file
Mohammad H. Nadimi-ShahrakiMohammad H. Nadimi-Shahraki
Mohammad H. Nadimi-Shahraki
MBMahdis Banaie-Dezfouli
Mahdis Banaie-Dezfouli
Hoda ZamaniHoda Zamani
Hoda Zamani
STShokooh Taghian
Shokooh Taghian
Seyedali MirjaliliSeyedali Mirjalili
Seyedali Mirjalili
Advancements in medical technology have created numerous large datasets including many features. Usually, all captured features are not necessary, and there are redundant and irrelevant features, which reduce the performance of algorithms. To tackle this challenge, many metaheuristic algorithms are used to select effective features. However, most of them are not effective and scalable enough to select effective features from large medical datasets as well as small ones. Therefore, in this paper, a binary moth-flame optimization (B-MFO) is proposed to select effective features from small and large medical datasets. Three categories of B-MFO were developed using S-shaped, V-shaped, and U-shaped transfer functions to convert the canonical MFO from continuous to binary. These categories of B-MFO were evaluated on seven medical datasets and the results were compared with four well-known binary metaheuristic optimization algorithms: BPSO, bGWO, BDA, and BSSA. In addition, the convergence behavior of the B-MFO and comparative algorithms were assessed, and the results were statistically analyzed using the Friedman test. The experimental results demonstrate a superior performance of B-MFO in solving the feature selection problem for different medical datasets compared to other comparative algorithms.

7 March 2022 in Electronics
Verified
Journal Article
Open access
PDF file
Mohammad H. Nadimi-ShahrakiMohammad H. Nadimi-Shahraki
Mohammad H. Nadimi-Shahraki
Ali FatahiAli Fatahi
Ali Fatahi
Hoda ZamaniHoda Zamani
Hoda Zamani
Seyedali MirjaliliSeyedali Mirjalili
Seyedali Mirjalili
Diego OlivaDiego Oliva
Diego Oliva
The optimal power flow (OPF) is a practical problem in a power system with complex characteristics such as a large number of control parameters and also multi-modal and non-convex objective functions with inequality and nonlinear constraints. Thus, tackling the OPF problem is becoming a major priority for power engineers and researchers. Many metaheuristic algorithms with different search strategies have been developed to solve the OPF problem. Although, the majority of them suffer from stagnation, premature convergence, and local optima trapping during the optimization process, which results in producing low solution qualities, especially for real-world problems. This study is devoted to proposing an effective hybridizing of whale optimization algorithm (WOA) and a modified moth-flame optimization algorithm (MFO) named WMFO to solve the OPF problem. In the proposed WMFO, the WOA and the modified MFO cooperate to effectively discover the promising areas and provide high-quality solutions. A randomized boundary handling is used to return the solutions that have violated the permissible boundaries of search space. Moreover, a greedy selection operator is defined to assess the acceptance criteria of new solutions. Ultimately, the performance of the WMFO is scrutinized on single and multi-objective cases of different OPF problems including standard IEEE 14-bus, IEEE 30-bus, IEEE 39-bus, IEEE 57-bus, and IEEE118-bus test systems. The obtained results corroborate that the proposed algorithm outperforms the contender algorithms for solving the OPF problem.

6 December 2021 in Entropy
Verified
Journal Article
Open access
PDF file
Mohammad H. Nadimi-ShahrakiMohammad H. Nadimi-Shahraki
Mohammad H. Nadimi-Shahraki
Ali FatahiAli Fatahi
Ali Fatahi
Hoda ZamaniHoda Zamani
Hoda Zamani
Seyedali MirjaliliSeyedali Mirjalili
Seyedali Mirjalili
Laith AbualigahLaith Abualigah
Laith Abualigah
Moth-flame optimization (MFO) algorithm inspired by the transverse orientation of moths toward the light source is an effective approach to solve global optimization problems. However, the MFO algorithm suffers from issues such as premature convergence, low population diversity, local optima entrapment, and imbalance between exploration and exploitation. In this study, therefore, an improved moth-flame optimization (I-MFO) algorithm is proposed to cope with canonical MFO’s issues by locating trapped moths in local optimum via defining memory for each moth. The trapped moths tend to escape from the local optima by taking advantage of the adapted wandering around search (AWAS) strategy. The efficiency of the proposed I-MFO is evaluated by CEC 2018 benchmark functions and compared against other well-known metaheuristic algorithms. Moreover, the obtained results are statistically analyzed by the Friedman test on 30, 50, and 100 dimensions. Finally, the ability of the I-MFO algorithm to find the best optimal solutions for mechanical engineering problems is evaluated with three problems from the latest test-suite CEC 2020. The experimental and statistical results demonstrate that the proposed I-MFO is significantly superior to the contender algorithms and it successfully upgrades the shortcomings of the canonical MFO.

2 February 2024 in Archives of Computational Methods in Engineering
Verified
Journal Article
Closed access
PDF file
Hoda ZamaniHoda Zamani
Hoda Zamani
Mohammad H. Nadimi-ShahrakiMohammad H. Nadimi-Shahraki
Mohammad H. Nadimi-Shahraki
SMSeyedali Mirjalili
Seyedali Mirjalili
FGFarhad Soleimanian Gharehchopogh
Farhad Soleimanian Gharehchopogh
DODiego Oliva
Diego Oliva