求解整数规划问题的微粒群算法  

Particle Swarm Optimization for Integer Programming

作　　者：谭瑛[1] 高慧敏[1] 曾建潮[1] 

机构地区：[1]太原重型机械学院系统仿真与计算机应用研究所,山西太原030024

出　　处：《系统工程理论与实践》2004年第5期126-129,共4页Systems Engineering-Theory & Practice

基　　金：山西省自然科学基金

摘　　要：　针对整数规划问题的特点,提出了一种在整数空间中进行进化计算的PSO算法,使微粒群的进化限于整数空间.仿真实验结果验证了方法的正确性与有效性.Particle Swarm Optimization (PSO) has been successfully applied to many optimization problems on real search space. For integer programming, there exist some difficulties and problems for the direct applications of PSO due to the variables belonging to the set of integers. In this paper, a new PSO algorithm is presented for integer programming, which evolves on the set of Integer space. The results regarding the performance of PSO algorithm on the class of problems are reported.

关 键 词：整数规划 微粒群算法 等概率分布 进化计算 

分 类 号：O224[理学—运筹学与控制论]