Recent Advances in Swarm Intelligence Algorithms and Their Applications, 2nd Edition

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "E1: Mathematics and Computer Science".

Deadline for manuscript submissions: 20 May 2025 | Viewed by 5950

Special Issue Editor


E-Mail Website
Guest Editor
School of Computer Science and Engineering, Central South University, Changsha 410075, China
Interests: swarm intelligence; antenna theory and design; microwave remote sensing; array signal processing
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues, 

As a branch of artificial intelligence, swarm intelligence refers to the collective behavior of decentralized, self-organized systems. Swarm intelligence mainly attracts and organizes the local interactions among participants and with their environment. It aims to jointly cope with challenging tasks by means of competition, cooperation, and other independent or collaborative ways, especially complex system decision-making tasks in the open environment, which lead to the emergence of intelligent global behavior, unknown to individuals.

In recent years, the research community has witnessed an increased number of swarm intelligence algorithms that can efficiently solve complex computation tasks. Algorithms for optimization problems have been focused on, mainly due to the unprecedented complexity of problems arising from a diverse spectrum of domains, such as transportation, logistics, energy, climate, social networks, health, and Industry 4.0, among many others.

This Special Issue provides a platform for researchers from academia and industry to present their new and unpublished work and to promote future studies in swarm intelligence and its combination with real-world problems and other fields, including, but not limited to, antenna design, vehicle scheduling, drug design and discovery, image segmentation, feature selection, data clustering, traveling salesman problems, etc.

Prof. Dr. Jian Dong
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • swarm intelligence
  • evolutionary algorithms
  • optimization
  • metaheuristics
  • surrogate modeling
  • differential evolution
  • real-world applications
  • machine learning
  • optimal design
  • benchmark functions

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue policies can be found here.

Related Special Issue

Published Papers (3 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

25 pages, 1443 KiB  
Article
Enhancing Multi-Objective Optimization: A Decomposition-Based Approach Using the Whale Optimization Algorithm
by Jorge Ramos-Frutos, Angel Casas-Ordaz, Saúl Zapotecas-Martínez, Diego Oliva, Arturo Valdivia-González, Abel García-Nájera and Marco Pérez-Cisneros
Mathematics 2025, 13(5), 767; https://doi.org/10.3390/math13050767 - 26 Feb 2025
Viewed by 522
Abstract
Optimization techniques aim to identify optimal solutions for a given problem. In single-objective optimization, the best solution corresponds to the one that maximizes or minimizes the objective function. However, when dealing with multi-objective optimization, particularly when the objectives are conflicting, identifying the best [...] Read more.
Optimization techniques aim to identify optimal solutions for a given problem. In single-objective optimization, the best solution corresponds to the one that maximizes or minimizes the objective function. However, when dealing with multi-objective optimization, particularly when the objectives are conflicting, identifying the best solution becomes significantly more complex. In such cases, exact or analytical methods are often impractical, leading to the widespread use of heuristic and metaheuristic approaches to identify optimal or near-optimal solutions. Recent advancements have led to the development of various nature-inspired metaheuristics designed to address these challenges. Among these, the Whale Optimization Algorithm (WOA) has garnered significant attention. An adapted version of the WOA has been proposed to handle multi-objective optimization problems. This work extends the WOA to tackle multi-objective optimization by incorporating a decomposition-based approach with a cooperative mechanism to approximate Pareto-optimal solutions. The multi-objective problem is decomposed into a series of scalarized subproblems, each with a well-defined neighborhood relationship. Comparative experiments with seven state-of-the-art bio-inspired optimization methods demonstrate that the proposed decomposition-based multi-objective WOA consistently outperforms its counterparts in both real-world applications and widely used benchmark test problems. Full article
Show Figures

Figure 1

37 pages, 6077 KiB  
Article
MISAO: A Multi-Strategy Improved Snow Ablation Optimizer for Unmanned Aerial Vehicle Path Planning
by Cuiping Zhou, Shaobo Li, Cankun Xie, Panliang Yuan and Xiangfu Long
Mathematics 2024, 12(18), 2870; https://doi.org/10.3390/math12182870 - 14 Sep 2024
Cited by 4 | Viewed by 1532
Abstract
The snow ablation optimizer (SAO) is a meta-heuristic technique used to seek the best solution for sophisticated problems. In response to the defects in the SAO algorithm, which has poor search efficiency and is prone to getting trapped in local optima, this article [...] Read more.
The snow ablation optimizer (SAO) is a meta-heuristic technique used to seek the best solution for sophisticated problems. In response to the defects in the SAO algorithm, which has poor search efficiency and is prone to getting trapped in local optima, this article suggests a multi-strategy improved (MISAO) snow ablation optimizer. It is employed in the unmanned aerial vehicle (UAV) path planning issue. To begin with, the tent chaos and elite reverse learning initialization strategies are merged to extend the diversity of the population; secondly, a greedy selection method is deployed to retain superior alternative solutions for the upcoming iteration; then, the Harris hawk (HHO) strategy is introduced to enhance the exploitation capability, which prevents trapping in partial ideals; finally, the red-tailed hawk (RTH) is adopted to perform the global exploration, which, enhances global optimization capability. To comprehensively evaluate MISAO’s optimization capability, a battery of digital optimization investigations is executed using 23 test functions, and the results of the comparative analysis show that the suggested algorithm has high solving accuracy and convergence velocity. Finally, the effectiveness and feasibility of the optimization path of the MISAO algorithm are demonstrated in the UAV path planning project. Full article
Show Figures

Figure 1

28 pages, 972 KiB  
Article
Competitive Coevolution-Based Improved Phasor Particle Swarm Optimization Algorithm for Solving Continuous Problems
by Omer Ali, Qamar Abbas, Khalid Mahmood, Ernesto Bautista Thompson, Jon Arambarri and Imran Ashraf
Mathematics 2023, 11(21), 4406; https://doi.org/10.3390/math11214406 - 24 Oct 2023
Cited by 3 | Viewed by 1582
Abstract
Particle swarm optimization (PSO) is a population-based heuristic algorithm that is widely used for optimization problems. Phasor PSO (PPSO), an extension of PSO, uses the phase angle θ to create a more balanced PSO due to its increased ability to adjust the environment [...] Read more.
Particle swarm optimization (PSO) is a population-based heuristic algorithm that is widely used for optimization problems. Phasor PSO (PPSO), an extension of PSO, uses the phase angle θ to create a more balanced PSO due to its increased ability to adjust the environment without parameters like the inertia weight w. The PPSO algorithm performs well for small-sized populations but needs improvements for large populations in the case of rapidly growing complex problems and dimensions. This study introduces a competitive coevolution process to enhance the capability of PPSO for global optimization problems. Competitive coevolution disintegrates the problem into multiple sub-problems, and these sub-swarms coevolve for a better solution. The best solution is selected and replaced with the current sub-swarm for the next competition. This process increases population diversity, reduces premature convergence, and increases the memory efficiency of PPSO. Simulation results using PPSO, fuzzy-dominance-based many-objective particle swarm optimization (FMPSO), and improved competitive multi-swarm PPSO (ICPPSO) are generated to assess the convergence power of the proposed algorithm. The experimental results show that ICPPSO achieves a dominating performance. The ICPPSO results for the average fitness show average improvements of 15%, 20%, 30%, and 35% over PPSO and FMPSO. The Wilcoxon statistical significance test also confirms a significant difference in the performance of the ICPPSO, PPSO, and FMPSO algorithms at a 0.05 significance level. Full article
Show Figures

Figure 1

Back to TopTop