A new approach for solving global optimization and engineering problems based on modified Sea Horse Optimizer

• URL: http://arxiv.org/abs/2402.14044v1
• Date: Wed, 21 Feb 2024 11:28:00 GMT
• Title: A new approach for solving global optimization and engineering problems based on modified Sea Horse Optimizer
• Authors: Fatma A. Hashim, Reham R. Mostafa, Ruba Abu Khurma, Raneem Qaddoura and P.A. Castillo
• Abstract summary: Sea Horse (SHO) is a metaheuristic algorithm that emulates various intelligent behaviors exhibited by sea horses. To mimic the nuanced locomotion of sea horses, SHO integrates the logarithmic helical equation and Levy flight. This study introduces a robust and high-performance variant of the SHO algorithm named mSHO.
• Score: 1.84493167882938
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Sea Horse Optimizer (SHO) is a noteworthy metaheuristic algorithm that emulates various intelligent behaviors exhibited by sea horses, encompassing feeding patterns, male reproductive strategies, and intricate movement patterns. To mimic the nuanced locomotion of sea horses, SHO integrates the logarithmic helical equation and Levy flight, effectively incorporating both random movements with substantial step sizes and refined local exploitation. Additionally, the utilization of Brownian motion facilitates a more comprehensive exploration of the search space. This study introduces a robust and high-performance variant of the SHO algorithm named mSHO. The enhancement primarily focuses on bolstering SHO's exploitation capabilities by replacing its original method with an innovative local search strategy encompassing three distinct steps: a neighborhood-based local search, a global non-neighbor-based search, and a method involving circumnavigation of the existing search region. These techniques improve mSHO algorithm's search capabilities, allowing it to navigate the search space and converge toward optimal solutions efficiently. The comprehensive results distinctly establish the supremacy and efficiency of the mSHO method as an exemplary tool for tackling an array of optimization quandaries. The results show that the proposed mSHO algorithm has a total rank of 1 for CEC'2020 test functions. In contrast, the mSHO achieved the best value for the engineering problems, recording a value of 0.012665, 2993.634, 0.01266, 1.724967, 263.8915, 0.032255, 58507.14, 1.339956, and 0.23524 for the pressure vessel design, speed reducer design, tension/compression spring, welded beam design, three-bar truss engineering design, industrial refrigeration system, multi-Product batch plant, cantilever beam problem, multiple disc clutch brake problems, respectively.

Related papers

• Scattered Forest Search: Smarter Code Space Exploration with LLMs [55.71665969800222]
  We introduce Scattered Forest Search to enhance solution diversity while searching for solutions. Experiments on HumanEval, MBPP, APPS, CodeContests, and Leetcode reveal significant performance improvements.
  arXiv  Detail & Related papers  (2024-10-22T01:58:29Z)
• Efficient Multiplayer Battle Game Optimizer for Adversarial Robust Neural Architecture Search [14.109964882720249]
  This paper introduces a novel metaheuristic algorithm, known as the efficient multiplayer battle game (EMBGO) The motivation behind this research stems from the need to rectify identified shortcomings in the original MBGO. EMBGO mitigates these limitations by integrating the movement and battle phases to simplify the original optimization framework and improve search efficiency.
  arXiv  Detail & Related papers  (2024-03-15T08:45:32Z)
• Structures vibration control via tuned mass dampers using a co-evolution coral reefs optimization algorithm [0.0]
  We tackle a problem of optimal design and location of Tuned Mass Dampers (TMDs) for structures subjected to earthquake ground motions. Specifically, the Coral Reefs Optimization (CRO) with Substrate Layer (CRO-SL) is proposed as a competitive co-evolution algorithm. The proposed approach is able to solve the TMD design and location problem, by exploiting the combination of different types of searching mechanisms.
  arXiv  Detail & Related papers  (2024-02-10T16:09:56Z)
• Hybrid Search method for Zermelo's navigation problem [0.24999074238880487]
  We present a novel algorithm called the Hybrid Search algorithm. It integrates the Zermelo's Navigation Initial Value Problem with the Ferraro-Mart'in de Diego-Almagro. We evaluate the performance of the Hybrid Search algorithm on synthetic vector fields and real ocean currents data.
  arXiv  Detail & Related papers  (2023-08-04T16:11:59Z)
• Hybrid ACO-CI Algorithm for Beam Design problems [0.4397520291340694]
  A novel hybrid version of the Ant colony optimization (ACO) method is developed using the sample space reduction technique of the Cohort Intelligence (CI) algorithm. The proposed work could be investigate for real world applications encompassing domains of engineering, and health care problems.
  arXiv  Detail & Related papers  (2023-03-29T04:37:14Z)
• Efficient Non-Parametric Optimizer Search for Diverse Tasks [93.64739408827604]
  We present the first efficient scalable and general framework that can directly search on the tasks of interest. Inspired by the innate tree structure of the underlying math expressions, we re-arrange the spaces into a super-tree. We adopt an adaptation of the Monte Carlo method to tree search, equipped with rejection sampling and equivalent- form detection.
  arXiv  Detail & Related papers  (2022-09-27T17:51:31Z)
• Learning Space Partitions for Path Planning [54.475949279050596]
  PlaLaM outperforms existing path planning methods in 2D navigation tasks, especially in the presence of difficult-to-escape local optima. These gains transfer to highly multimodal real-world tasks, where we outperform strong baselines in compiler phase ordering by up to 245% and in molecular design by up to 0.4 on properties on a 0-1 scale.
  arXiv  Detail & Related papers  (2021-06-19T18:06:11Z)
• AutoSpace: Neural Architecture Search with Less Human Interference [84.42680793945007]
  Current neural architecture search (NAS) algorithms still require expert knowledge and effort to design a search space for network construction. We propose a novel differentiable evolutionary framework named AutoSpace, which evolves the search space to an optimal one. With the learned search space, the performance of recent NAS algorithms can be improved significantly compared with using previously manually designed spaces.
  arXiv  Detail & Related papers  (2021-03-22T13:28:56Z)
• A novel machine learning-based optimization algorithm (ActivO) for accelerating simulation-driven engine design [0.0]
  The proposed approach is a surrogate-based scheme, where predictions of a weak leaner and a strong learner are utilized within an active learning loop. ActivO reduces the number of function evaluations needed to reach the global optimum, and thereby time-to-design by 80%.
  arXiv  Detail & Related papers  (2020-12-08T13:39:51Z)
• Evolving Search Space for Neural Architecture Search [70.71153433676024]
  We present a Neural Search-space Evolution (NSE) scheme that amplifies the results from the previous effort by maintaining an optimized search space subset. We achieve 77.3% top-1 retrain accuracy on ImageNet with 333M FLOPs, which yielded a state-of-the-art performance. When the latency constraint is adopted, our result also performs better than the previous best-performing mobile models with a 77.9% Top-1 retrain accuracy.
  arXiv  Detail & Related papers  (2020-11-22T01:11:19Z)
• Reinforcement Learning with Fast Stabilization in Linear Dynamical Systems [91.43582419264763]
  We study model-based reinforcement learning (RL) in unknown stabilizable linear dynamical systems. We propose an algorithm that certifies fast stabilization of the underlying system by effectively exploring the environment. We show that the proposed algorithm attains $tildemathcalO(sqrtT)$ regret after $T$ time steps of agent-environment interaction.
  arXiv  Detail & Related papers  (2020-07-23T23:06:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.