文献类型：会议论文

英文题名：Adaptive Particle Swarm Optimization for Continuous Domain

作者：Qi, Chengming[1]

第一作者：亓呈明

通讯作者：Qi, CM[1]

机构：[1]Beijing Union Univ, Coll Automat, Beijing 100101, Peoples R China

第一机构：北京联合大学城市轨道交通与物流学院

通讯机构：[1]corresponding author), Beijing Union Univ, Coll Automat, Beijing 100101, Peoples R China.|[1141751]北京联合大学城市轨道交通与物流学院;[11417]北京联合大学;

会议论文集：International Conference on Industry, Information System and Material Engineering

会议日期：APR 16-17, 2011

会议地点：Guangzhou, PEOPLES R CHINA

语种：英文

外文关键词：Continuous Domain; Pareto local search; Particle swarm optimization

摘要：An Adaptive particle swarm optimization algorithm is proposed. Algorithm combines with pareto local search (PLS) method and adaptively adjusts flying time. During the search process, our algorithm can enhance the local search ability of particle swarm optimization (PSO) thought adding random perturbation to local search. The flying time of every particle in our algorithm can adaptively adjust with the evolutionary generations. Some optimization tests of the standard benchmark function confirm that our method has a stronger ability of global optimization.