default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaeid Barshandeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Benyamin Abdollahzadeh, Nima Khodadadi
, Saeid Barshandeh, Pavel Trojovský, Farhad Soleimanian Gharehchopogh, El-Sayed M. El-Kenawy, Laith Abualigah, Seyedali Mirjalili:
Puma optimizer (PO): a novel metaheuristic optimization algorithm and its application in machine learning. Clust. Comput. 27(4): 5235-5283 (2024)- 2023
- [j11]Saeid Barshandeh, Shima Koulaeizadeh, Mohammad Masdari, Benyamin Abdollahzadeh, Mahsa Ghasembaglou:
A learning-based metaheuristic administered positioning model for 3D IoT networks. Appl. Soft Comput. 136: 110113 (2023) - [j10]Farhad Soleimanian Gharehchopogh, Benyamin Abdollahzadeh, Saeid Barshandeh, Bahman Arasteh:
A multi-objective mutation-based dynamic Harris Hawks optimization for botnet detection in IoT. Internet Things 24: 100952 (2023) - 2022
- [j9]Saeid Barshandeh, Farhad Piri, Simin Rasooli Sangani:
HMPA: an innovative hybrid multi-population algorithm based on artificial ecosystem-based and Harris Hawks optimization algorithms for engineering problems. Eng. Comput. 38(2): 1581-1625 (2022) - [j8]Benyamin Abdollahzadeh, Saeid Barshandeh, Hatef Javadi, Nicola Epicoco:
An enhanced binary slime mould algorithm for solving the 0-1 knapsack problem. Eng. Comput. 38(4): 3423-3444 (2022) - [j7]Saeid Barshandeh, Mohammad Masdari, Gaurav Dhiman, Vahid Hosseini, Krishna Kant Singh:
A range-free localization algorithm for IoT networks. Int. J. Intell. Syst. 37(12): 10336-10379 (2022) - [j6]Saeid Barshandeh, Reza Dana, Parinaz Eskandarian:
A learning automata-based hybrid MPA and JS algorithm for numerical optimization problems and its application on data clustering. Knowl. Based Syst. 236: 107682 (2022) - 2021
- [j5]Saeid Barshandeh, Maryam Haghzadeh:
A new hybrid chaotic atom search optimization based on tree-seed algorithm and Levy flight for solving optimization problems. Eng. Comput. 37(4): 3079-3122 (2021) - [j4]Abdollahzadeh Benyamin, Farhad Soleimanian Gharehchopogh, Saeid Barshandeh:
Discrete farmland fertility optimization algorithm with metropolis acceptance criterion for traveling salesman problems. Int. J. Intell. Syst. 36(3): 1270-1303 (2021) - 2020
- [j3]Ali Shahidinejad, Saeid Barshandeh:
Sink selection and clustering using fuzzy-based controller for wireless sensor networks. Int. J. Commun. Syst. 33(15) (2020) - [j2]Mohammad Masdari, Saeid Barshandeh:
Discrete teaching-learning-based optimization algorithm for clustering in wireless sensor networks. J. Ambient Intell. Humaniz. Comput. 11(11): 5459-5476 (2020)
2010 – 2019
- 2019
- [j1]Mohammad Masdari, Saeid Barshandeh, Suat Ozdemir:
CDABC: chaotic discrete artificial bee colony algorithm for multi-level clustering in large-scale WSNs. J. Supercomput. 75(11): 7174-7208 (2019)
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 2025-01-21 00:10 CET 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:
