This content is not included in
your SAE MOBILUS subscription, or you are not logged in.
A Modified Particle Swarm Optimization Algorithm with Design of Experiment Technique and a Perturbation Process
Technical Paper
2015-01-0422
ISSN: 0148-7191, e-ISSN: 2688-3627
Annotation ability available
Sector:
Language:
English
Abstract
Particle swarm optimization (PSO) is a relatively new stochastic optimization algorithm and has gained much attention in recent years because of its fast convergence speed and strong optimization ability. However, PSO suffers from premature convergence problem for quick losing of diversity. That is to say, if no particle discovers a new superiority position than its previous best location, PSO algorithm will fall into stagnation and output local optimum result. In order to improve the diversity of basic PSO, design of experiment technique is used to initialize the particle swarm in consideration of its space-filling property which guarantees covering the design space comprehensively. And the optimization procedure of PSO is divided into two stages, optimization stage and improving stage. In the optimization stage, the basic PSO initialized by Optimal Latin hypercube technique is conducted. Based on the result of the optimization stage, a perturbation course is used to release the particles out from stagnation in the improving stage. According to these methods, a modified PSO algorithm, namely OLPPSO (Optimal Latin Hypercube design and a perturbation process are used to enhance basic PSO) is proposed. The proposed method is tested and validated by standard benchmark functions in contrast with the basic PSO. Based on the experimental results, the OLPPSO algorithm outperforms the basic PSO by noticeable percentage.
Authors
Citation
Liu, Z., Zhu, P., Chen, W., and Yang, R., "A Modified Particle Swarm Optimization Algorithm with Design of Experiment Technique and a Perturbation Process," SAE Technical Paper 2015-01-0422, 2015, https://doi.org/10.4271/2015-01-0422.Also In
References
- Eberhart R. , Kennedy J. A new optimizer using particle swarm theory Proceedings of the Sixth International Symposium on Micro Machine and Human Science 39 43 4-6 Oct. 1995
- Kennedy J. , Eberhart R. Particle swarm optimization Proceedings of the IEEE International Conference on Neural Networks 4 1942 1948 27 Nov. 01 Dec. 1995
- Eberhart , R. , and Shi , Y. Special Issue on Particle Swarm Optimization IEEE Transaction on Evolutionary Computation 8 3 201 203 2004
- Monson , C. K. , and Seppi , K. Adaptive Diversity in PSO Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation 59 66 2006
- Salehizadeh , S. M. A. , Yadmellat , P. , and Menhaj , M. B. Local Optima Avoidable Particle Swarm Optimization Proceedings of the 2009 Swarm Intelligence Symposium 16 21 2009
- Ting , T.-O. , Rao , M.V.C. , Loo , C.K. , Ngu , S.-S. A New Class of Operators to Accelerate Particle Swarm Optimization Proceedings of the IEEE Congress on Evolutionary Computation 4 2406 2410 2003
- Paquet , U. , Engelbrecht , A.P. A New Particle Swarm Optimizer for Linearly Constrained Optimization Proceedings of the IEEE Congress on Evolutionary Computation 1 227 233
- Parsopoulos , K.E. , Plagianakos , V.P. , Magoulus , G.D. , Vrahatis , M.N. Objective Function ‘Strectching’ to Alleviate Convergence to Local Minima Nonlinear Analysis, Theory, Methods and Applications 47 5 3419 3424 2001
- Kennedy J. , Mendes R. Population structure and particle swarm performance Proceedings of IEEE Congress on Evolutionary Computation 1671 1676 2002
- Mendes R. , Kennedy J. , Neves J. The fully informed particle swarm: simpler, maybe better IEEE Transactions on Evolutionary Computation 8 3 204 210 2004
- Peram T. , Veeramachaneni K. , Mchan C.K. Fitness-distance-ratio based particle swarm optimization Proceedings of the IEEE Swarm Intelligence Symposium 174 181 2003
- Suganthan P.N. Particle swarm optimiser with neighbourhood operator Proceedings of IEEE Congress on Evolutionary Computation 1958 1962 1999
- Hu J. , Zeng J. , Tan Y. A diversity-guided particle swarm optimizer for dynamic environments Proceedings of Life System Modeling and Simulation 239 247 2007
- Pant M. , Radha T. , Singh V.P. A simple diversity guided particle swarm optimization Proceedings of IEEE Congress Evolutionary Computation 3294 3299 2007
- Riget J. , Vesterstom J.S. Adiversity-Guided Particle Swarm Optimizer - the arPSO Technical report EVAlife Denmark 2002
- Sun J. , Xu B.W. , Fang W. A diversity-guided quantum-behaved particle swarm optimization algorithm International Conference on Simulated Evolution and Learning 497 504 2006
- Wang H. , Wu Z. , Zeng S. , Jiang D. , Liu Y. , Wang J. , Yang X. A simple and fast particle swarm optimization Journal of Multiple-Valued Logic and Soft Computing 16 6 611 629 2010
- Grosan C. , Abrahamand A. Nicoara M. Search Optimization Using Hybrid Particle Sub-Swarms and Evolutionary Algorithms International Journal of Simulation Systems, Science & Technology 6 60 79 2005
- Parsopoulos , K.E. , Varahatis , M.N. Initializing Particle Swarm Optimizer using non linear simplex Method Advances in Intelligent systems, Fuzzy systems, Evolutionary Computation 216 221 2002
- Brits , R. Niching, Strategies for particle Swarm Optimization Masters Thesis Department of Computer Science, University of Pretoria 2002
- Uy N. Q. , Hoai N. X. , Mckay RI and Tuan P. M. Initialising PSO with Randomized Low-Discrepancy Sequences: The Comparative Results Proc. of IEEE Congress Evolutionary Computation 1985 1992 2007
- Pant M. , Thangaraj R. , Grosan C. and Abraham A. Improved Particle Swarm Optimization with Low-discrepancy Sequences IEEE Congress on Evolutionary Computation (CEC'08) 3016 3023 2008
- krohling Renoto A. , Coelho , L.S. PSO-E: Particle Swarm with Exponential Distribution Proc. of IEEE Congress on Evolutionary Computation 1428 1433 2006
- Krohling Renato A. Gaussian Swarm: A Novel Particle Swarm Optimization Algorithm Proc. of the 2004 IEEE Conference on Cybernetics and Intelligent Systems 372 376 2004
- Pant M. , Thangaraj R. and Singh V. P. Particle Swarm Optimization: Experimenting the Distributions of Random Numbers 3rd Indian Int. Conf. on Artificial Intelligence 412 420 2007
- Montgomery DC Design and analysis of experiments John Wiley & Sons USA 2004
- Simpson TW , Lin DKJ , and Chen W Sampling Strategies for Computer Experiments: Design and Analysis International Journal of Reliability and Applications 2 3 209 240 2001
- McKay MD , Beckman RJ , and Conover WJ A Comparison of Three Methods for Selecting Values of Input Variables from a Computer Code Technometrics 21 239 245 1979
- Iman RL , and Conover WJ Small sample sensitivity analysis techniques for computer models with an application to risk assessment Communications in Statistics, Part A. Theory and Methods 17 1749 1842 1980
- Shi Y. H. and Eberhart R. C. A Modified Particle Swarm Optimizer IEEE International Conference on Evolutionary Computation 69 73 1998
- Kennedy J. The Particle Swarm: Social Adaptation of Knowledge IEEE International Conference on Evolutionary Computation (Indianapolis, Indiana) 303 308 1997
- Eberhart R. C. and Shi Y. Particle Swarm Optimization: developments, Applications and Resources IEEE Int. Conference on Evolutionary Computation 81 86 2001
- Clerc Maurice Confinements and Biases in Particle Swarm Optimization http://clerc.maurice.free.fr/pso/ 2006
- Morris MD , and Mitchell TJ Exploratory designs for computational experiments Journal of Statistical Planning and Inference 43 381 402 1995
- Ye KQ , Li W , and Sudjianto A. Algorithmic construction of optimal symmetric Latin hypercube designs Journal of Statistical Planning and Inference 90 145 159 2000
- Fang KT , Ma CX , and Winker P. Centered L2-discrepancy of random sampling and Latin hypercube design and construction of uniform designs Mathematics of Computation 71 275 296 2002
- Bates SJ , Sienz J and Toropov VV. Formulation of the optimal Latin hypercube design of experiments using a permutation genetic algorithm 45th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference 2004 2011 2004
- Jin R , Chen W , and Sudjianto A. An Efficient Algorithm for Constructing Optimal Design of Computer Experiments Journal of Statistical Planning and Inference 134 268 287 2005
- Liefvendahl M and Stocki R. A study on algorithms for optimization of Latin hypercubes Journal of Statistical Planning and Inference 136 9 3231 3247 2006
- Van Dam E , Husslage B , den Hertog D , Melissen H. Maximin Latin hypercube designs in two dimensions Operations Research 55 1 158 169 2007
- Grosso A , Jamali A , and Locatelli M. Finding maximin Latin hypercube designs by Iterated Local Search heuristics European Journal of Operational Research 197 2 541 547 2009
- Viana Felipe A. C. , Venter Gerhard and Balabanov Vladimir An algorithm for fast optimal Latin hypercube design of experiments International Journal for Numerical Methods in Engineering 82 135 156 2010