[1]LIU Hong-da,MA Zhong-li.A particle swarm optimization algorithm based on uniform design[J].CAAI Transactions on Intelligent Systems,2010,5(4):336-341.
Copy

A particle swarm optimization algorithm based on uniform design

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 5 Number of periods: 2010 4 Page number: 336-341 Column: 学术论文—人工智能基础 Public date: 2010-08-25
Title:
A particle swarm optimization algorithm based on uniform design
Author(s):
LIU Hong-da;  MA Zhong-li
College of Automation， Harbin Engineering University， Harbin 150001，China
Keywords:
PSO;  uniform design;  realtime optimization;  key population
CLC:
TP18
DOI:
-
Abstract:
In a normal PSO algorithm, particle populations are usually produced randomly, leading to variations in search quality and speed. Such algorithms cannot be used to solve engineering problems that must be optimized quickly. In order to solve such problems, a PSO algorithm based on uniform design was used to generate initial PSO populations. This made the distribution of particles more uniform in the search space. Four methods for generation of particle swarms were studied. Test results showed that search precision was considerably improved if the generation of a particle swarm by the uniform design method was based on value range division. That method maintained search efficiency and precision, stabilized search efficiency and precision, and reduced the possibility of swarm aggregation and premature convergence. 
References:
［1］KENNEDY J E R. Particle swarm optimization［C］//Proc of IEEE International Conference on Neural Networks. Perth, USA， 1995: 1942-1948. 
［2］刘宏达.粒子群算法的研究及其在船舶工程中的应用［D］.哈尔滨：哈尔滨工程大学,2007.
LIU Hongda. Research of particle swarm optimization algorithm andi its application in ship engineering［D］.Harbin: Harbin Engineering University, 2007.
［3］ 张铃, 张钹.佳点集遗传算法［J］.计算机学报，2001，24(9): 917922 . 
?ZHANG Ling， ZHANG Bo. Good point set based genetic algorithm［J］.Chinese Journal of Computers, 2001, 24(9): 917-922 .
［4］XUE Guochen, XIN Li. Application of uniform design and genetic algorithm in optimization of reversedphase chromatographic separation［J］. Chemometrics and Intelligent Laboratory Systems, 2003, 68(2): 157-166. 
［5］薛明志,钟伟才,刘静,焦李成. 正交MultiAgent遗传算法及其性能分析［J］. 控制与决策,2004，19(3):290-294.
?XUE Mingzhi, ZHONG Weicai, LIU Jing, JIAO Licheng. Orthogonal multiAgent genetic algorithm and its performance analysis［J］.Control and Decision, 2004， 19(3): 290-294.
［6］何大阔,王福利,张春梅.基于均匀设计的遗传算法参数设定［J］.东北大学学报：自然科学版, 2003, 24(5)： 409-411.
HE Dakuo, WANG Fuli, ZHANG Chunmei. Establishment of parameters of genetic algorithm based on uniform design［J］.Journal of Northeastern University：Natural Science, 2003, 24(5)： 409-411.
［7］方开泰,马长兴.正交与均匀试验设计［M］.北京:科学出版社，2001:89-105. 
［8］QIN Hong, ZHANG Shangli, FANG Kaitai.Constructing uniform designs with twoor threelevel［J］. Acta Mathematica Scientia， 2006， 26(3): 451-459.
［9］ZHENG Yongling, MA Longhua, ZHANG liyan, QIAN Jixin. On the convergence analysis and parameter selection in particle swarm optimization［C］//Proceedings of the International Conference on Machine Learning and Cybernetics. Xi’an， China, 2003: 1802-1807.
［10］Fang Kaitai. Uniform design tables［EB/OL］.［2010-01-12］. http://www.math.hkbu.edu.hk/UniformDesign/,2010.
［11］孙先仿,范跃祖,宁文如. U*均匀设计的均匀性研究［J］.应用概率统计, 2001, 17(4): 341345. SUN Xianfang, FAN Yuezu, NING Wenru.On the uniformity of U* uniform designs［J］.Chinese Journal of Applied Probability and Statistics, 2001, 17(4): 341-345.
［12］HICKERNELL F J. A generalized discrepancy and quadrature error bound［J］.Math Computation, 1998， 67: 299322.
［13］FANG K T, QIN H. A note on construction of nearly uniform designs with large number of runs［J］.Statistics and Probability Letters, 2003, 61(2): 215-224.
Similar References:

Memo

-

Last Update: 2010-09-20

Copyright © CAAI Transactions on Intelligent Systems