A New Optimization Algorithm Based on Search and Rescue Operations

Chapter 15 - A novel sound source localization method using a global-best guided cuckoo search algorithm for drone-based search and rescue operations

A modified reptile search algorithm for global optimization and image segmentation: Case study brain MRI images

Despite there being some researches about unmanned aerial vehicle (UAV), operations with this kind of robots are not yet occurring in search and rescue (SAR) operations. Using adaptive concepts, a Cooperative UAV model applied to search and rescue operations applied is proposed. The adaptive concepts are well suited to the dynamism present in search operations in unknown environment. Thus, applying adaptiveness, each UAV takes decision in order to best accomplish the goal. Simulations were carried out and the results observed show that the model reduces until 75% of the search time (comparing with a manned search using the SAR navigation rules). Furthermore, related works, UAV evolution, conclusion and future works suggestions are presented.

Real-world optimization problems in engineering, logistics, and resource allocation are often constrained and multi-modal, posing a challenge for traditional optimization algorithms. Metaheuristic algorithms inspired by natural and artificial phenomena have shown promise, but many fail to balance exploration and exploitation effectively, especially under stringent constraints. Existing algorithms such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO), and Differential Evolution (DE) face issues in convergence speed and constraint handling, particularly in high-dimensional spaces or when constraints are dynamic or complex. We propose an Adaptive Pattern-Driven Optimization (APDO) algorithm, a novel tailor-inspired metaheuristic that mimics the adaptive decision-making process of a tailor designing garments. APDO integrates three primary operators—Pattern Selection, Fabric Adjustment, and Stitch Reinforcement—to handle constraints adaptively. The algorithm combines pattern memory (historical bests), probabilistic pattern mutation, and a constraint-domination principle to ensure feasibility and diversity. The core idea is to iteratively “cut and stitch” solutions to adapt the search process, enabling dynamic constraint satisfaction and global optimization. We benchmarked APDO against five popular methods (GA, PSO, DE, Firefly Algorithm, and Whale Optimization Algorithm) on a suite of 10 real-world constrained problems, including mechanical component design and energy scheduling tasks. APDO outperformed all baselines in terms of convergence speed, constraint satisfaction rate, and solution quality. In particular, APDO achieved an average feasibility rate of 97.6% and an improvement of 4.2–11.8% in best fitness across problems.

Grey-Wolf Optimizer (GWO) and Salp-Swarm Algorithm (SSA) are among the recent metaheuristic algorithms that have shown considerable potential in solving practical problems. Nevertheless, these optimisation methods usually suffer from a poor performance, especially when dealing with multimodal and high-dimensional problems. To overcome drawbacks of these algorithms, a new population-based global optimisation algorithm inspired by GWO and SSA is proposed in this paper. The basic idea behind the proposed approach is to divide the population into two groups that adopt new position updating strategies. The movement method of the first group is inspired by the hunting mechanism used in GWO algorithm. On the other hand, the population of the second group moves into the search space using a new strategy based on the position updating method employed by the follower salps in SSA. The performances of the proposed algorithm, named GW-SSA, have been studied through 23 benchmark functions of different types and dimensions. The obtained results were statistically analysed using Wilcoxon signed-rank. Furthermore, GW-SSA algorithm has been applied to solve four real engineering design problems. The experimental results show the superior performance of GW-SSA compared to GWO, SSA and other recently proposed optimisation algorithms.

Metaheuristic algorithms are constructed to solve optimization problems, but they cannot solve all the problems with best solutions. This work proposes a novel self-adaptive metaheuristic optimization algorithm, named Optimal Stochastic Process Optimizer (OSPO), which can solve different kinds of optimization problems with promising performance. Specifically, OSPO regards the procedure of optimization as a realization of stochastic process, and with the help of Subjective Probability Distribution Function (SPDF) and Receding Sampling Strategy proposed in this paper, OSPO can control the exploration-exploitation property online by the adaptive modification of the parameters in SPDF. This adaptive exploration-exploitation property of OSPO contributes to dealing with different kinds of problems; thus, it makes OSPO have the potential to solve at least a vast majority of optimization problems. The proposed algorithm is first benchmarked on uni-modal, multi-modal and composite test functions both in low and high dimensions. The results are verified by comparative studies with seven well-performed metaheuristic algorithms. Then, 21 real-world optimization problems are used to further investigate the effectiveness of OSPO. The winners of CEC2020 Competition on Real-World Single Objective Constrained Optimization, SASS algorithm, sCMAgES algorithm, EnMODE algorithm and COLSHADE algorithm are used as four comparative algorithms in real-world optimization problems. The analysis of simulations demonstrates that OSPO is able to provide very competitive performance compared to the comparative meta-heuristics both in benchmark functions and in real-world optimization problems; thus, the potential of OSPO to solve at least a vast majority of optimization problems is verified. A corresponding MATLAB APP demo is available on https://github.com/JiahongXu123/OSPO-algorithm.git.

Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems, yet existing methods often struggle with balancing exploration and exploitation across diverse problem landscapes. This paper proposes a novel nature-inspired metaheuristic optimization algorithm named the Painted Wolf Optimization (PWO) algorithm. The main inspiration for the PWO algorithm is the group behavior and hunting strategy of painted wolves, also known as African wild dogs in the wild, particularly their unique consensus-based voting rally mechanism, a behavior fundamentally distinct from the social dynamics of grey wolves. In this innovative process, pack members explore different areas to find prey; then, they hold a pre-hunting voting rally based on the alpha member to determine who will begin the hunt and attack the prey. The efficiency of the proposed PWO algorithm is evaluated by a comparison study with other well-known optimization algorithms on 33 test functions, including the Congress on Evolutionary Computation (CEC) 2017 suite and different real-world engineering design cases. Furthermore, the algorithm’s performance is further tested across a spectrum of optimization problems with extensive unknown search spaces. This includes its application within the field of cybersecurity, specifically in the context of training a machine learning-based intrusion detection system (ML-IDS), achieving an accuracy of 0.90 and an F-measure of 0.9290. Statistical analyses using the Wilcoxon signed-rank test (all p<0.05) indicate that the PWO algorithm outperforms existing state-of-the-art algorithms, providing superior solutions in diverse and unpredictable optimization landscapes. This demonstrates its potential as a robust method for tackling complex optimization problems in various fields. The source code for the PWO algorithm is publicly available at https://github.com/saeidsheikhi/Painted-Wolf-Optimization.

— In this paper, two optimization algorithms i.e., Particle Swarm Optimization (PSO) and Gravitational Search Algorithm (GSA) are combined to produce a hybrid population-based algorithm PSOGSA. The approach of HPSOGSA is to use the assessment of PSO using the social thinking capability and the manipulation of GSA using the local search proficiency. To increase the performance of HPSOGSA, some benchmark functions are used. Two standard database ORL and YALE is used to assess the classification performance of the proposed method. Classification accuracy is compared for diverse number of training samples per class. Further lead of proposed method is confirmed by analyzing percentage improvement in classification accuracy. With limited accessibility of training sample, percentage enhancement is very successful for face recognition applications. Keywords: Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Particle Swarm Optimization and Gravitational Search Algorithm (PSOGSA), Hybrid Particle Swarm Optimization and Gravitational Search Algorithm (HPSOGSA). Cite this Article Purvaa Saxena, Gargi Mishra, Apoorva Aggarwal, Ayush Priyadarshi, Nitin Kumar, Rahul. Pattern Recognition Using Hybrid Meta-Heuristic. Journal of Artificial Intelligence Research & Advances. 2019; 6(2): 100–108p.

A novel metaheuristic algorithm has been presented based on the physical significance of palm tree leaves and petioles, which can themselves water and fertilize with their unique architecture. Palm tree leaves collect almost all the raindrops that fall on the tree, which drags the nutrient-rich dropping of crawlers and birds that inhabit it and funnel them back to the palm tree’s roots. The proposed Palm Tree Optimization (PTO) algorithm is based on two main stages of rainwater before it reaches the trunk. Stage one is that the rainwater drops search for petioles in the local search space of a particular leaf, and stage two involves that the rainwater drops after reaching the petioles search for trunk to funnel back to the root along with nutrients. The performance of PTO in searching for global optima is tested on 33 Standard Benchmark Functions (SBF), 29 constrained optimization problems from IEEE-CEC2017 and real-world optimization problems from IEEE-CEC2011 competition especially for testing the evolutionary algorithms. Mathematical benchmark functions are classified into six groups as unimodal, multimodal, plate &amp; valley-shaped, steep ridges, hybrid functions and composition functions which are used to check the exploration and exploitation capabilities of the algorithm. The experimental results prove the effectiveness of the proposed algorithm with better search ability over different classes of benchmark functions and real-world applications.

The need for search and rescue (SAR) operations arises in various situations: natural disasters such as earthquakes, hurricanes, floods or avalanches, accidents, etc. It is known that the large volume and diversity of the identified area, the limited view, dangerous conditions and the presence of victims in remote or hard-to-reach places complicate such work. The use of advanced technologies such as robotics in improving the efficiency of search and rescue operations to solve problems in these cases allows us to obtain rational solutions. A robotic assistant for search and rescue operations has been developed, a 3D model has been developed. The robot is controlled autonomously or remotely, overcome difficult terrain, collect data and perform tasks that contribute to the search and rescue process. Internet of Things devices and sensors interact over the network, allowing you to collect, analyze and share data in real time. The Arduino board was chosen to create the project. The device circuit was assembled and the operation of the sensors was combined. The device used an ultrasonic sensor, a camera, LED lamps and a speaker for the sound of a siren. The robot assistant works in both offline and manual modes. The device is controlled via a web interface, and the video received by the camera is provided in real time. The wheels of the device can move over any terrain, and the device is designed so that it can move on both sides (under and over).

Optimization is a crucial part of every field that requires computation and plays an important role in modern optimization. Metaheuristics algorithms are stochastic algorithms designed in such a way that they don't require the calculation of gradient for optimization. Hence they can be used for optimizing non-linear functions too. Since most real-world optimization problems are non-linear in nature, algorithms provide a sufficiently good solution (close to actual solution) for such optimization problems. This paper is aimed to explain the Genetic Algorithm(GA), Simulated Annealing(SA), and Particle Swarm Optimization(PSO) and compare their performance on benchmark functions. Benchmark functions provides a baseline measurement of the performance of algorithms and allows the algorithm to be compared to some other algorithms in the same manner. The algorithm runs on these functions with an aim to locate an optimal position. The performance and the results obtained can be affected by the parameter setting or operations inside each method. Based on the results, PSO performed better compared to GA and SA in obtaining best minimum fitness.

A diffusion algorithm based on P systems for continuous global optimization

A labor division artificial bee colony algorithm based on behavioral development

Biochemical parameter estimation vs. benchmark functions: A comparative study of optimization performance and representation design

Hippopotamus algorithm for optimal sizing of hybrid renewable energy system