改进粒子群算法求解虚拟企业伙伴选择问题  

Partners Selection Problem in Virtual Enterprise Based on Improve Particle Swarm Optimization Algorithm

作　　者：赵强[1] 肖人彬[1] 

机构地区：[1]华中科技大学CAD中心,湖北武汉430074

出　　处：《工业工程与管理》2009年第2期38-42,共5页Industrial Engineering and Management

基　　金：国家自然科学基金项目(60474077);教育部新世纪人才支持计划项目(NCET-05-653)

摘　　要：对虚拟企业构建中在满足工期约束条件下,以费用最低为目标的伙伴选择问题进行描述,并给出数学模型。采用限制法证明该问题是NP完全问题。针对问题求解,提出改进粒子群优化求解算法,改进算法更改了粒子位置矢量的移动公式,并新增初始扩大及局部更新机制。实例及数字仿真验证了改进算法的有效性及高效性。The optimization problem for partner selection in virtual enterprise is described and modeled in this paper, whose objective is to minimize the total cost within the due date. With reduction method, the problem is proved to be a NP-complete problem. To solve it, an improved particle swarm optimization algorithm that named as IPSO algorithm is presented, in which the formulation on updating position vector of particles is changed, as well as initialization expansion mechanism and local updating mechanism are added. Real example and numerical simulations show that the IPSO algorithm is effective and efficient.

关 键 词：虚拟企业 伙伴选择 NP完全问题 粒子群优化 

分 类 号：TH165[机械工程—机械制造及自动化] TP18[自动化与计算机技术—控制理论与控制工程]