default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMojtaba Ghasemi
Person information
- affiliation: Shiraz University of Technology, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Milad Gil
, Ebrahim Akbari, Abolfazl Rahimnejad, Mojtaba Ghasemi, S. Andrew Gadsden:
Solution of optimal reactive power dispatch by Lévy-flight phasor particle swarm optimization. Intell. Syst. Appl. 23: 200398 (2024)- [j16]Mojtaba Ghasemi, Mohsen Zare, Pavel Trojovský, Ravipudi Venkata Rao, Eva Trojovská, Venkatachalam Kandasamy:
Optimization based on the smart behavior of plants with its engineering applications: Ivy algorithm. Knowl. Based Syst. 295: 111850 (2024) - [j15]Mojtaba Ghasemi, Keyvan Golalipour, Mohsen Zare, Seyedali Mirjalili, Pavel Trojovský, Laith Abualigah, Rasul Hemmati:
Flood algorithm (FLA): an efficient inspired meta-heuristic for engineering optimization. J. Supercomput. 80(15): 22913-23017 (2024) - 2023
- [j14]Mojtaba Ghasemi, Mohsen Zare, Pavel Trojovský, Amir Zahedibialvaei, Eva Trojovská:
A hybridizing-enhanced differential evolution for optimization. PeerJ Comput. Sci. 9: e1420 (2023) - [j13]Mojtaba Ghasemi, Abolfazl Rahimnejad, Ebrahim Akbari, Ravipudi Venkata Rao, Pavel Trojovský, Eva Trojovská, Stephen Andrew Gadsden:
A new metaphor-less simple algorithm based on Rao algorithms: a Fully Informed Search Algorithm (FISA). PeerJ Comput. Sci. 9: e1431 (2023) - 2022
- [j12]Mojtaba Ghasemi, Ebrahim Akbari, Iraj Faraji Davoudkhani, Abolfazl Rahimnejad, Mohammad Bagher Asadpoor, Stephen Andrew Gadsden:
Application of Coulomb's and Franklin's laws algorithm to solve large-scale optimal reactive power dispatch problems. Soft Comput. 26(24): 13899-13923 (2022) - [c1]Mojtaba Ghasemi, Mohsen Zare, Amir Zahedi, Rasul Hemmati, Laith Abualigah, Agostino Forestiero:
A Comparative Study of the Coulomb's and Franklin's Laws Inspired Algorithm (CFA) with Modern Evolutionary Algorithms for Numerical Optimization. PerSOM 2022: 111-124 - 2021
- [j11]Mojtaba Ghasemi, Abolfazl Rahimnejad, Rasul Hemmati, Ebrahim Akbari, S. Andrew Gadsden:
Wild Geese Algorithm: A novel algorithm for large scale optimization based on the natural life and death of wild geese. Array 11: 100074 (2021) - 2020
- [j10]Mojtaba Ghasemi, Iraj Faraji Davoudkhani, Ebrahim Akbari, Abolfazl Rahimnejad, Sahand Ghavidel, Li Li:
A novel and effective optimization algorithm for global optimization and its engineering applications: Turbulent Flow of Water-based Optimization (TFWO). Eng. Appl. Artif. Intell. 92: 103666 (2020)
2010 – 2019
- 2019
- [j9]Maedeh Gholamghasemi, Ebrahim Akbari, Mohammad Bagher Asadpoor, Mojtaba Ghasemi:
A new solution to the non-convex economic load dispatch problems using phasor particle swarm optimization. Appl. Soft Comput. 79: 111-124 (2019) - [j8]Mojtaba Ghasemi, Ebrahim Akbari, Abolfazl Rahimnejad, Seyed-Ehsan Razavi, Sahand Ghavidel, Li Li:
Phasor particle swarm optimization: a simple and efficient variant of PSO. Soft Comput. 23(19): 9701-9718 (2019) - 2016
- [j7]Mojtaba Ghasemi, Mahdi Taghizadeh, Sahand Ghavidel, Abbas Abbasian:
Colonial competitive differential evolution: An experimental study for optimal economic load dispatch. Appl. Soft Comput. 40: 342-363 (2016) - 2015
- [j6]Mojtaba Ghasemi, Mahdi Taghizadeh, Sahand Ghavidel, Jamshid Aghaei, Abbas Abbasian:
Solving optimal reactive power dispatch problem using a novel teaching-learning-based optimization algorithm. Eng. Appl. Artif. Intell. 39: 100-108 (2015) - [j5]Mojtaba Ghasemi, Sahand Ghavidel, Mohammad Mehdi Ghanbarian, Mohsen Gitizadeh:
Multi-objective optimal electric power planning in the power system using Gaussian bare-bones imperialist competitive algorithm. Inf. Sci. 294: 286-304 (2015) - 2014
- [j4]Mojtaba Ghasemi, Sahand Ghavidel, Mohammad Mehdi Ghanbarian, Amir Habibi:
A new hybrid algorithm for optimal reactive power dispatch problem with discrete and continuous control variables. Appl. Soft Comput. 22: 126-140 (2014) - [j3]Mojtaba Ghasemi, Sahand Ghavidel, Shima Rahmani, Alireza Roosta, Hasan Falah:
A novel hybrid algorithm of imperialist competitive algorithm and teaching learning algorithm for optimal power flow problem with non-smooth cost functions. Eng. Appl. Artif. Intell. 29: 54-69 (2014) - [j2]Mojtaba Ghasemi, Mohammad Mehdi Ghanbarian, Sahand Ghavidel, Shima Rahmani, Esmaeil Mahboubi Moghaddam:
Modified teaching learning algorithm and double differential evolution algorithm for optimal reactive power dispatch problem: A comparative study. Inf. Sci. 278: 231-249 (2014) - [j1]Mojtaba Ghasemi, Sahand Ghavidel, Mohammad Mehdi Ghanbarian, Hamid Reza Massrur, Masihallah Gharibzadeh:
Application of imperialist competitive algorithm with its modified techniques for multi-objective optimal power flow problem: A comparative study. Inf. Sci. 281: 225-247 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
