Partner selection is a key problem in virtual enterprise (VE) and has attracted much research attention. In general, besides AHP, DEA and VSM, qualitative analysis methods are commonly used to deal with partner selection problem. Quantitative analysismethods for partner selection are still a challenge to VE. From different perspectives, Wu N Ko C. S W.H.Ip and li Naicheng[5]formulated model of partner selection and proposed corresponding approaches, such as optimization algorithms, graph-theoreticalmethod and so on. In this paper, a simplified partner selection problem which takes into account only bid cost and bid completion time of sub-projects, and due date of whole project is considered. An improved particle swarm optimization algorithm, named IPSO, is presented for the problem.
展开▼
机译：合作伙伴选择是虚拟企业（VE）的关键问题，并引起了众多研究的关注。通常，除了AHP，DEA和VSM，通常用于处理合作伙伴选择问题的定性分析方法。合作伙伴选择的定量分析仍然是对VE的挑战。从不同的观点来看，Wu n Ko C. S W.H.IP和Li Naicheng [5]配制的合作伙伴选择模型和提出的相应方法，如优化算法，图形 - 理论上等。在本文中，考虑了仅考虑了子项目的出价和出价完成时间的简化伙伴选择问题，以及整个项目的截止日期。提出了一个改进的粒子群优化算法，名为IPSO，以解决问题。
展开▼
