scholarly journals Hybrid PSO-SA Type Algorithms for Multimodal Function Optimization and Reducing Energy Consumption in Embedded Systems

2011 ◽  
Vol 2011 ◽  
pp. 1-12 ◽  
Author(s):  
Lhassane Idoumghar ◽  
Mahmoud Melkemi ◽  
René Schott ◽  
Maha Idrissi Aouad

The paper presents a novel hybrid evolutionary algorithm that combines Particle Swarm Optimization (PSO) and Simulated Annealing (SA) algorithms. When a local optimal solution is reached with PSO, all particles gather around it, and escaping from this local optima becomes difficult. To avoid premature convergence of PSO, we present a new hybrid evolutionary algorithm, called HPSO-SA, based on the idea that PSO ensures fast convergence, while SA brings the search out of local optima because of its strong local-search ability. The proposed HPSO-SA algorithm is validated on ten standard benchmark multimodal functions for which we obtained significant improvements. The results are compared with these obtained by existing hybrid PSO-SA algorithms. In this paper, we provide also two versions of HPSO-SA (sequential and distributed) for minimizing the energy consumption in embedded systems memories. The two versions, of HPSO-SA, reduce the energy consumption in memories from 76% up to 98% as compared to Tabu Search (TS). Moreover, the distributed version of HPSO-SA provides execution time saving of about 73% up to 84% on a cluster of 4 PCs.

2012 ◽  
Vol 1 (1) ◽  
pp. 18
Author(s):  
Shyam S. Pattnaik ◽  
Devidas G. Jadhav ◽  
Swapna Devi ◽  
Radha Kanto Ratho

Swine Influenza Inspired Optimization (SIIO) is a search algorithm proposed for optimal solution. The authors followed the SIR (susceptible - infectious-recovered) virus spread model of Swine Influenza to develop the new evolutionary algorithm named as SIIO. SIR model is used to frame optimization algorithm following the spread and control phenomenon of the swine flu virus in the human population. The fitness based classes viz. susceptible (S), infectious (I) and recovered (R) of the individuals are made and treatment is used for the affected individuals by imitating the health information from the best fitness individual. The proposed algorithm shows improved performance on multi-dimensional unimodal and multimodal standard numerical benchmark functions than the compared optimization algorithms. The performance of the SIIO algorithm is better in terms of speed of convergence and quality of solutions. The SIIO is also applied for the Gaussian noise removal with Blind Source Separation (BSS) based on Independent Component Analysis (ICA).


Filomat ◽  
2020 ◽  
Vol 34 (15) ◽  
pp. 5159-5172
Author(s):  
Xiaoxiao Li ◽  
Xuefeng Zhou ◽  
Zhihao Xu ◽  
Guanrong Tang

Aiming at solving a drawback of the second-order beetle antenna search (SOBAS), a variant of the beetle antenna search (BAS), that it is difficult to find the global optimal solution and the low convergence accuracy when applied to the multimodal optimization functions with high dimension or large variable region, a chaotic-based second-order BAS algorithm (CSOBAS) is proposed by introducing chaos theory into the SOBAS. The algorithm mainly has three innovations: 1) chaos initialization: choosing the one with the smallest fitness function value from twenty beetles with different positions for iterative search; 2) using chaotic map to tune the randomization parameter in the detection rule; 3) imposing a chaotic perturbation on the current beetle to hope to help the search to jump out the local optimal solution. Eight different chaotic maps are used to demonstrate their impact on the simulation results. With six typical multimodal functions, performance comparisons between the CSOBAS and the SOBAS are conducted, validating the effectiveness of the CSOBAS and its superiority compared to the SOBAS. What?s more, the CSOBAS with an appropriate chaotic map can achieve a very good convergence quality compared to other swarm intelligence optimization algorithms while maintaining an individual.


Author(s):  
Takumi Ichimura ◽  
◽  
Hiroshi Inoue ◽  
Akira Hara ◽  
Tetsuyuki Takahama ◽  
...  

It is a difficult problem for evolutionary algorithms to search an optimal solution in multimodal functions with dynamic environments, where individuals searchmore than one optimum and their fitness values change over time. In this paper, we propose a method of Memory and Prediction Based Genetic Algorithm Using Speciation. This method is extended with a case based memory and a meta learner for precise prediction of environmental change. Especially, the individuals in a memory consist of 4 kinds of predictors and they can adjust to the change of dynamic environment adaptively. Speciation has shown to be an effective technique for multimodal optimization. A niching method based on speciation can be used to classify a population into groups according to their similarity measured by a distance. In this paper, each group by speciation has a memory and the individuals stored in the memory can respond to the situation according to the dynamic environment. In order to verify the effectiveness, the method is examined to search for an optimal solutions in multimodal functions.


Sign in / Sign up

Export Citation Format

Share Document