模糊环境下基于Vague集的虚拟企业伙伴选择研究

摘要

To solve the partner selection problem with fuzzy completion time and due date in a vir-tual enterprise ,a new method based on Vague sets was proposed .Based on the concept of delivery time satisfiability degree ,the formulated partner selection problem was interpreted so as to maximize the delivery time satisfiability degree index .The model took into account the factors of delivery time satisfiability degree ,cost and the precedence of tasks .Standard particle swarm optimization(PSO) al-gorithm was easily trapped in local optimum ,so chaotic searching behavior was incorporated into standard PSO algorithm and a CPSO algorithm was proposed to solve the problem .The simulation of an example demonstrates that the local searching capability of the CPSO algorithm is much better than that of standard PSO algorithm .%为解决模糊完工时间和交货期下的虚拟企业伙伴选择问题，提出一种基于V ag ue集的伙伴选择方法。在给出基于Vague集的交货时间满足度概念的基础上，建立了以极大化交货时间满足度指数为优化目标的虚拟企业伙伴选择模型，该模型考虑了交货时间满足度、成本和任务间的时序关系等因素。为解决标准粒子群优化算法容易陷入局部极值的问题，引入混沌搜索方法，设计了一种混沌粒子群优化算法进行模型求解。实例分析表明，混沌粒子群优化算法比标准粒子群优化算法具有更强的局部搜索能力。