欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
对虚拟企业构建中在满足工期约束条件下,以费用最低为目标的伙伴选择问题进行描述,并给出数学模型。采用限制法证明该问题是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.
同期刊论文项目
同项目期刊论文
期刊信息
位置：