Metaheuristics Approach for Hyperparameter Tuning of Convolutional Neural Network

The research and development of metaheuristic methods are critical issues in computer science. In the past decade, metaheuristic algorithms have been used in many engineering applications such as optimization of engineering problems, telecommunications, information security, and image processing. Many metaheuristic algorithms such as particle swarm optimization (PSO), ant colony optimization (ACO), and genetic algorithm (GA) are recently becoming very popular.There are many studies conducted in the literature on the comparison of PSO with other metaheuristic algorithms. In this chapter, various studies carried out between the years of 2010 and 2020 about the comparison of PSO with the other metaheuristic algorithms will be examined. The metaheuristic algorithms to be considered are simulated annealing (SA), genetic algorithm (GA), differential evolution (DE), ant colony optimization (ACO), artificial bee colony (ABC) algorithm, particle swarm optimization (PSO), tabu search (TS), harmony search (HS), firefly algorithm (FF), cuckoo search (CS), bat-inspired algorithm (BA), water wave optimization (WWO), clonal selection algorithm (CLONALG), chemical reaction optimization (CRO), sine cosine algorithm (SCA), glowworm swarm optimization (GSO), and grey wolf optimizer (GWO). This study aims to evaluate and analyze the covered papers according to several criteria such as (a) rates of studies according to publishing years, (b) the metaheuristic algorithms that are compared to PSO, (c) performance evaluation of compared algorithms, (d) the metaheuristic algorithms with their inspirational approaches and their initial proposed studies and years, (e) the field of subjects where the algorithms are applied in the reviewed studies, and (f) used databases in the examined studies.This study is a comprehensive literature review of the comparison of PSO with the most popular metaheuristic algorithms. The intention of this review is to be useful for researchers who want to conduct a survey on this area of the subject as this chapter will cover the essential and helpful analysis of the related research.

A comparative study of metaheuristic optimization approaches for directional overcurrent relays coordination

This paper presents a methodology to solve the manufacturing cell creation and the production scheduling problems for designing virtual cellular manufacturing systems (VCMSs). The objective is to minimize the total materials and components travelling distance incurred. The methodology consists of (i) a mathematical model that describes the characteristics of a VCMS and includes constraints such as delivery due dates of products, maximum capacities of resources, critical tools limitation, and (ii) an ant colony optimization (ACO) algorithm for manufacturing cell formation and production scheduling. Since the proposed ACO algorithm does not indicate a feasible schedule explicitly, two simple heuristics are developed to assign workstations to the operations of the jobs, and to construct the final schedule. To demonstrate the effectiveness of the proposed methodology, both the ACO algorithm and the genetic algorithm are applied to design manufacturing cells for a company in China producing internal combustion engine components. Comparison of the results obtained with the results supplied by the company on the existing manufacturing system show that both the ACO algorithm and the genetic algorithm together with the virtual cellular manufacturing concept perform better than the current manufacturing practice in terms of average workstation utilization, product completion time and system throughput. Also, the results of a set of randomly generated numerical experiments show that the proposed ACO algorithm generates excellent final solutions in a much shorter computation time when compared with the genetic algorithm. Therefore, the mathematical model and the ACO algorithm proposed in this paper form a simple, but effective and efficient methodology to solve the manufacturing cell creation and production scheduling problems for designing VCMSs.

Design-driven harmony search (DDHS) in steel frame optimization

Assisting elderly individuals in indoor environments is crucial, as they often encounter mobility and safety challenges. Autonomous Unmanned Aerial Vehicles (UAVs) navigation offers a transformative solution, significantly enhancing safety, efficiency, and quality of life. These UAVs can perform tasks such as monitoring, delivering essential items, and responding to emergencies, providing invaluable support and promoting greater independence for elderly individuals. To achieve effective assistance, autonomous UAV navigation relies on robust path planning with obstacle avoidance to ensure optimal performance. A newly developed path planning, based on a new hybrid Water Cycle Algorithm (WCA), stands out by addressing the challenge of avoiding obstacles while adhering to non-holonomic constraints and conserving energy in complex, cluttered indoor environments. In Population-Based Algorithms (PBAs), the initial population plays a crucial role, as it greatly impacts the algorithm’s efficiency in exploring the search space and its rate of convergence. The new developed hybrid algorithm, called WCA-HS, is based on using the Harmony Search (HS) algorithm to identify the optimal initial population for the WCA. The results indicate that the hybrid WCA-HS outperforms classical WCA and other metaheuristic algorithms, such as HS, Firefly Algorithm (FA), Cuckoo Search (CS), Genetic Algorithm (GA), Differential Evolution (DE), Ant Colony Optimization (ACO), and Artificial Bee Colony (ABC), over 20 independent runs, highlighting the effectiveness of the population initialization technique. Additionally, the developed indoor path planning system was evaluated in highly cluttered and low-light environments, showcasing its robustness and real-world applicability, making it highly effective for assisting elderly individuals in complex indoor environments.

This paper presents a method of optimized PID parameter self-adapted ant colony algorithm with aberrance gene, based on ant colony algorithm. This method overcomes genetic algorithm’s defects of repeated iteration, slower solving efficiency, ordinary ant colony algorithm’s defects of slow convergence speed, easy to get stagnate, and low ability of full search. For a given system, the results of simulation experiments which compare to the result of Z-N optimization and evolution of genetic algorithm optimization and evolution of ant colony system optimization, it has more excellent performance in finding best solution and convergence, the PID parameters also have optimality, system possesses dynamic controlling and performance. The experiments show that this method has its practical value on controlling other objection and process.

A new meta-heuristic method, comprehensive teaching learning harmony search optimization algorithm (CTLHSO), is developed in this paper for the simultaneous reconfiguration and optimal allocation of distributed generation resources in radial distribution systems. The proposed method is a hybridization of the teaching–learning-based optimization (TLBO) and the harmony search (HS) algorithms. Primarily, eleven mathematical benchmark functions are used to test the performance of the CTLHSO algorithm. The results are then compared with that of global best artificial bee colony (G-ABC), particle swarm artificial bee colony (PS-ABC), TLBO and improved TLBO (I-TLBO) with identical parameters and initial conditions. The results show that the CTLHSO performance is better than the G-ABC, PS-ABC, TLBO and I-TLBO. Subsequently, CTLHSO is implemented on the IEEE 33-bus and 69-bus radial distribution systems for network reconfiguration and optimal placement of distributed generation resources to minimize the power losses and improve the voltage profiles. Five case studies at three different load levels are carried out. The results obtained are found to be better than those obtained with HS algorithm, genetic algorithm, refined genetic algorithm and fireworks algorithm.

Harmony search (HS) algorithm is an emerging population oriented stochastic metaheuristic algorithm, which is inspired by the music improvisation process. This paper introduces an Amended harmony search (AHS) algorithm for solving optimization problems. In AHS, an enhanced approach is employed for generating better solution that improves accuracy and convergence speed of harmony search (HS). The effects of various parameters on harmony search algorithm are analyzed in this paper. The proposed approach performs fine tuning of two parameters bandwidth and pitch adjustment rate. The proposed algorithm is demonstrated on complex benchmark functions and results are compared with two recent variants of HS optimization algorithms, improved harmony search (IHS) and highly reliable harmony search (HRHS). Results suggested that the AHS method has strong convergence and has better balance capacity of exploration and exploitation.

This paper presents the analysis of Automatic generation control (AGC) of a two-area interconnected hydrothermal system under open market scenario. It also involves the optimization of integral controller employing ant colony system algorithm (ACS). Open transmission access and the evolving of more socialized companies for generation, transmission and distribution affects the formulation of AGC problem. So the traditional AGC two-area system is modified to take into account the effect of bilateral contracts on the dynamics. The behavior of real ants has inspired the development of the ACS algorithm, an improved version of the ant system (AS) algorithm, which reproduces the technique used by ants to construct their food recollection routes from their nest, and where a set of artificial ants cooperate to find the best solution through the interchange of the information contained in the pheromone deposits of the different trajectories. This metaheuristic approach has proven to be very robust when applied to global optimization problems and is favorably compared to other solution approaches such as genetic algorithms (GAs) and simulated annealing techniques. Gain setting of the integral controller is optimized using the ACS algorithm technique following a step load disturbance in either of the areas. The performance of the proposed approach outstands positively when compared to GAs, obtaining improved results with significant reductions in the solution time.

The new trend toward modern earthquake-resistant design of buildings based on nonlinear dynamic analysis accounting for peak and energy demands requires efficient ground motion record selection procedures. For this reason, in the present work, two record selection strategies based on acceleration and input energy spectrum considering the spectral shape via Np are presented. Furthermore, both record selection strategies are optimized by means of four artificial intelligence (AI) techniques: Genetic Algorithms (GA), Harmony Search (HS), Particle Swarm Optimization (PSO) and Vibrating Particle System (VPS). In particular, the effectiveness of each AI approach toward the best set of ground motion records for nonlinear dynamic analysis is compared. For this aim, spectral acceleration and input energy design spectra were considered, as well as 1024 seismic records obtained from the Pacific Earthquake Engineering Research Center. For all the AI or meta-heuristic approaches, the fitness function used is focused on minimizing the difference between the average spectrum of eleven ground motion records and the design spectrum using the well-known parameter Np, which represents the spectral shape in a range of periods. In addition, a penalization is included for those spectra with very large or low demands. Thus, 24 sets of eleven seismic records that can be used for nonlinear dynamic analysis of structures with a fundamental period of vibration of 0.6, 1.2 and 1.8 seconds were obtained and purposes. The results demonstrate the ability of the two records selection strategies analyzed and the four meta-heuristic procedures, achieving results quickly and simply regardless of the type of demands, intensities and periods considered. Finally, it is concluded that the VPS algorithm is better in comparison with GA, HS, and PSO since it obtains superior results in almost all the selected cases.

A novel Multiuser Detection (MUD) scheme is proposed for DS-CDMA systems employing the so-called Harmony Search (HS) algorithm, which is a novel meta-heuristic optimisation method. We specifically design the HS aided MUD for the communications problem considered and apply it in an iterative joint Channel Estimation (CE), MUD and channel decoding framework. The simulation results demonstrate that a near-single-user performance can be achieved by the proposed algorithm while avoiding the excessive-complexity full-search-based optimum detection even in overloaded DS-CDMA systems. Moreover, the HS algorithm can be efficiently applied in the Expectation Maximisation (EM) based CE framework.

Metaheuristics are truly diverse in nature—under the overarching theme of performing operations to escape local optima, algorithms as different as ant colony optimization, tabu search, harmony search, and genetic algorithms have emerged. Due to the unique functionality of each type of metaheuristic, the computational comparison of metaheuristics is in many ways more difficult than other algorithmic comparisons. In this chapter, we discuss techniques for the meaningful computational comparison of metaheuristics. We discuss how to create and classify instances in a new testbed and how to make sure other researchers have access to these test instances for future metaheuristic comparisons. In addition, we discuss the disadvantages of large parameter sets and how to measure complicated parameter interactions in a metaheuristic’s parameter space. Finally, we explain how to compare metaheuristics in terms of both solution quality and runtime and how to compare parallel metaheuristics.

Feature selection can efficiently improve the accuracy of classification and reduce the measurement, storage and computation demands, and thus it has been applied in biomedical research increasingly. Considering the non-deterministic polynomial-time hard characteristic of feature selection, meta-heuristics are introduced into feature selection in biomedicine on account of their excellent global search ability. However, most of biomedical problems are characterized by high dimensionality, which is a challenge for feature selection methods based on meta-heuristics due to the curse of dimensionality. Thus, six meta-heuristics, that is, a genetic algorithm, particle swarm optimization, ant colony optimization, harmony search, differential evolution, and quantum-inspired evolutionary algorithm, which are widely studied in the meta-heuristic community, are introduced into feature selection in this paper and the performance of the algorithms is analysed and compared with each other for solving feature selection in biomedicine effectively. To evaluate the search ability of the algorithms fairly and exactly, a set of feature selection benchmark problems are designed and yielded for the performance tests. The experimental results show that all the meta-heuristics are powerful enough to achieve the ideal results on low-dimensional feature selection problems, while it is essential to choose a proper algorithm for the high-dimensional ones.

This chapter introduces the basic concepts of biogeography based optimization (BBO) algorithm and its application to a combinatorial water switching problem. Water switching optimization is a pump scheduling problem which considers minimization of total electrical energy requirement as an objective function. Pump status (switch on/switch off) of pumping stations are considered as a discrete (binary) decision variables for the optimization problem. Suction and discharge pressure are considered as constraints in the procedure. A case study with 10 pumping station and 40 pumps is presented for the experimentation. The performance of BBO is tested against other state-of-the art algorithms that includes genetic algorithm (GA), branch & bound method (B&B), harmony search (HS) algorithm, particle swarm optimization (PSO) and ant colony optimization (ACO) algorithms. Water pump switching problem is also investigated by using different constraint handling techniques and by considering different pump situations in a pumping station. The Computational results indicate that BBO is an appropriate algorithm to solve water pump switching problem and is effective over other optimization methods. Moreover, 20 alternative optimum solutions are presented to demonstrate water switching problem as a multi-modal problem with different optimum solutions and the search capability of BBO to find alternate optimum solutions.

Interferometric Synthetic Aperture Radar (InSAR) is a microwave imaging system with all-weather earth observation. Because of its wide observation area, high precision, day and night operational capabilities, it has a significant advantage in monitoring large-scale surface deformation. Phase unwrapping is a key step in InSAR data processing. The core of Goldstein traditional branch unwrapping method is the establishment of branch-cutting lines. The shorter the overall length of the branch line, the solution is more accurate. Based on the idea of solving the shortest path of Travelling Salesman Problem (TSP), a new algorithm combining ant colony algorithm and genetic algorithm is proposed. Based on the advantages of these two algorithms, we avoid the disadvantages of excessive parameters, slow calculation speed and low efficiency in ant colony algorithm, reduce the time consumed by ant colony algorithm in solving local optimal solution, improve the local search ability of ant colony algorithm, establish shorter branch line than traditional branch method, prevent islanding effect and improve the precision of phase unwrapping. The tests performed on real and simulated interferometric SAR data confirm the validity of the proposed method.