Explore the vast range of titles available.

This chapter presents a nature-inspired ant colony optimization (ACO) technique, along with its modified variants. The improved versions of this optimization technique are slightly different and effective than that of its standard version. ACO has inspired from the foraging behavior of ant colony and its capability to seek the shortest path between their nest and food source. This optimization method is based on a natural phenomena known as pheromone trails, a substance laid down by ants especially when carrying food so that their fellow ants can sense and follow this path. The new ants entering into the ant system will follow the path with highest pheromone concentration. In this chapter, a brief overview of standard ACO is presented, followed by different variants of ACO since its development. The application of the ACO technique for real-life optimization problems is demonstrated by solving an optimal shunt capacitor allocation problem of 33-bus test distribution system for power loss minimization.

Swarm intelligence algorithms are a form of nature-based optimization algorithms. Their main inspiration is the cooperative behavior of animals within specific communities. This can be described as simple behaviors of individuals along with the mechanisms for sharing knowledge between them, resulting in the complex behavior of the entire community. Examples of such behavior can be found in ant colonies, bee swarms, schools of fish or bird flocks. Swarm intelligence algorithms are used to solve difficult optimization problems for which there are no exact solving methods or the use of such methods is impossible, e.g. due to unacceptable computational time. This set comprises two volumes: Swarm Intelligence Algorithms: A Tutorial and Swarm Intelligence Algorithms: Modifications and Applications. The first volume thoroughly presents the basics of 24 algorithms selected from the entire family of swarm intelligence algorithms. It contains a detailed explanation of how each algorithm works, along with relevant program codes in Matlab and the C ++ programming language, as well as numerical examples illustrating step-by-step how individual algorithms work. The second volume describes selected modifications of these algorithms and presents their practical applications. This book presents 24 swarm algorithms together with their modifications and practical applications. Each chapter is devoted to one algorithm. It contains a short description along with a pseudo-code showing the various stages of its operation. In addition, each chapter contains a description of selected modifications of the algorithm and shows how it can be used to solve a selected practical problem.

With the continuing advancements in technologies (such as machine to machine, wireless telecommunications, artificial intelligence, and big data analysis), the Internet of Things (IoT) aims to connect everything for information sharing and intelligent decision-making. Swarm intelligence (SI) provides the possibility of SI behavior through collaboration in individuals that have limited or no intelligence. Its potential parallelism and distribution characteristics can be used to realize global optimization and solve nonlinear complex problems. This paper reviews representative SI algorithms and summarizes their applications in the IoT. The main focus consists in the analysis of SI-enabled applications to wireless sensor network (WSN) and discussion of related research problems in the WSN. Also, we concluded SI-based applications in other IoT fields, such as SI in UAV-aided wireless network. Finally, possible research prospects and future trends are drawn.

Continuous advancements of technologies such as machine-to-machine interactions and big data analysis have led to the internet of things (IoT) making information sharing and smart decision-making possible using everyday devices. On the other hand, swarm intelligence (SI) algorithms seek to establish constructive interaction among agents regardless of their intelligence level. In SI algorithms, multiple individuals run simultaneously and possibly in a cooperative manner to address complex nonlinear problems. In this paper, the application of SI algorithms in IoT is investigated with a special focus on the internet of medical things (IoMT). The role of wearable devices in IoMT is briefly reviewed. Existing works on applications of SI in addressing IoMT problems are discussed. Possible problems include disease prediction, data encryption, missing values prediction, resource allocation, network routing, and hardware failure management. Finally, research perspectives and future trends are outlined.

One of the most widely referenced Swarm Intelligence (SI) algorithms is the Grey Wolf Optimizer (GWO), which is based on the pack hunting and natural leadership organization of grey wolves. The GWO algorithm offers several significant benefits, including simple implementation, rapid convergence, and superior convergence outcomes, leading to its effective application in diverse fields for solving optimization issues. Consequently, the GWO has rapidly garnered substantial research interest and a broad audience across numerous areas. To better understand the literature on this algorithm, this review paper aims to consolidate and summarize research publications that utilized the GWO. The paper begins with a concise introduction to the GWO, providing insight into its natural establishment and conceptual framework for optimization. It then lays out the theoretical foundation and key procedures involved in the GWO, following which it comprehensively examines the most recent iterations of the algorithm and categorizes them into parallel, modified, and hybridized variations. Subsequently, the primary applications of the GWO are thoroughly explored, spanning various fields such as computer science, engineering, energy, physics and astronomy, materials science, environmental science, and chemical engineering, among others. This review paper concludes by summarizing the key arguments in favour of GWO and outlining potential lines of inquiry in the future research.

Over previous decades, many nature-inspired optimization algorithms (NIOAs) have been proposed and applied due to their importance and significance. Some survey studies have also been made to investigate NIOAs and their variants and applications. However, these comparative studies mainly focus on one single NIOA, and there lacks a comprehensive comparative and contrastive study of the existing NIOAs. To fill this gap, we spent a great effort to conduct this comprehensive survey. In this survey, more than 120 meta-heuristic algorithms have been collected and, among them, the most popular and common 11 NIOAs are selected. Their accuracy, stability, efficiency and parameter sensitivity are evaluated based on the 30 black-box optimization benchmarking (BBOB) functions. Furthermore, we apply the Friedman test and Nemenyi test to analyze the performance of the compared NIOAs. In this survey, we provide a unified formal description of the 11 NIOAs in order to compare their similarities and differences in depth and a systematic summarization of the challenging problems and research directions for the whole NIOAs field. This comparative study attempts to provide a broader perspective and meaningful enlightenment to understand NIOAs.

Moth-flame optimization (MFO) algorithm inspired by the transverse orientation of moths toward the light source is an effective approach to solve global optimization problems. However, the MFO algorithm suffers from issues such as premature convergence, low population diversity, local optima entrapment, and imbalance between exploration and exploitation. In this study, therefore, an improved moth-flame optimization (I-MFO) algorithm is proposed to cope with canonical MFO’s issues by locating trapped moths in local optimum via defining memory for each moth. The trapped moths tend to escape from the local optima by taking advantage of the adapted wandering around search (AWAS) strategy. The efficiency of the proposed I-MFO is evaluated by CEC 2018 benchmark functions and compared against other well-known metaheuristic algorithms. Moreover, the obtained results are statistically analyzed by the Friedman test on 30, 50, and 100 dimensions. Finally, the ability of the I-MFO algorithm to find the best optimal solutions for mechanical engineering problems is evaluated with three problems from the latest test-suite CEC 2020. The experimental and statistical results demonstrate that the proposed I-MFO is significantly superior to the contender algorithms and it successfully upgrades the shortcomings of the canonical MFO.

The UAV pursuit-evasion problem focuses on the efficient tracking and capture of evading targets using unmanned aerial vehicles (UAVs), which is pivotal in public safety applications, particularly in scenarios involving intrusion monitoring and interception. To address the challenges of data acquisition, real-world deployment, and the limited intelligence of existing algorithms in UAV pursuit-evasion tasks, we propose an innovative swarm intelligence-based UAV pursuit-evasion control framework, namely “Boids Model-based DRL Approach for Pursuit and Escape” (Boids-PE), which synergizes the strengths of swarm intelligence from bio-inspired algorithms and deep reinforcement learning (DRL). The Boids model, which simulates collective behavior through three fundamental rules, separation, alignment, and cohesion, is adopted in our work. By integrating Boids model with the Apollonian Circles algorithm, significant improvements are achieved in capturing UAVs against simple evasion strategies. To further enhance decision-making precision, we incorporate a DRL algorithm to facilitate more accurate strategic planning. We also leverage self-play training to continuously optimize the performance of pursuit UAVs. During experimental evaluation, we meticulously designed both one-on-one and multi-to-one pursuit-evasion scenarios, customizing the state space, action space, and reward function models for each scenario. Extensive simulations, supported by the PyBullet physics engine, validate the effectiveness of our proposed method. The overall results demonstrate that Boids-PE significantly enhance the efficiency and reliability of UAV pursuit-evasion tasks, providing a practical and robust solution for the real-world application of UAV pursuit-evasion missions.

Particle Swarm Optimization (PSO) is a population-based metaheuristic belonging to the class of Swarm Intelligence (SI) algorithms. Nowadays, its effectiveness on many hard problems is no longer to be proven. Nevertheless, it is known to be strongly sensitive on the choice of its settings and weak for local search. In this paper, we propose a new algorithm, called QUAntum Particle Swarm Optimization (QUAPSO) based on quantum superposition to set the velocity PSO parameters, simplifying the settings of the algorithm. Another improvement, inspired by Kangaroo Algorithm (KA), was added to PSO in order to optimize its efficiency in local search. QUAPSO was compared with a set of six well-known algorithms from the literature (two parameter sets of classical PSO, KA, Differential Evolution, Simulated Annealing Particle Swarm Optimization, Bat Algorithm and Simulated Annealing Gaussian Bat Algorithm). The experimental results show that QUAPSO outperforms the competing algorithms on a set of 30 test functions.

Optimization problems are common across various fields, and one effective solution is the swarm intelligence algorithm.It is essential for the algorithm to deliver high-quality solutions for problems with varying characteristics. However, most existing swarm intelligence rely on fixed and monotonic search strategies, which limits their ability to handle the diverse and complex situations encountered when solving real-world optimization problems with unknown fitness landscapes. To extend the applicability of swarm intelligence and thus offer users an efficient black-box optimizer for various applications, a novel self-learning mechanism is proposed and applied to the Salp Swarm Algorithm (SSA) to develop the self-learning salp swarm algorithm (SLSSA) in this paper. In SLSSA, four distinct search strategies, including a novel multiple food sources search strategy, are adopted to strengthen the search agents’ abilities to conquer various difficulties in the search space. To improve the efficiency of the search process, the self-learning strategy dynamically determines the execution probability of each search strategy according to the quality of solutions it produced previously. Moreover, a parameter setting method is proposed in this paper, which eliminates the need for a trial-and-error approach and allows for straightforward configuration of the parameters that optimize the performance of SLSSA. In comparison with several highly regarded state-of-the-art peer algorithms, the performance of SLSSA in solving the CEC2014 benchmark functions was thoroughly examined. Subsequently, SLSSA was applied to train multi-layer perceptron classifiers and test on the UCI machine-learning datasets. The experimental results and analysis on benchmark functions and multi-layer perceptron classifier training problems demonstrate that SLSSA outperforms the competing algorithms in terms of solution accuracy, stability, and overall convergence speed. Moreover, computational time comparisons reveal that SLSSA achieves significant performance improvement with only a marginal increase in time cost compared to the original SSA.