基于改进粒子群算法的跨组织资源链构建研究

Research on Inter-organizational Resources Chain Construction Based on Improved PSA

基于时序约束任务链驱动的资源链构建视角研究了跨组织资源共享问题,提出了以时间、成本、服务能力综合最优来构建跨组织资源链无约束数学模型,并设计了求解该模型的改进二进制粒子群算法。该算法通过采用惩罚函数,并引入时变粒子位置编码、参数设置和位置更新,提高了算法的收敛速度和全局搜索能力。最后对一个跨组织资源链的构建算例进行了仿真,并利用改进的粒子群算法构建了基于时间、成本和服务能力综合最优的跨组织资源链,研究结果及分析对比结果表明,该方法是有效可行的。

In view that temporal constraint task chain drived resource chain construction to solve problems on inter organizational resources sharing, a non--constraint mathematical model for inter-- organizational resource chain construction was proposed, the mathematical model adopted penalty function and aimed to time, cost and service capacity comprehensive optimization. Then, an improved binary PSA for solving the model was designed. By introducing particle position coding, parameter setting and position updating which were time changing and self adapting, the improved algorithm can enhance convergence speed and global search capability. Through a simulation example, according to the improved binary PSA, an inter--organizational resources chain was realized which was based on time, cost and service capacity comprehensive optimization. The results of the study and comparative analysis show that the method is effective and feasible.