Abstract
A newly defined “linear constrained optimization method” (LiCOM), as a novel meta-exploratory optimization technique, is presented here to carry out optimal design of engineering problems. Each problem encountered has a response space inside which the optimal solution is located. The method proposed in this paper uses two important elements in the search space. For the first division, a geometry constraint is used. In fact, instead of defining search points within the allowable range of a variable, these points are defined within a specific range. In LiCOM, the feasible domain decreases in size during problem solving. The second division is mainly based on meta-exploratory characteristics built into the proposed algorithm, including a random-based distribution of the search points in the response space. In order to prevent locking in the local optimums, meta-heuristic algorithms randomly distribute a number of different search points in the response space. In this paper, solutions to some competitive benchmark problems have been attempted, suitable for testing the performance of the proposed LiCOM. The attained results were compared with some conventional methods reported in the literature, affirming a significant improvement on the results obtained by the LiCOM introduced.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Askarzadeh A, Rezazadeh A (2012) A new heuristic optimization algorithm for modeling of proton exchange membrane fuel cell: bird mating optimizer. Int J Energy Res 37(10):1196–1204. https://doi.org/10.1002/er.2915
Belegundu AD, Arora JS (1985) A study of mathematical programming methods for structural optimization, part I: theory. Int J Numer Methods Eng 21(9):1583–1599. https://doi.org/10.1002/nme.1620210904
Chou JS, Truong DN (2021) A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean. Appl Math Comput. https://doi.org/10.1016/j.amc.2020.125535
Coello CAC, Montes EM (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inform 16(3):193–203. https://doi.org/10.1016/S1474-0346(02)00011-3
Degertekin SO (2012) Improved harmony search algorithms for sizing optimization of truss structures. Comput Struct 92–93:229–241. https://doi.org/10.1016/j.compstruc.2011.10.022
Dhawale D, Kamboj VK, Anand P (2023) An improved Chaotic Harris Hawks Optimizer for solving numerical and engineering optimization problems. Eng Comput 39:1183–1228. https://doi.org/10.1007/s00366-021-01487-4
Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell 1(4):28–39. https://doi.org/10.1109/MCI.2006.329691
Erbatur F, Hasancebi O, Tutuncu I, Kilic H (2000) (2000), Optimal design of planar and space structures with genetic algorithms. Comput Struct 75(2):209–224. https://doi.org/10.1016/S0045-7949(99)00084-X
Erol OK, Eksin I (2006) A new optimization method: big bang–big crunch. Adv Eng Softw 37(2):106–111. https://doi.org/10.1016/j.advengsoft.2005.04.005
Eskandar H, Sadollah A, Bahreininejad A, Hamdi M (2012) Water cycle algorithm—a novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput Struct 110:151–166. https://doi.org/10.1016/j.compstruc.2012.07.010
Formato RA (2007) Central force optimization: a new metaheuristic with applications in applied electromagnetics. Prog Electromagn Res 77:425–491
Gandomi AH, Alavi AH (2012) Krill Herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17(12):4831–4845. https://doi.org/10.1016/j.cnsns.2012.05.010
Gupta S, Deep K (2020) A memory-based Grey Wolf Optimizer for global optimization tasks. Appl Soft Comput. https://doi.org/10.1016/j.asoc.2020.106367
He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20(1):89–99. https://doi.org/10.1016/j.engappai.2006.03.003
Holland JH (1992) Genetic algorithms. Sci Am 267:66–72
Kennedy J, Eberhart R. (1995) Particle swarm optimization. In Proceedings of the 1995 IEEE international conference on neural networks, pp 1942–1948
Khan MR, Willmert KD, Thornton WA (1979) An optimality criterion method for large-scale structures. AIAA J 17(7):753–761. https://doi.org/10.2514/3.61214
Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680. https://doi.org/10.1126/science.220.4598.671
Kitaoka H, Ki A, Nishi N (2022) Improvement of the Nelder–Mead method using direct inversion in iterative subspace. Optim Eng 23:1033–1055. https://doi.org/10.1007/s11081-021-09620-4
Lamghari A, Dimitrakopoulos R, Senécal R (2022) A matheuristic approach for optimizing mineral value chains under uncertainty. Optim Eng 23:1139–1164. https://doi.org/10.1007/s11081-021-09629-9
Lee KS, Geem ZW (2004) A new structural optimization method based on the harmony search algorithm. Comput Struct 82(9–10):781–798. https://doi.org/10.1016/j.compstruc.2004.01.002
Li Y, Lian S (2018) Improved fruit fly optimization algorithm incorporating Tabu search for optimizing the selection of elements in trusses. KSCE J Civ Eng 22:4940–4954. https://doi.org/10.1007/s12205-017-2000-0
Li Y, Han M, Guo Q (2020) Modified whale optimization algorithm based on tent chaotic mapping and its application in structural optimization. KSCE J Civ Eng 24:3703–3713. https://doi.org/10.1007/s12205-020-0504-5
Liu Q, Li N, Jia H, Qi Q, Abualigah L, Liu Y (2022) A Hybrid arithmetic optimization and golden sine algorithm for solving industrial engineering design problems. Mathematics 10(9):1567. https://doi.org/10.3390/math10091567
Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst. https://doi.org/10.1016/j.knosys.2015.07.006
Ong YS, Keane AJ (2004) Meta-Lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8(2):99–110. https://doi.org/10.1109/TEVC.2003.819944
Pan W-T (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl-Based Syst 26:69–74. https://doi.org/10.1016/j.knosys.2011.07.001
Rashedi E, Nezamabadi Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248. https://doi.org/10.1016/j.ins.2009.03.004
Rastgoo R, Sattari-Naeini V (2018) GSOMCR: Multi-constraint genetic-optimized QoS-aware routing protocol for smart grids. Iran J Sci Technol Trans Electr Eng 42:185–194. https://doi.org/10.1007/s40998-018-0056-6
Schmit LA Jr, Farshi B (1974) Some approximation concepts for structural synthesis. AIAA J 12(5):692–699. https://doi.org/10.2514/3.49321
Taheri A, RahimiZadeh K, Rao RV (2021) An efficient balanced teaching-learning-based optimization algorithm with Individual restarting strategy for solving global optimization problems. Inf Sci 576:68–104. https://doi.org/10.1016/j.ins.2021.06.064
Webster B, Bernhard PJ (2003) A local search optimization algorithm based on natural principles of gravitation. In: Proceedings of the 2003 international conference on information and knowledge engineering (IKE’03), pp 255–261
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Ghasemi, M.R., Haji Aghajanpour, N. & Ghohani Arab, H. Linear Constrained Optimization Method (LiCOM): A Novel Paradigm to Handle Engineering Optimization Problems. Iran J Sci Technol Trans Civ Eng 48, 453–465 (2024). https://doi.org/10.1007/s40996-023-01267-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40996-023-01267-8