您当前所在位置: 首页 > 学者

黄敏

  • 99浏览

  • 0点赞

  • 0收藏

  • 0分享

  • 109下载

  • 0评论

  • 引用

期刊论文

Genetic algorithm solution for a risk-based partner selection problem in a virtual enterprise

黄敏W.H. Ip a Min Huang b* K.L. Yung a Dingwei Wang b

Computers & Operations Research 30(2003)213-231,-0001,():

URL:

摘要/描述

Dynamic alliance and virtual enterprise (VE) are essential components of global manufacturing. Minimizing risk in partner selection and ensuring the due date of a project are the key problems to overcome in VE, in order to ensure success. In this paper, a risk-based partner selection problem is described and modeled. Based on the concept of ine6cient candidate, the solution space of the problem is reduced e7ectively. By using the characteristics of the problem considered and the knowledge of project scheduling, a rule-based genetic algorithm (R-GA) with embedded project scheduling is developed to solve the problem. The performance of this algorithm is demonstrated by a problem encountered in the construction of a stadium station and the experimental problems of di7erent sizes. The results of this trial demonstrate the real life capability of the algorithm.

关键词:

【免责声明】以下全部内容由[黄敏]上传于[2005年11月07日 19时05分14秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。

我要评论

全部评论 0

本学者其他成果

    同领域成果