The DOI matches its Crossref record; 84 of the 84 references it cites were found in a registry or an index.
The Social Engineering Optimizer (SEO)
Abstract
Although several meta-heuristics have been developed in the last two decades, most of them are population-based, undergo many steps along with several parameters that make them hard to understand and code. In addition, there are same procedures in recent metaheuristics which make them similar. So, the researchers usually are confused to select a metaheuristic and cannot find any superiority or at least in any algorithms. Because of this, the researchers still use the old algorithms instead of the recent ones. Contrary to previous work, this paper aims to develop a simple, intelligent and new single-solution algorithm that has just four main steps and three simple parameters to tune. Social Engineering Optimizer (SEO) starts with two initial solutions divided into attacker and defender. The attacker obtains the rules of Social Engineering techniques to reach its desired goals. By these simple features, the algorithm does precisely both intensification and diversification phases. The basis of the algorithm depends on how an attacker attacks to a defender by four different associated techniques. Finally, the proposed SEO is applied to solve a set of benchmark functions, important engineering and multi-objective optimization problems. The result shows its superiority in comparison with other well-known and recent meta-heuristics. A new single-solution meta-heuristic approach inspired by Social Engineering is developed.The proposed easy and intelligent method has four main steps and just three simple parameters to tune.The SEO is tested on the different benchmark functions, engineering and also multi-objective optimization problems.The algorithm gives the opportunity to a user to select the suitable technique among four ones.The results confirm the performance and effectiveness of SEO in practice.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2013.12.007 · Cited by 19,343
The Whale Optimization Algorithm
Mirjalili, S., & Lewis, A. (2016) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2016.01.008 · Cited by 14,581
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
GSA: A Gravitational Search Algorithm
Rashedi, E., Nezamabadi-pour, H., & Saryazdi, S. (2009) · Information Sciences · doi:10.1016/j.ins.2009.03.004 · Cited by 7,358
Cited by
Sowmya, R., Premkumar, M., & Jangir, P. (2024) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2023.107532 · Cited by 500
Artificial ecosystem-based optimization: a novel nature-inspired meta-heuristic algorithm
Zhao, W., Wang, L., & Zhang, Z. (2020) · Neural Computing and Applications · doi:10.1007/s00521-019-04452-x · Cited by 499
Red deer algorithm (RDA): a new nature-inspired meta-heuristic
Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R. (2020) · Soft Computing · doi:10.1007/s00500-020-04812-z · Cited by 443
Self-citationShahmansouri, A. A., Yazdani, M., Ghanbari, S., Akbarzadeh Bengar, H., Jafari, A., & Farrokh Ghatte, H. (2021) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2020.123697 · Cited by 353
Walrus optimizer: A novel nature-inspired metaheuristic algorithm
Han, M., Du, Z., Yuen, K. F., Zhu, H., Li, Y., & Yuan, Q. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122413 · Cited by 315
Metadata
- Authors
- Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R.
- Venue
- Engineering Applications of Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2018-06
- Volume
- 72
- Pages
- 267-293
- ISSN
- 0952-1976 (ISSN-L)
- OpenAlex
- W2802800902
- Cited by
- 279
- References
- 84
- FWCI
- 16.97
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Social Engineering Optimizer (SEO). https://app.cochat.ai/papers/10.1016/j.engappai.2018.04.009
- The paper
- Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R. (2018). The Social Engineering Optimizer (SEO). Engineering Applications of Artificial Intelligence. https://doi.org/10.1016/j.engappai.2018.04.009
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.