Nature Inspired Optimization Algorithms Recent Advances and Applications II

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (19 December 2021) | Viewed by 8224

Special Issue Editors


E-Mail Website
Guest Editor
Faculty of Natural Sciences and Forestry, Department of Computer Science, University of Eastern Finland, 70211 Kuopio, Finland
Interests: nature-inspired computing methods
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Industrial Engineering, University of Khenchela, Khenchela 40004, Algeria
Interests: evolutionary computation; swarm intelligence; intelligent control systems

Special Issue Information

Dear Colleagues,

Nature-inspired optimization algorithms represent a very important research field in computational intelligence, soft computing, and optimization in a general sense. For this purpose, we observe clearly that they attract outstanding interest from many researchers around the world. Indeed, past and ongoing research in this field cover an important group of subjects, from basic research to a large number of real-world applications in almost all areas, which include science, engineering, industry, economics, and business. The creation of many new algorithms based on natural processes like natural selection, food foraging, physical laws, group movements and other natural models have made this field of research very rich. These algorithms offer very powerful tools to handle these problems, which cannot be solved using traditional and classical mathematical methods, because they not require any mathematical conditions to be satisfied. It should be noted that a general look leads to the finding that nature-inspired algorithms can be generally classified into two main categories: Evolutionary algorithms and swarm intelligence. There are a few algorithms however that do not fall in any of these categories, e.g., gravitational search, harmony search, etc.

The principal aim of this Special Issue is to assemble state-of-the-art contributions on the latest research and development, up-to-date issues, and challenges in the field of nature-inspired optimization algorithms. Proposed submissions should be original, unpublished, and should present novel in-depth fundamental research contributions either from a methodological perspective or from an application point of view. Topics of interest include, but are not only limited to:

  • Swarm Intelligence (SI)-based algorithms:
    • Ant Colony Optimization,
    • Ant Lion Optimization,
    • Artificial Bee Colony,
    • Bacterial foraging,
    • Bacterial-GA Foraging,
    • Bat Algorithm,
    • BeeHive,
    • Bumblebees,
    • Cat swarm,
    • Consultant-guided search
    • Cuckoo Search,
    • Krill Herd,
    • Monkey search,
    • Particle Swarm Optimisation,
    • Weightless Swarm Algorithm.
  • Bio-inspired (not SI-based) algorithms:
    • Atmosphere clouds model,
    • Biogeography based Optimization,
    • Brain Storm Optimization,
    • Differential Evolution,
    • Dolphin echolocation,
    • Japanese tree frogs calling,
    • Eco-inspired evolutionary algorithm,
    • Egyptian Vulture,
    • Fish-school Search,
    • Flower pollination Algorithm,
    • Firefly Algorithms,
    • Gene expression.
  • Physics and Chemistry based algorithms:
    • Big bang-big Crunch,
    • Black hole,
    • Central force optimization,
    • Charged system search,
    • Electro-magnetism optimization,
    • Galaxy-based search algorithm,
    • Gravitational search,
    • Harmony Search,
    • Intelligent water drop,
    • River formation dynamics,
    • Self-propelled particles,
    • Simulated Annealing,
    • Stochastic diffusion search,
    • Spiral optimization,
    • Water cycle algorithm.

Dr. Xiao-Zhi Gao
Dr. Allouani Fouad
Guest Editors

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. Algorithms is an international peer-reviewed open access monthly 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 1600 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.

Published Papers (3 papers)

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

Research

19 pages, 11469 KiB  
Article
Utilizing the Particle Swarm Optimization Algorithm for Determining Control Parameters for Civil Structures Subject to Seismic Excitation
by Courtney A. Peckens, Andrea Alsgaard, Camille Fogg, Mary C. Ngoma and Clara Voskuil
Algorithms 2021, 14(10), 292; https://0-doi-org.brum.beds.ac.uk/10.3390/a14100292 - 08 Oct 2021
Cited by 1 | Viewed by 1474
Abstract
Structural control of civil infrastructure in response to large external loads, such as earthquakes or wind, is not widely employed due to challenges regarding information exchange and the inherent latencies in the system due to complex computations related to the control algorithm. This [...] Read more.
Structural control of civil infrastructure in response to large external loads, such as earthquakes or wind, is not widely employed due to challenges regarding information exchange and the inherent latencies in the system due to complex computations related to the control algorithm. This study employs front-end signal processing at the sensing node to alleviate computations at the control node and results in a simplistic sum of weighted inputs to determine a control force. The control law simplifies to U = WP, where U is the control force, W is a pre-determined weight matrix, and P is a deconstructed representation of the response of the structure to the applied excitation. Determining the optimal weight matrix for this calculation is non-trivial and this study uses the particle swarm optimization (PSO) algorithm with a modified homing feature to converge on a possible solution. To further streamline the control algorithm, various pruning techniques are combined with the PSO algorithm in order to optimize the number of entries in the weight matrix. These optimization techniques are applied in simulation to a five-story structure and the success of the resulting control parameters are quantified based on their ability to minimize the information exchange while maintaining control effectiveness. It is found that a magnitude-based pruning method, when paired with the PSO algorithm, is able to offer the most effective control for a structure subject to seismic base excitation. Full article
Show Figures

Figure 1

13 pages, 1461 KiB  
Article
A New Hyper-Parameter Optimization Method for Power Load Forecast Based on Recurrent Neural Networks
by Yaru Li, Yulai Zhang and Yongping Cai
Algorithms 2021, 14(6), 163; https://0-doi-org.brum.beds.ac.uk/10.3390/a14060163 - 24 May 2021
Cited by 12 | Viewed by 2969
Abstract
The selection of the hyper-parameters plays a critical role in the task of prediction based on the recurrent neural networks (RNN). Traditionally, the hyper-parameters of the machine learning models are selected by simulations as well as human experiences. In recent years, multiple algorithms [...] Read more.
The selection of the hyper-parameters plays a critical role in the task of prediction based on the recurrent neural networks (RNN). Traditionally, the hyper-parameters of the machine learning models are selected by simulations as well as human experiences. In recent years, multiple algorithms based on Bayesian optimization (BO) are developed to determine the optimal values of the hyper-parameters. In most of these methods, gradients are required to be calculated. In this work, the particle swarm optimization (PSO) is used under the BO framework to develop a new method for hyper-parameter optimization. The proposed algorithm (BO-PSO) is free of gradient calculation and the particles can be optimized in parallel naturally. So the computational complexity can be effectively reduced which means better hyper-parameters can be obtained under the same amount of calculation. Experiments are done on real world power load data, where the proposed method outperforms the existing state-of-the-art algorithms, BO with limit-BFGS-bound (BO-L-BFGS-B) and BO with truncated-newton (BO-TNC), in terms of the prediction accuracy. The errors of the prediction result in different models show that BO-PSO is an effective hyper-parameter optimization method. Full article
Show Figures

Figure 1

11 pages, 536 KiB  
Article
Adaptive Behaviour for a Self-Organising Video Surveillance System Using a Genetic Algorithm
by Fabrice Saffre and Hanno Hildmann
Algorithms 2021, 14(3), 74; https://0-doi-org.brum.beds.ac.uk/10.3390/a14030074 - 25 Feb 2021
Cited by 2 | Viewed by 1837
Abstract
Genetic algorithms (GA’s) are mostly used as an offline optimisation method to discover a suitable solution to a complex problem prior to implementation. In this paper, we present a different application in which a GA is used to progressively adapt the collective performance [...] Read more.
Genetic algorithms (GA’s) are mostly used as an offline optimisation method to discover a suitable solution to a complex problem prior to implementation. In this paper, we present a different application in which a GA is used to progressively adapt the collective performance of an ad hoc collection of devices that are being integrated post-deployment. Adaptive behaviour in the context of this article refers to two dynamic aspects of the problem: (a) the availability of individual devices as well as the objective functions for the performance of the entire population. We illustrate this concept in a video surveillance scenario in which already installed cameras are being retrofitted with networking capabilities to form a coherent closed-circuit television (CCTV) system. We show that this can be conceived as a multi-objective optimisation problem which can be solved at run-time, with the added benefit that solutions can be refined or modified in response to changing priorities or even unpredictable events such as faults. We present results of a detailed simulation study, the implications of which are being discussed from both a theoretical and practical viewpoint (trade-off between saving computational resources and surveillance coverage). Full article
Show Figures

Figure 1

Back to TopTop