Author:
Gopi S.,Mohapatra Prabhujit
Abstract
AbstractIn recent years, many researchers have made a continuous effort to develop new and efficient meta-heuristic algorithms to address complex problems. Hence, in this study, a novel human-based meta-heuristic algorithm, namely, the learning cooking algorithm (LCA), is proposed that mimics the cooking learning activity of humans in order to solve challenging problems. The LCA strategy is primarily motivated by observing how mothers and children prepare food. The fundamental idea of the LCA strategy is mathematically designed in two phases: (i) children learn from their mothers and (ii) children and mothers learn from a chef. The performance of the proposed LCA algorithm is evaluated on 51 different benchmark functions (which includes the first 23 functions of the CEC 2005 benchmark functions) and the CEC 2019 benchmark functions compared with state-of-the-art meta-heuristic algorithms. The simulation results and statistical analysis such as the t-test, Wilcoxon rank-sum test, and Friedman test reveal that LCA may effectively address optimization problems by maintaining a proper balance between exploitation and exploration. Furthermore, the LCA algorithm has been employed to solve seven real-world engineering problems, such as the tension/compression spring design, pressure vessel design problem, welded beam design problem, speed reducer design problem, gear train design problem, three-bar truss design, and cantilever beam problem. The results demonstrate the LCA’s superiority and capability over other algorithms in solving complex optimization problems.
Publisher
Springer Science and Business Media LLC
Reference102 articles.
1. Yang, X.-S. Nature-inspired Metaheuristic Algorithms (Luniver press, 2010).
2. Abbasian, R., Mouhoub, M. & Jula, A. Solving graph coloring problems using cultural algorithms. In FLAIRS Conference (2011).
3. Shil, S. K., Mouhoub, M. & Sadaoui, S. An approach to solve winner determination in combinatorial reverse auctions using genetic algorithms. In Proc. of the 15th annual conference companion on Genetic and evolutionary computation, 75–76, https://doi.org/10.1145/2464576.2464611 (2013).
4. Mohapatra, P., Das, K. N. & Roy, S. An improvised competitive swarm optimizer for large-scale optimization. Soft Comput. Probl. Solv. SocProS 2017(2), 591–601. https://doi.org/10.1007/978-981-13-1595-4_47 (2018).
5. Mohapatra, P., Das, K. N., Roy, S., Kumar, R. & Dey, N. A novel multi-objective competitive swarm optimization algorithm. Int. J. Appl. Metaheur. Comput. (IJAMC) 11, 114–129. https://doi.org/10.4018/IJAMC.2020100106 (2020).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献