期刊
COMPUTERS & MATHEMATICS WITH APPLICATIONS
卷 49, 期 11-12, 页码 1655-1668出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.camwa.2005.02.006
关键词
particle swarm optimization; nonlinear programming; global optimization; evolutionary algorithm; priority-based ranking
Particle swarm optimization (PSO) is an optimization technique based on population, which has similarities to other evolutionary algorithms. It is initialized with a population of random solutions and searches for optima by updating generations. Particle swarm optimization has become the hotspot of evolutionary computation because of its excellent performance and simple implementation. After introducing the basic principle of the PSO, a particle swarm optimization algorithm embedded with constraint fitness priority-based ranking method is proposed in this paper to solve nonlinear programming problem. By designing the fitness function and constraints-handling method, the proposed PSO can evolve with a dynamic neighborhood and varied inertia weighted value to find the global optimum. The results from this preliminary investigation are quite promising and show that this algorithm is reliable and applicable to almost all of the problems in multiple-dimensional, nonlinear and complex constrained programming. It is proved to be efficient and robust by testing some example and benchmarks of the constrained nonlinear programming problems. (c) 2005 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据