An Ant Colony Optimization for Partner Selection in Virtual Enterprise
Partner selection is one of the core problems in the phase of virtual enterprise(VE)creation,since the selection of right partners is crucial to the Success of VE.To effectively solve the partner selection and optimization problem in VE practice.a mathematical model with the Objective of minimizing the total manufacturing cost of tasks within the due date is discussed in this Paper.As the ob.iective formulation is not continuous and dirrerential,it cannot be solved exactly by integer programming,an improved ant colony optimization algorithm(LACO) is proposed to solve the problem.A crossover operator Which is usually used in genetic algorithm(GA)is introduced jnto IACO,so it can improve the search ability of ant colony and make consequently solution better.Finally.an illustrative example is presented to show the emciency of the algorithn.
Ant colony optimization(ACO) Crossover operator Partner selection Virtual enterprise
Z.B.Jiang Y.Gao Y.S.Ding
国际会议
The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)
成都
英文
1415-1418
2007-12-19（万方平台首次上网日期，不代表论文的发表时间）