Skip Neighborhood Hybrid Particle Swarm Optimization Algorithm

2011 ◽  
Vol 311-313 ◽  
pp. 1863-1868
Author(s):  
Jian Jun Li ◽  
Bin Yu ◽  
Wu Ping Chen

Traditional Particle Swarm Optimization (PSO) uses single search strategy and is difficult to balance the global search with local search, and easy to fall into local optimization, a new algorithm which integrates global search with local neighborhood search is presented. The algorithm performs the global search in parallel with the local search by the feedback of the global optimal particle and the information interaction of local neighborhood. Meanwhile, with a new neighborhood topology to control the search space, the algorithm can avoid the local optimization successfully. Tested by four classical functions, the new algorithm performs well on optimization speed, accuracy and success rate.

2015 ◽  
Vol 14 (01) ◽  
pp. 171-194 ◽  
Author(s):  
Bun Theang Ong ◽  
Masao Fukushima

A hybrid Particle Swarm Optimization (PSO) that features an automatic termination and better search efficiency than classical PSO is presented. The proposed method is combined with the so-called "Gene Matrix" to provide the search with a self-check in order to determine a proper termination instant. Its convergence speed and reliability are also increased by the implementation of the Principal Component Analysis (PCA) technique and the hybridization with a local search method. The proposed algorithm is denominated as "Automatically Terminated Particle Swarm Optimization with Principal Component Analysis" (AT-PSO-PCA). The computational experiments demonstrate the effectiveness of the automatic termination criteria and show that AT-PSO-PCA enhances the convergence speed, accuracy and reliability of the PSO paradigm. Furthermore, comparisons with state-of-the-art evolutionary algorithms (EA) yield competitive results even under the automatically detected termination instant.


2014 ◽  
Vol 651-653 ◽  
pp. 2159-2163
Author(s):  
Jia Xing You ◽  
Ji Li Chen ◽  
Ming Gang Dong

To solve the problem of standard particle swarm optimization (PSO) easy turn to premature convergence and poor ability in local search, this paper present a hybrid particle swarm optimization algorithm merging simulated annealing (SA) and mountain-climb. During the running time, the algorithm use the pso to find the global optimal position quickly, take advantage of the Gaussian mutation and mountain-climb strategy to enhance local search ability, and combine with SA to strengthen the population diversity to enable particles to escape from local minima. Test results on several typical test functions show that this new algorithm has a significant improve in searching ability and effectively overcome the premature convergence problem.


2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Jun-qing Li ◽  
Quan-ke Pan ◽  
Kun Mao

A hybrid algorithm which combines particle swarm optimization (PSO) and iterated local search (ILS) is proposed for solving the hybrid flowshop scheduling (HFS) problem with preventive maintenance (PM) activities. In the proposed algorithm, different crossover operators and mutation operators are investigated. In addition, an efficient multiple insert mutation operator is developed for enhancing the searching ability of the algorithm. Furthermore, an ILS-based local search procedure is embedded in the algorithm to improve the exploitation ability of the proposed algorithm. The detailed experimental parameter for the canonical PSO is tuning. The proposed algorithm is tested on the variation of 77 Carlier and Néron’s benchmark problems. Detailed comparisons with the present efficient algorithms, including hGA, ILS, PSO, and IG, verify the efficiency and effectiveness of the proposed algorithm.


Sign in / Sign up

Export Citation Format

Share Document