【外文翻譯】采用遺傳算法選擇以風(fēng)險為基礎(chǔ)的虛擬企業(yè)伙伴.rar
【外文翻譯】采用遺傳算法選擇以風(fēng)險為基礎(chǔ)的虛擬企業(yè)伙伴,摘要動態(tài)聯(lián)盟和虛擬企業(yè)(ve)是全球制造主要組成部分。為了確保成功克服ve的關(guān)鍵問題是盡量減少選擇風(fēng)險合作伙伴，并確保到期的項目。本文描述和建模以風(fēng)險為基礎(chǔ)的合作伙伴選擇問題,基于效率不高的候選人,解決問題的方法是有效地降低。通過使用的特點，考慮問題，項目調(diào)度，以規(guī)則為基礎(chǔ)的遺傳算法（注冊商標(biāo)算法）與嵌入式開發(fā)項目調(diào)度...
該文檔為壓縮文件,包含的文件列表如下:
內(nèi)容介紹
原文檔由會員 s020700640 發(fā)布
摘要
動態(tài)聯(lián)盟和虛擬企業(yè)(VE)是全球制造主要組成部分。為了確保成功克服VE的關(guān)鍵問題是盡量減少選擇風(fēng)險合作伙伴，并確保到期的項目。本文描述和建模以風(fēng)險為基礎(chǔ)的合作伙伴選擇問題,基于效率不高的候選人,解決問題的方法是有效地降低。通過使用的特點，考慮問題，項目調(diào)度，以規(guī)則為基礎(chǔ)的遺傳算法（注冊商標(biāo)算法）與嵌入式開發(fā)項目調(diào)度來解決這個問題。表現(xiàn)該算法像是一個問題所表現(xiàn)出施工中遇到的一個體育場和實驗大小不同的問題。此次測試的結(jié)果表明現(xiàn)實生活的算法能力。
Genetic algorithm solution for a risk-based partner selection problem in a virtual enterprise
Abstract
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 inefficient candidate, the solution space of the problem is reduced effectively. 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 different sizes. The results of this trial demonstrate the real life capability of the algorithm.
動態(tài)聯(lián)盟和虛擬企業(yè)(VE)是全球制造主要組成部分。為了確保成功克服VE的關(guān)鍵問題是盡量減少選擇風(fēng)險合作伙伴，并確保到期的項目。本文描述和建模以風(fēng)險為基礎(chǔ)的合作伙伴選擇問題,基于效率不高的候選人,解決問題的方法是有效地降低。通過使用的特點，考慮問題，項目調(diào)度，以規(guī)則為基礎(chǔ)的遺傳算法（注冊商標(biāo)算法）與嵌入式開發(fā)項目調(diào)度來解決這個問題。表現(xiàn)該算法像是一個問題所表現(xiàn)出施工中遇到的一個體育場和實驗大小不同的問題。此次測試的結(jié)果表明現(xiàn)實生活的算法能力。
Genetic algorithm solution for a risk-based partner selection problem in a virtual enterprise
Abstract
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 inefficient candidate, the solution space of the problem is reduced effectively. 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 different sizes. The results of this trial demonstrate the real life capability of the algorithm.
