By Topic

A novel genetic algorithm for partner selection problem in virtual enterprise

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)

Partner selection is a key problem in VE. Mhimizing risk in partner selection and ensuring the due date of the project are key to ensure the success of the VE. In this paper, a multi-objective optimization model is proposed based on the project that is organized by activity network. The objective is to minimize project failure risk and project cost together with tardy penalty by selecting the optimal combination of 'partner enterprises for all sub-projects. The rules based genetic algorithm (R-CA) and the method using R-CA solution to reduce the search space of the enumeration algorithm are . presented. Compared with the CA without rule and enumeration algorithm, the R-CA has better synthetic performance in both the computation speed and optimality as knowledge about the project is used in the rule of the R-CA. The results indicate that the proposed model and algorithm can obtain satisfactory of the problems.

Published in:

Intelligent Mechatronics and Automation, 2004. Proceedings. 2004 International Conference on

Date of Conference:

26-31 Aug. 2004