Particle swarm optimization (PSO) is the most well known of the swarm-based intelligence algorithms and is inspired by the social behavior of bird flocking. However, the PSO algorithm converges prematurely, which rapidly decreases the population diversity, especially when approaching local optima. Recently, a new metaheuristic algorithm called the crow search algorithm (CSA) was proposed. The CSA is similar to the PSO algorithm but is based on the intelligent behavior of crows. The main concept behind the CSA is that crows store excess food in hiding places and retrieve it when needed. The primary advantage of the CSA is that it is rather simple, having just two parameters: flight length and awareness probability. Thus, the CSA can be applied to optimization problems very easily. This paper proposes a hybridization algorithm based on the PSO algorithm and CSA, known as the crow particle optimization (CPO) algorithm. The two main operators are the exchange and local search operators. It also implements a local search operator to enhance the quality of the best solutions from the two systems. Simulation results demonstrated that the CPO algorithm exhibits a significantly higher performance in terms of both fitness value and computation time compared to other algorithms.
The permutation flow shop scheduling problem (PFSP) is a renowned problem in the scheduling research community. It is an NP-hard combinatorial optimization problem that has useful real-world applications. In this problem, finding a useful algorithm to handle the massive amounts of jobs required to retrieve an actionable permutation order in a reasonable amount of time is important. The recently developed crow search algorithm (CSA) is a novel swarm-based metaheuristic algorithm originally proposed to solve mathematical optimization problems. In this paper, a hybrid CSA (HCSA) is proposed to minimize the makespans of PFSPs. First, to make the CSA suitable for solving the PFSP, the smallest position value rule is applied to convert continuous numbers into job sequences. Then, the HCSA uses a Nawaz–Enscore–Ham (NEH) technique to create a population with the required levels of quality and diversity. We apply a local search to enhance the quality of the solutions and avoid premature convergence; simulated annealing enhances the local search of a method based on a variable neighborhood search. Computational tests are used to evaluate the algorithm using PFSP benchmarks with job sizes between 20 and 500. The tests indicate that the performance of the proposed HCSA is significantly superior to that of other algorithms.
Data clustering is a well-known data analysis technique for organizing unlabeled datapoints into clusters on the basis of similarity measures. The real-world applications of data clustering include bioinformatics, vector quantization, data mining, geographical information systems, pattern recognition, image processing, and wireless sensors. The data in a cluster are similar (minimizing the intra-cluster distance) and differ from the data in other clusters (maximizing the inter-cluster distance). The cluster problem has been proven to be NP-hard, but can be solved using meta-heuristic algorithms, such as ant colony optimization, genetic algorithms, gravitational search algorithm (GSA), and particle swarm optimization (PSO). This paper proposes a memetic clustering algorithm with efficient search and fast convergence, respectively, based on PSO and GSA, called the memetic particle gravitation optimization (MPGO) algorithm. The two main mechanisms of MPGO are hybrid operation and diversity enhancement. The former involves the exchange of individuals from two subpopulations after a predefined number of function evaluations (FEs), whereas the latter involves an enhancement operator, which is similar to the crossover process of differential evolution, for enhancing the diversity of each system. Individuals from the PSO and GSA systems are selected for the exchange of solutions by using the roulette-wheel approach. The performance of the proposed algorithm was evaluated on 52 benchmark test functions, six UCI machine learning benchmarks, and image segmentation of six well-known images. A comparison with existing algorithms verified the superior performance of the proposed algorithm in terms of a fitness value, an accuracy rate, and a peak signal-to-noise ratio.
Metaheuristic algorithms are novel optimization algorithms often inspired by nature. In recent years, scholars have proposed various metaheuristic algorithms, such as the genetic algorithm (GA), artificial bee colony, particle swarm optimization (PSO), crow search algorithm, and whale optimization algorithm (WOA), to solve optimization problems. Among these, PSO is the most commonly used. However, different algorithms have different limitations. For example, PSO is prone to premature convergence and falls into a local optimum, whereas GA coding is difficult and uncertain. Therefore, an algorithm that can increase the computing power and particle diversity can address the limitations of existing algorithms. Therefore, this paper proposes a hybrid algorithm, called whale particle optimization (WPO), that combines the advantages of the WOA and PSO to increase particle diversity and can jump out of the local optimum. The performance of the WPO algorithm was evaluated using four optimization problems: function evaluation, image clustering, permutation flow shop scheduling, and data clustering. The test data were selected from real-life situations. The results demonstrate that the proposed algorithm competes well against existing algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.