| 一种求解集合组合问题的离散粒子群优化模型 |
| |
| 引用本文： | 陈自郁,何中市,何静媛. 一种求解集合组合问题的离散粒子群优化模型[J]. 华南理工大学学报(自然科学版), 2010, 38(4). DOI: 10.3969/j.issn.1000-565X.2010.04.026 |
| |
| 作者姓名： | 陈自郁 何中市 何静媛 |
| |
| 作者单位： | 重庆大学,计算机学院,重庆,400030;重庆大学,计算机学院,重庆,400030;重庆大学,计算机学院,重庆,400030 |
| |
| 基金项目： | 国家自然科学基金,国家高技术研究发展计划(863计划),国家重大专项项目,重庆市自然科学基金资助项目 |
| |
| 摘 要： | 针对变长集合组合优化问题,提出了一种离散粒子群优化模型.该模型将集合的概念和运算引入粒子群优化中,定义了一个可变集合搜索空间,并重新定义了粒子的位置、速度及作用于此空间的运算规则,既保留了粒子群本身的优化特性,又体现了集合组合优化的特点.采用典型的变长集合组合优化问题——背包问题来验证此模型的性能,并与二进制粒子群优化(BPSO)算法进行了对比.结果表明,该模型具有较强的寻优能力和更高的稳定性.
|
| 关 键 词： | 集合 组合优化 离散粒子群优化 背包问题 |
| 收稿时间： | 2009-02-12 |
| 修稿时间： | 2009-10-15 |
Discrete Particle Swarm Optimization Model for Set-Based Combinatorial Optimization Problems |
| |
| Chen Zi-yu,He Zhong-shi,He Jing-yuan. Discrete Particle Swarm Optimization Model for Set-Based Combinatorial Optimization Problems[J]. Journal of South China University of Technology(Natural Science Edition), 2010, 38(4). DOI: 10.3969/j.issn.1000-565X.2010.04.026 |
| |
| Authors: | Chen Zi-yu He Zhong-shi He Jing-yuan |
| |
| Abstract: | In order to solve set-based combinatorial problems, a new model of discrete particle swarm optimization is proposed. According to set characteristics, set concepts and operations are introduced into particle swarm optimization. In the model, a search space of variable set is defined and particle’ velocity and location are re-stated. New operators are defined to work on the set search space. For validating it, the model was applied to solve knapsack problem,a typical set-based combinatorial optimization problem. The experiment results demonstrate that the PSO based on the model has great superiority both in searching ability and stability. |
| |
| Keywords: | swarm intelligence discrete particle swarm optimization set combinatorial optimization knapsack problem |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《华南理工大学学报(自然科学版)》浏览原始摘要信息 |
|
