首页 | 官方网站   微博 | 高级检索  
     

多粒子群混合算法求解虚拟组织服务资源配置
引用本文:马书刚,杨建华,郭继东.多粒子群混合算法求解虚拟组织服务资源配置[J].中国管理信息化,2011(9).
作者姓名:马书刚  杨建华  郭继东
作者单位:1. 北京科技大学经济管理学院,北京100083;河北经贸大学商学院,石家庄050061
2. 北京科技大学经济管理学院,北京,100083
摘    要:为了提高虚拟组织服务资源配置的效率,本文提出了一种多粒子群混合算法。该混合算法将多种群与线性搜索相结合,在算法优化过程中,通过多个粒子种群协同来控制种群的多样性,将多种群中较优的粒子进行复制,同时在每个种群中对单个粒子进行维变量变换。实验结果表明该方法具有可行性。

关 键 词:虚拟组织  资源配置  多粒子群  

Cooperative Particle Swarm Optimization Algorithm for Optimal Service Resource Allocation in a Virtual Organization
MA Shu-gang,YANG Jian-hua,GUO Ji-dong.Cooperative Particle Swarm Optimization Algorithm for Optimal Service Resource Allocation in a Virtual Organization[J].China Management Informationization,2011(9).
Authors:MA Shu-gang  YANG Jian-hua  GUO Ji-dong
Affiliation:MA Shu-gang1,2,YANG Jian-hua1,GUO Ji-dong1 (1.School of Economics and Management,University of Science and Technology Beijing,Beijing 100083,China,2.School of Business,Hebei University of Economics and Business,Shijiazhuang 050061,China)
Abstract:Cooperative Particle Swarm Optimization Algorithm was proposed in order to improve the efficiency of service resource allocation in virtual organization.This paper combined Cooperative Particle Swarm with the line search method.Cooperative Particle Swarm controlled the diversity of swarm by copying best particles in the sub-populations during the process of optimization algorithm.The algorithm modified each variable of the particle.The result shows the proposed algorithm is feasibility.
Keywords:Virtual Organization  Resource Allocation  Cooperative Particle Swarm  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号