MOSMA: Multi-Objective Slime Mould Algorithm Based on Elitist Non-Dominated Sorting
Open accessThe DOI matches its Crossref record; 64 of the 64 references it cites were found in a registry or an index.
Abstract
This paper proposes a multi-objective Slime Mould Algorithm (MOSMA), a multi-objective variant of the recently-developed Slime Mould Algorithm (SMA) for handling the multi-objective optimization problems in industries. Recently, for handling optimization problems, several meta-heuristic and evolutionary optimization techniques have been suggested for the optimization community. These methods tend to suffer from low-quality solutions when evaluating multi-objective optimization (MOO) problems than addressing the objective functions of identifying Pareto optimal solutions’ accurate estimation and increasing the distribution throughout all objectives. The SMA method follows the logic gained from the oscillation behaviors of slime mould in the laboratory experiments. The SMA algorithm shows a powerful performance compared to other well-established methods, and it is designed by incorporating the optimal food path using the positive-negative feedback system. The proposed MOSMA algorithm employs the same underlying SMA mechanisms for convergence combined with an elitist non-dominated sorting approach to estimate Pareto optimal solutions. As a posteriori method, the multi-objective formulation is maintained in the MOSMA, and a crowding distance operator is utilized to ensure increasing the coverage of optimal solutions across all objectives. To verify and validate the performance of MOSMA, 41 different case studies, including unconstrained, constrained, and real-world engineering design problems are considered. The performance of the MOSMA is compared with Multiobjective Symbiotic-Organism Search (MOSOS), Multi-objective Evolutionary Algorithm Based on Decomposition (MOEA/D), and Multiobjective Water-Cycle Algorithm (MOWCA) in terms of different performance metrics, such as Generational Distance (GD), Inverted Generational Distance (IGD), Maximum Spread (MS), Spacing, and Run-time. The simulation results demonstrated the superiority of the proposed algorithm in realizing high-quality solutions to all multi-objective problems, including linear, nonlinear, continuous, and discrete Pareto optimal front. The results indicate the effectiveness of the proposed algorithm in solving complicated multi-objective problems. This research will be backed up with extra online service and guidance for the paper’s source code athttps://premkumarmanoharan.wixsite.com/mysiteandhttps://aliasgharheidari.com/SMA.html. Also, the source code of SMA is shared with the public athttps://aliasgharheidari.com/SMA.html.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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 · cited 2×
“Some of the most popular algorithms in EMOO are the Non-dominated Sorting Genetic Algorithm (NSGA) [44], Multi-objective PSO (MOPSO) [49], and Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D) [67].”
MethodGenetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
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 · cited 1×
“A well-known principle, called No Free Lunch theory, has claimed in this regard that there is no single algorithm to solve optimization problems altogether [33].”
BackgroundMuiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Slime mould algorithm: A new method for stochastic optimization
Li, S., Chen, H., Wang, M., Heidari, A. A., & Mirjalili, S. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.03.055 · Cited by 3,036 · cited 3×
“This work focuses on a posteriori algorithm by proposing the multi-objective version of a recently-proposed metaheuristic called Slime Mould Optimizer (SMA) 1 algorithm [34].”
BackgroundMethodInfluentialSelf-citationMultiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Li, H., & Zhang, Q. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.925798 · Cited by 2,543 · cited 2×
“Many decomposition-based algorithms are reported, and the following are the three optimizers adopting the proposed MOEA/D [67], MOMH/D [55], decomposition-based archiving approach [56], and Dynamic interval multi-objective optimization problems [57].”
MethodScalable Test Problems for Evolutionary Multiobjective Optimization
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2005) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-137-7_6 · Cited by 2,010
A Survey on Evolutionary Computation Approaches to Feature Selection
Xue, B., Zhang, M., Browne, W. N., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2504420 · Cited by 1,841 · cited 1×
“Many decomposition-based algorithms are reported, and the following are the three optimizers adopting the proposed MOEA/D [67], MOMH/D [55], decomposition-based archiving approach [56], and Dynamic interval multi-objective optimization problems [57].”
MethodThe weighted sum method for multi-objective optimization: new insights
Marler, R. T., & Arora, J. S. (2010) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-009-0460-7 · Cited by 1,841 · cited 1×
“From detailed literature, it is observed that priori methods are faced with specific problems in tackling multi-objective difficulties, trapped in local optima, having high computational time, and problems emerging from priori method structures [41].”
BackgroundEvolutionary multi-objective optimization: a historical view of the field
Coello Coello, C. A. (2006) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2006.1597059 · Cited by 1,446
Multiobjective optimization Test Instances for the CEC 2009 Special Session and Competition
Zhang, Q., Zhou, A., Zhao, S.-Z., Suganthan, P. N., Liu, W., & Tiwari, S. K. (2009) · Cited by 1,343
Knowles, J., & Corne, D. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.781913 · Cited by 1,278 · cited 4×
“In the area of EMOO’s famousmulti-objective optimizers, the literature isMOEA/D, NSGA-II, MOPSO, Pareto Archived Evolutionary [36], and Prato-frontier Differential Evolution (PDE) [37].”
BackgroundMethodInfluentialA Knee Point-Driven Evolutionary Algorithm for Many-Objective Optimization
Zhang, X., Tian, Y., & Jin, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2378512 · Cited by 867
Mirjalili, S., Jangir, P., & Saremi, S. (2017) · Applied Intelligence · doi:10.1007/s10489-016-0825-8 · Cited by 746 · cited 1×
“The sub-field of evolutionary computation to solve such problems is called Evolutionary Multi-Objective Optimization (EMOO) [31], which deals with the philosophy and submissions of multi-objective evolutionary algorithms [30]–[32].”
BackgroundSelf-citationAdaptive weighted-sum method for bi-objective optimization: Pareto front generation
Kim, I. Y., & de Weck, O. L. (2005) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-004-0465-1 · Cited by 687 · cited 1×
“As discussed above, such algorithms are divided into three classes: aggregation (a priori) method [38], a posteriorimethod [39], and interactive methods [40].”
MethodPareto Multi Objective Optimization
Ngatchou, P., Zarei, A., & El-Sharkawi, A. (2006) · Proceedings of the 13th International Conference on, Intelligent Systems Application to Power Systems · doi:10.1109/isap.2005.1599245 · Cited by 664 · cited 6×
“However, the disadvantage of a priori methods is the applicability to only convex parts failure in finding Pareto optimal solution in non-convex regions of the Pareto fronts [35].”
BackgroundMethodInfluentialA theoretical framework of a BIM-based multi-disciplinary collaboration platform
Singh, V., Gu, N., & Wang, X. (2011) · Automation in Construction · doi:10.1016/j.autcon.2010.09.011 · Cited by 625 · cited 2×
“…but practitioners face them in any discipline, especially fuzzy optimization [3], location-based services [4], traffic management [5], neural networks [6], wireless sensor networks [7]–[9], hon-eynet potency [10], monitoring [11], [12], computer-aided design [13], and Internet of things [14].”
BackgroundPDE: a Pareto-frontier differential evolution approach for multi-objective optimization problems
Abbass, H. A., Sarker, R., & Newton, C. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934295 · Cited by 524 · cited 1×
“In the area of EMOO’s famous multi-objective optimizers, the literature is MOEA/D, NSGA-II, MOPSO, Pareto Archived Evolutionary [36], and Prato-frontier Differential Evolution (PDE) [37].”
BackgroundA Swarm Metaphor for Multiobjective Design Optimization
Ray, T., & Liew, K. M. (2002) · Engineering Optimization · doi:10.1080/03052150210915 · Cited by 431
Osyczka, A., & Kundu, S. (1995) · Structural and Multidisciplinary Optimization · doi:10.1007/bf01743536 · Cited by 403 · cited 1×
“Constrained benchmark with 2-objectives (TNK, KITA, CONSTR, OSY & SRN) [69]–[73].”
Zhang, Y., Gong, D.-W., & Cheng, J. (2017) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2015.2476796 · Cited by 379 · cited 4×
“Some of the most popular algorithms in EMOO are the Non-dominated Sorting Genetic Algorithm (NSGA) [44], Multi-objective PSO (MOPSO) [49], and Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D) [67].”
MethodInfluentialOptimization of problems with multiple objectives using the multi-verse optimization algorithm
Mirjalili, S., Jangir, P., Mirjalili, S. Z., Saremi, S., & Trivedi, I. N. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.07.018 · Cited by 369 · cited 2×
“The sub-field of evolutionary computation to solve such problems is called Evolutionary Multi-Objective Optimization (EMOO) [31], which deals with the philosophy and submissions of multi-objective evolutionary algorithms [30]–[32].”
BackgroundSelf-citationGuidance in evolutionary multi-objective optimization
Branke, J., Kaussler, T., & Schmeck, H. (2001) · Advances in Engineering Software · doi:10.1016/s0965-9978(00)00110-1 · Cited by 330 · cited 1×
“As discussed above, such algorithms are divided into three classes: aggregation ( a priori ) method [38], a posteriori method [39], and interactive methods [40].”
MethodXie, J., Wen, D., Liang, L., Jia, Y., Gao, L., & Lei, J. (2018) · JMIR mHealth and uHealth · doi:10.2196/mhealth.9754 · Cited by 310 · cited 1×
“These kinds of models and instances are not only limited to function optimization, but practitioners face them in any discipline, especially fuzzy optimization [3], location-based services [4], traffic management [5], neural networks [6], wireless sensor networks [7]–[9], honeynet potency [10], monitoring [11], [12],…”
BackgroundPareto or Non-Pareto: Bi-Criterion Evolution in Multiobjective Optimization
Li, M., Yang, S., & Liu, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2504730 · Cited by 309 · cited 1×
“• Unconstrained ZDT & CEC-2009 benchmarks with 2-objectives (ZDT1-ZDT4, ZDT6) & (UF1-UF10) [58]–[68].”
Liu, S., Chan, F. T. S., & Ran, W. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.01.059 · Cited by 301 · cited 1×
“Such problems often happen when we need to advance a decision-making model [1], [2].”
BackgroundMULTIOBJECTIVE DESIGN OPTIMIZATION BY AN EVOLUTIONARY ALGORITHM
RAY, T., TAI, K., & SEOW, K. C. (2001) · Engineering Optimization · doi:10.1080/03052150108940926 · Cited by 294
Zhang, Y., Gong, D.-W., & Ding, Z. (2012) · Information Sciences · doi:10.1016/j.ins.2011.06.004 · Cited by 288 · cited 6×
“Multi-objective Seagull Optimization Algorithm [45], MOEAs [46], NSGA-III [47], bare-bones multi-objective particle swarm optimization [48], MOPSO [49], multi-swarm cooperative multi-objective particle swarm optimizer [50], MOWCA [51], incremental learning hybridized with adaptive differential evolution [52],MOSOS [53…”
MethodInfluentialWater cycle algorithm for solving constrained multi-objective optimization problems
Sadollah, A., Eskandar, H., & Kim, J. H. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2014.10.042 · Cited by 282 · cited 1×
“…multi-objective particle swarm optimization [48], MOPSO [49], multi-swarm cooperative multi-objective particle swarm optimizer [50], MOWCA [51], incremental learning hybridized with adaptive differential evolution [52], MOSOS [53], and cooperative co-evolutionary optimization [54] are…”
MethodA Many-Objective Optimization Model of Industrial Internet of Things Based on Private Blockchain
Cao, B., Wang, X., Zhang, W., Song, H., & Lv, Z. (2020) · IEEE Network · doi:10.1109/mnet.011.1900536 · Cited by 245 · cited 1×
“These problems can be multi-objective [16] or later; they can have many objective forms [17], [18].”
BackgroundHybrid Microgrid Many-Objective Sizing Optimization With Fuzzy Decision
Cao, B., Dong, W., Lv, Z., Gu, Y., Singh, S., & Kumar, P. (2020) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2020.3026140 · Cited by 245 · cited 1×
“These problems can be multi-objective [16] or later; they can have many objective forms [17], [18].”
BackgroundInteraction of Edge-Cloud Computing Based on SDN and NFV for Next Generation IoT
Lv, Z., & Xiu, W. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2942719 · Cited by 236 · cited 1×
“…but practitioners face them in any discipline, especially fuzzy optimization [3], location-based services [4], traffic management [5], neural networks [6], wireless sensor networks [7]–[9], hon-eynet potency [10], monitoring [11], [12], computer-aided design [13], and Internet of things [14].”
BackgroundEnvironment-fusion multipath routing protocol for wireless sensor networks
Fu, X., Fortino, G., Pace, P., Aloi, G., & Li, W. (2020) · Information Fusion · doi:10.1016/j.inffus.2019.06.001 · Cited by 226
Interactive multiple objective optimization: Survey I—continuous case
Shin, W. S., & Ravindran, A. (1991) · Computers & Operations Research · doi:10.1016/0305-0548(91)90046-t · Cited by 208 · cited 3×
“There are several improvements in such techniques (e.g. [40]), but similar issues still exist.”
BackgroundMethodApplying graph-based differential grouping for multiobjective large-scale optimization
Cao, B., Zhao, J., Gu, Y., Ling, Y., & Ma, X. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.100626 · Cited by 207 · cited 1×
“Optimization problems appear in many fields, and in most real-world cases, it is required to optimize several objectives together [15].”
BackgroundMOBES : A multiobjective evolution strategy for constrained optimization problems
Binh, T. T. (1997) · international conference on Genetic algorithms · Cited by 194
Integration of BIM and GIS: Geometry from IFC to shapefile using open-source technology
Zhu, J., Wang, X., Wang, P., Wu, Z., & Kim, M. J. (2019) · Automation in Construction · doi:10.1016/j.autcon.2019.02.014 · Cited by 192 · cited 1×
“In the area of computer-aided design [13], [19], [20], computers assist practitioners in solving optimization problems.”
BackgroundGong, D., Xu, B., Zhang, Y., Guo, Y., & Yang, S. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2912204 · Cited by 181 · cited 3×
“A few of the indicators only measure the convergence performance (GD [53], etc.) or the diversity (Spacing [53], Spread [53], etc. of the PF collected, while others improve the impact of both convergence and diversity (Hyper Volume (HV) [54], IGD [55], etc.).”
BackgroundPanda, A., & Pani, S. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.04.030 · Cited by 164 · cited 6×
“In order to compare the diversity success of MOSMA, MOWCA, MOSOS, and MOEA/D with respect to Spacing and Spread metrics, the study runs 30 times individually on ZDT1-6, UF1-10, the constrained benchmark functions, such as TNK, KITA, CONSTR, OSY and SRN, and real-world engineering design constrained optimization proble…”
InfluentialMultiobjective structural optimization using a microgenetic algorithm
Coello, C. A. C., & Toscano‐Pulido, G. (2005) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-005-0527-z · Cited by 163
EMoSOA: a new evolutionary multi-objective seagull optimization algorithm for global optimization
Dhiman, G., Singh, K. K., Słowik, A., Chang, V. I. C., Yıldız, A. R., Kaur, A., & Garg, M. (2020) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-020-01189-1 · Cited by 145 · cited 2×
“Multi-objective Seagull Optimization Algorithm [45], MOEAs [46], NSGA-III [47], bare-bones multi-objective particle swarm optimization [48], MOPSO [49], multi-swarm cooperative multi-objective particle swarm optimizer [50], MOWCA [51], incremental learning hybridized with adaptive differential evolution [52], MOSOS [5…”
MethodZeng, G., Chen, J., Li, L., Chen, M.-R., Wu, L., Dai, Y., & Zheng, C. (2015) · Information Sciences · doi:10.1016/j.ins.2015.10.010 · Cited by 139
Zhu, J., Wang, X., Chen, M., Wu, P., & Kim, M. J. (2019) · Automation in Construction · doi:10.1016/j.autcon.2019.102859 · Cited by 135 · cited 1×
“In the area of computer-aided design [13], [19], [20], computers assist practitioners in solving optimization problems.”
BackgroundWater cycle algorithm for solving multi-objective optimization problems
Sadollah, A., Eskandar, H., Bahreininejad, A., & Kim, J. H. (2014) · Soft Computing · doi:10.1007/s00500-014-1424-4 · Cited by 129
Quantum-enhanced multiobjective large-scale optimization via parallelism
Cao, B., Fan, S., Zhao, J., Yang, P., Muhammad, K., & Tanveer, M. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100697 · Cited by 125 · cited 1×
“These problems can be multi-objective [16] or later; they can have many objective forms [17], [18].”
BackgroundChen, H., Qiao, H., Xu, L., Feng, Q., & Cai, K. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2933582 · Cited by 118 · cited 2×
“…of models and instances are not only limited to function optimization, but practitioners face them in any discipline, especially fuzzy optimization [3], location-based services [4], traffic management [5], neural networks [6], wireless sensor networks [7]–[9], hon-eynet potency [10], monitoring…”
BackgroundMethodSelf-citationA novel hybrid whale–Nelder–Mead algorithm for optimization of design and manufacturing problems
Yildiz, A. R. (2019) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-019-04532-1 · Cited by 115 · cited 3×
“Some of the well-regarded algorithms are Genetic Algorithm (GA) [42], Differential Evolution (DE) [22], Particle Swarm Optimization (PSO) [48], Whale optimizer algorithm with Nelder-Mead [23], Harris hawks optimization algorithm with Nelder-Mead [24], spotted hyena optimization [25], Seagull optimization algorithm [26…”
BackgroundMethodWen, D., Zhang, X., Liu, X., & Lei, J. (2017) · Journal of Medical Internet Research · doi:10.2196/jmir.6874 · Cited by 111 · cited 1×
“…but practitioners face them in any discipline, especially fuzzy optimization [3], location-based services [4], traffic management [5], neural networks [6], wireless sensor networks [7]–[9], hon-eynet potency [10], monitoring [11], [12], computer-aided design [13], and Internet of things [14].”
BackgroundChampasak, P., Panagant, N., Pholdee, N., Bureerat, S., & Yıldız, A. R. (2020) · Aerospace Science and Technology · doi:10.1016/j.ast.2020.105783 · Cited by 103 · cited 12×
“Results of the multi-objective algorithms (using IGD) on the selected engineering design optimization problems.”
BackgroundMethodInfluentialJangir, P., & Jangir, N. (2018) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2018.04.018 · Cited by 96 · cited 5×
“The sub-field of evolutionary computation to solve such problems is called Evolutionary Multi-Objective Optimization (EMOO) [31], which deals with the philosophy and submissions of multi-objective evolutionary algorithms [30]–[32].”
BackgroundInfluentialSelf-citationThresholds Based Image Extraction Schemes in Big Data Environment in Intelligent Traffic Management
Liu, Y., Yang, C., & Sun, Q. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.2994386 · Cited by 94 · cited 1×
“These kinds of models and instances are not only limited to function optimization, but practitioners face them in any discipline, especially fuzzy optimization [3], location-based services [4], traffic management [5], neural networks [6], wireless sensor networks [7]–[9], honeynet potency [10], monitoring [11], [12],…”
BackgroundButterfly optimization algorithm for optimum shape design of automobile suspension components
Yıldız, B. S., Yıldız, A. R., Albak, E. İ., Abderazek, H., Sait, S. M., & Bureerat, S. (2020) · Materials Testing · doi:10.1515/mt-2020-620406 · Cited by 93
A decomposition-based archiving approach for multi-objective evolutionary optimization
Zhang, Y., Gong, D., Sun, J., & Qu, B. (2017) · Information Sciences · doi:10.1016/j.ins.2017.11.052 · Cited by 86 · cited 1×
“Many decomposition-based algorithms are reported, and the following are the three optimizers adopting the proposed MOEA/D [67], MOMH/D [55], decomposition-based archiving approach [56], and Dynamic interval multi-objective optimization problems [57].”
MethodKarakoyun, M., Özkış, A., & Kodaz, H. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2020.106560 · Cited by 68
A simple differential evolution with time-varying strategy for continuous optimization
Sun, G., Xu, G., & Jiang, N. (2019) · Soft Computing · doi:10.1007/s00500-019-04159-0 · Cited by 66 · cited 1×
“Some of the well-regarded algorithms are Genetic Algorithm (GA) [42], Differential Evolution (DE) [22], Particle Swarm Optimization (PSO) [48], Whale optimizer algorithm with Nelder-Mead [23], Harris hawks optimization algorithm with Nelder-Mead [24], spotted hyena optimization [25], Seagull optimization algorithm [26…”
MethodHybrid evolutionary multi-objective optimization and analysis of machining operations
Deb, K., & Datta, R. (2011) · Engineering Optimization · doi:10.1080/0305215x.2011.604316 · Cited by 64
Balanced multi-objective optimization algorithm using improvement based reference points approach
Abdel‐Basset, M., Mohamed, R., & Abouhawwash, M. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100791 · Cited by 62
Deb, K., & Srinivasan, A. (2007) · Natural computing series · doi:10.1007/978-3-540-72964-8_12 · Cited by 60
Highly Efficient Privacy Preserving Location-Based Services with Enhanced One-Round Blind Filter
Li, X., Zhu, Y., & Wang, J. (2019) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2019.2926385 · Cited by 55 · cited 1×
“These kinds of models and instances are not only limited to function optimization, but practitioners face them in any discipline, especially fuzzy optimization [3], location-based services [4], traffic management [5], neural networks [6], wireless sensor networks [7]–[9], honeynet potency [10], monitoring [11], [12],…”
BackgroundThe spotted hyena optimization algorithm for weight-reduction of automobile brake components
Yıldız, B. S. (2020) · Materials Testing · doi:10.1515/mt-2020-620409 · Cited by 44 · cited 1×
“Some of the well-regarded algorithms are Genetic Algorithm (GA) [42], Differential Evolution (DE) [22], Particle Swarm Optimization (PSO) [48], Whale optimizer algorithm with Nelder-Mead [23], Harris hawks optimization algorithm with Nelder-Mead [24], spotted hyena optimization [25], Seagull optimization algorithm [26…”
MethodA theoretical method to evaluate honeynet potency
Ren, J., Zhang, C., & Hao, Q. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.08.021 · Cited by 43 · cited 1×
“…but practitioners face them in any discipline, especially fuzzy optimization [3], location-based services [4], traffic management [5], neural networks [6], wireless sensor networks [7]–[9], hon-eynet potency [10], monitoring [11], [12], computer-aided design [13], and Internet of things [14].”
BackgroundThe mine blast algorithm for the structural optimization of electrical vehicle components
Yıldız, B. S. (2020) · Materials Testing · doi:10.1515/mt-2020-620510 · Cited by 41
Nafchi, A. M., & Moradi, A. (2011) · Journal of solid mechanics. · Cited by 9
Cited by
A Comprehensive Review on Multi-objective Optimization Techniques: Past, Present and Future
Sharma, S., & Kumar, V. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09778-9 · Cited by 455
Hu, J., Gui, W., Heidari, A. A., Cai, Z., Liang, G., Chen, H., & Pan, Z. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.107761 · Cited by 197
Self-citation
Metadata
- Authors
- Premkumar, M., Jangir, P., Sowmya, R., Alhelou, H. H., Heidari, A. A., & Chen, H.
- Venue
- IEEE Access
- Published
- 2021
- Volume
- 9
- Pages
- 3229-3248
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3115290671
- Cited by
- 233
- References
- 64
- FWCI
- 15.01
- Type
- journal article
- Language
- en
- Open access
- gold
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
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.