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

中国机械工程第 24 卷第 9 期 2013 年 5 月上半月 基于改进粒子群算法的跨组织资源链构建研究 王正成成这 浙江理工大学，杭州，310018 摘要:基于时序约束任务链驱动的资源链构建视角研究了跨组织资源共享问题，提出了以时间、成 本、服务能力综合最优来构建跨组织资源链无约束数学模型，并设计了求解该模型的改进二进制粒子群 算法。该算法通过采用惩罚函数，并引入时变粒子位直编码、参数设直和位直更新，提高了算法的收敛 速度和全局搜索能力。最后对一个跨组织资源链的构建算例进行了仿真，并利用改进的粒子群算法构 建了基于时间、成本和服务能力综合最优的跨组织资源链，研究结采及分析对比结果表明，该方法是有 效可行的。 关键词:粒子群算法;跨组织资源链;数学模型;仿真算例 中图分类号:TP165 DOI:10. 3969/j. issn. 1004-132X. 2013. 09. 012 Research on Inter- organizational Resources Chain Construction ßased on Improved PSA Wang Zhengcheng Xian Da Zhejiang Sci-Tech University ,Hangzhou ,310018 Abstract: 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 solvíng the model was desígned. By i 日troducíng 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 , accordíng 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. Key words: particle swarm algorithm(PSA); inter-organizational resources chain; mathematical model; simulation example 0 引言 决策 NP 问题，当