文献类型：会议论文

英文题名：A Discrete PSO Algorithm for Partner Selection of Virtual Enterprise

作者：Bu Yan-ping[1,2];Zhou Wei[3];Yu Jin-shou[1]

机构：[1]East China Univ Sci & Technol, Res Inst Automat, Shanghai 200237, Peoples R China;[2]Shanghai Jiao Tong Univ, Sch Technol, Shanghai 201101, Peoples R China;[3]East China Univ Sci & Technol, Sch Business, Shanghai 200237, Peoples R China

会议论文集：2nd International Symposium on Intelligent Information Technology Application

会议日期：DEC 21-22, 2008

会议地点：Shanghai, PEOPLES R CHINA

语种：英文

摘要：The partner selection and optimization problem is an important area of virtual enterprise. The model of partner selection is analyzed in this paper. In a virtual enterprise, the whole task can be accomplished by the cooperation among those candidate partners. The optimal objective is to minimize the total cost and completing time. To improve the searching performance for particle swarm optimization (PSO), and satisfy the optimal target, a discrete PSO (DPSO) algorithm is presented and applied to solve the partner selection problem of virtual enterprise. In DPSO, each particle represents a candidate solution, and its component takes an integer number between I and the number of alternative enterprises of the certain sub-task. A series of experiments are performed and the simulation results are compared with the genetic algorithm (GA) to show the efficiency of the proposed DPSO algorithm. Moreover, the results obtained through the DPSO can be confirmed by the method of exhaustion.