Improved Firefly Algorithm with Variable Neighborhood Search for Data Clustering

Abstract

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On these bases, this work aims to improve FA using variable neighborhood search (VNS) as a local search method, providing VNS the benefit of the trade-off between the exploration and exploitation abilities. The proposed FA-VNS allows fireflies to improve the clustering solutions with the ability to enhance the clustering solutions and maintain the diversity of the clustering solutions during the search process using the perturbation operators of VNS. To evaluate the performance of the algorithm, eight benchmark datasets are utilized with four well-known clustering algorithms. The comparison according to the internal and external evaluation metrics indicates that the proposed FA-VNS can produce more compact clustering solutions than the well-known clustering algorithms.

An improved artificial bee colony with perturbation operators in scout bees’ phase for solving vehicle routing problem with time windows

“…Iterated local search and guided local search algorithms belong to the former class, whereas evolutionary computation, particle swarm optimization, grey wolf optimization and ant colony optimization belong to the later one [15], [16]. Populationbased techniques are divided into two types, i.e., swarm intelligence algorithms and evolutionary algorithms [17], [18], on the basis of natural events that the algorithms represent. The theory of evolution is used by evolutionary algorithms to generate new species [19], [20].…”

Diversity Operators-based Artificial Fish Swarm Algorithm to Solve Flexible Job Shop Scheduling Problem

“…of apparatuses with processing time can operate a job operation not similar in JSSP where each process must be performed by a particular apparatus; this is why when JSSP is compared with FJSSP, it is concluded that the FJSSP is more awkward due to its uncertainty when choosing the right apparatus out of a specific set of apparatuses that would handle each process of a task 5 .Two sub-problems were decomposed from the problem of scheduling jobs in FJSP that are routing and scheduling. A routing subproblem means each operation is assigned to a particular machine (out of a set of capable machines) and a scheduling sub-problem means that each assigned operation is given a sequence number for all selected machines in order to achieve optimized objectives from the feasible schedule 6,7 . In this research the makespan is decreased i.e., the highest time to complete the tasks.…”

Modified Firefly Algorithm using Iterated Descent Method to Solve Machine Scheduling Problems

“…The results showed that the proposed algorithm outperform GA and FIFO algorithms. In [14] the authors combined the FFA with VNS for Data Clustering (FA-VNS), the results showed that the proposed algorithm performance better than other well-known clustering algorithms in literature. In [15] the authors propose a modified FFA to effectively observe the network by introducing a new health function for early detection of suspicious nodes, the results showed that the proposed algorithm reduces the number of suspicious nodes.…”