scholarly journals Multilevel Image Segmentation Based on an Improved Firefly Algorithm

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Kai Chen ◽  
Yifan Zhou ◽  
Zhisheng Zhang ◽  
Min Dai ◽  
Yuan Chao ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Image Segmentation ◽  
Differential Evolution ◽  
Firefly Algorithm ◽  
The Other ◽  
Optimal Algorithms ◽  
Swarm Optimization ◽  
Local Optima ◽  
Improved Firefly Algorithm ◽  
Cauchy Mutation

Multilevel image segmentation is time-consuming and involves large computation. The firefly algorithm has been applied to enhancing the efficiency of multilevel image segmentation. However, in some cases, firefly algorithm is easily trapped into local optima. In this paper, an improved firefly algorithm (IFA) is proposed to search multilevel thresholds. In IFA, in order to help fireflies escape from local optima and accelerate the convergence, two strategies (i.e., diversity enhancing strategy with Cauchy mutation and neighborhood strategy) are proposed and adaptively chosen according to different stagnation stations. The proposed IFA is compared with three benchmark optimal algorithms, that is, Darwinian particle swarm optimization, hybrid differential evolution optimization, and firefly algorithm. The experimental results show that the proposed method can efficiently segment multilevel images and obtain better performance than the other three methods.

scholarly journals An Adaptive Hybrid Algorithm Based on Particle Swarm Optimization and Differential Evolution for Global Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Xiaobing Yu ◽  
Jie Cao ◽  
Haiyan Shan ◽  
Li Zhu ◽  
Jun Guo
Keyword(s):  
Particle Swarm Optimization ◽  
Differential Evolution ◽  
Hybrid Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Population Based ◽  
Stochastic Search ◽  
Adaptive Mutation ◽  
Swarm Optimization ◽  
Local Optima

Particle swarm optimization (PSO) and differential evolution (DE) are both efficient and powerful population-based stochastic search techniques for solving optimization problems, which have been widely applied in many scientific and engineering fields. Unfortunately, both of them can easily fly into local optima and lack the ability of jumping out of local optima. A novel adaptive hybrid algorithm based on PSO and DE (HPSO-DE) is formulated by developing a balanced parameter between PSO and DE. Adaptive mutation is carried out on current population when the population clusters around local optima. The HPSO-DE enjoys the advantages of PSO and DE and maintains diversity of the population. Compared with PSO, DE, and their variants, the performance of HPSO-DE is competitive. The balanced parameter sensitivity is discussed in detail.

A Review Study of Modified Swarm Intelligence: Particle Swarm Optimization, Firefly, Bat and Gray Wolf Optimizer Algorithms

2020 ◽  
Vol 13 (1) ◽  
pp. 5-12 ◽  
Author(s):  
Chinwe P. Igiri ◽  
Yudhveer Singh ◽  
Ramesh C. Poonia
Keyword(s):  
Particle Swarm Optimization ◽  
Swarm Intelligence ◽  
Firefly Algorithm ◽  
Particle Swarm ◽  
Bat Algorithm ◽  
Gray Wolf ◽  
Swarm Optimization ◽  
Local Optima ◽  
Optimum Result ◽  
Gray Wolf Optimizer

Background: Limitations exist in traditional optimization algorithms. Studies show that bio-inspired alternatives have overcome these drawbacks. Bio-inspired algorithm mimics the characteristics of natural occurrences to solve complex problems. Particle swarm optimization, firefly algorithm, bat algorithms, gray wolf optimizer, among others are examples of bio-inspired algorithms. Researchers make certain assumptions while designing these models which limits their performance in some optimization domains. Efforts to find a solution to deal with these challenges leads to the multiplicity of variants. Objective: This study explores the improvement strategies in four popular swarm intelligence in the literature. Specifically, particle swarm optimization, firefly algorithm, bat algorithm, and gray wolf optimizer. It also tries to identify the exact modification position in the algorithm kernel that yielded the positive outcome. The primary goal is to understand the trends and the relationship in their performance. Methods: The best evidence review methodology approach is employed. Two ancient but valuable and two recent and efficient swarm intelligence, are selected for this study. Results: Particle swarm optimization, firefly algorithm, bat algorithm, and gray wolf optimizer exhibit local optima entrapment in their standard states. The same enhancement strategy produced effective outcome across these four swarm intelligence. The exact approach is chaotic-based optimization. However, the implementation produced the desired result at different stages of these algorithms. Conclusion: Every bio-inspired algorithm comprises two or more updating functions. Researchers need a proper guide on what and how to apply a strategy for an optimum result.

scholarly journals A image segmentation algorithm based on differential evolution particle swarm optimization fuzzy c-means clustering

2015 ◽  
Vol 12 (2) ◽  
pp. 873-893 ◽  
Author(s):  
Jiansheng Liu ◽  
Shangping Qiao
Keyword(s):  
Particle Swarm Optimization ◽  
Image Segmentation ◽  
Differential Evolution ◽  
Clustering Algorithm ◽  
Particle Swarm ◽  
Color Image Segmentation ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Fuzzy C Means ◽  
Fuzzy C Means Clustering

This paper presents a hybrid differential evolution, particle swarm optimization and fuzzy c-means clustering algorithm called DEPSO-FCM for image segmentation. By the use of the differential evolution (DE) algorithm and particle swarm optimization to solve the FCM image segmentation influenced by the initial cluster centers and easily into a local optimum. Empirical results show that the proposed DEPSO-FCM has strong anti-noise ability; it can improve FCM and get better image segmentation results. In particular, for the HSI color image segmentation, the DEPSO-FCM can effectively solve the instability of FCM and the error split because of the singularity of the H component.

scholarly journals Performance Comparison between Particle Swarm Optimization and Differential Evolution Algorithms for Postman Delivery Routing Problem

2021 ◽  
Vol 11 (6) ◽  
pp. 2703
Author(s):  
Warisa Wisittipanich ◽  
Khamphe Phoungthong ◽  
Chanin Srisuwannapa ◽  
Adirek Baisukhan ◽  
Nuttachat Wisittipanit
Keyword(s):  
Particle Swarm Optimization ◽  
Differential Evolution ◽  
Particle Swarm ◽  
Performance Comparison ◽  
Swarm Optimization ◽  
Routing Problem ◽  
Metaheuristic Methods ◽  
Evolution Algorithms ◽  
Differential Evolution Algorithms ◽  
Current Practices

Generally, transportation costs account for approximately half of the total operation expenses of a logistics firm. Therefore, any effort to optimize the planning of vehicle routing would be substantially beneficial to the company. This study focuses on a postman delivery routing problem of the Chiang Rai post office, located in the Chiang Rai province of Thailand. In this study, two metaheuristic methods—particle swarm optimization (PSO) and differential evolution (DE)—were applied with particular solution representation to find delivery routings with minimum travel distances. The performances of PSO and DE were compared along with those from current practices. The results showed that PSO and DE clearly outperformed the actual routing of the current practices in all the operational days examined. Moreover, DE performances were notably superior to those of PSO.

scholarly journals Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax

2021 ◽  
Author(s):  
Moritz Mühlenthaler ◽  
Alexander Raß ◽  
Manuel Schmitt ◽  
Rolf Wanka
Keyword(s):  
Particle Swarm Optimization ◽  
Markov Chain ◽  
Markov Model ◽  
Optimization Problems ◽  
Formal Analysis ◽  
Particle Swarm ◽  
Upper And Lower Bounds ◽  
Swarm Optimization ◽  
Local Optima ◽  
Sorting Problem

AbstractMeta-heuristics are powerful tools for solving optimization problems whose structural properties are unknown or cannot be exploited algorithmically. We propose such a meta-heuristic for a large class of optimization problems over discrete domains based on the particle swarm optimization (PSO) paradigm. We provide a comprehensive formal analysis of the performance of this algorithm on certain “easy” reference problems in a black-box setting, namely the sorting problem and the problem OneMax. In our analysis we use a Markov model of the proposed algorithm to obtain upper and lower bounds on its expected optimization time. Our bounds are essentially tight with respect to the Markov model. We show that for a suitable choice of algorithm parameters the expected optimization time is comparable to that of known algorithms and, furthermore, for other parameter regimes, the algorithm behaves less greedy and more explorative, which can be desirable in practice in order to escape local optima. Our analysis provides a precise insight on the tradeoff between optimization time and exploration. To obtain our results we introduce the notion of indistinguishability of states of a Markov chain and provide bounds on the solution of a recurrence equation with non-constant coefficients by integration.

Sign in / Sign up

Export Citation Format

Share Document