摘要
描述了虚拟企业动态联盟中 ,含有多个子项目的活动网络伙伴挑选问题 .以满足伙伴方案满意度下的最小化竞标花费与拖期惩罚之和为目标 ,并为之建立 0 - 1整数规划模型 .同时进行了方案有效性过滤 ,减小了解空间 .量化了模糊决策 ,设计了嵌入模糊决策规则的遗传算法 (软计算方法 ) ,使得算法具有比普通遗传算法更好的寻优能力 .在大规模问题求解上 ,该算法具有比分枝定界法更快的速度 .
Partner selection of dynamic alliances for multi-job manufacturing systems in virtual enterprise is studied and a 0-1 programming model is proposed. The object is to find one kind of optimal combination and to minimize the total bid cost and tardiness penalty. In this paper, a soft computing method, which is one kind of fuzzy decision embedded genetic algorithm, is suggested to improve the computational performance. The computing result shows that it has high probability to find the optimal solution quickly for large size problems.
出处
《系统工程学报》
CSCD
2002年第2期121-125,共5页
Journal of Systems Engineering
基金
国家自然科学基金资助项目 ( 6 0 0 840 0 3) .
