An Ant Colony Optimisation algorithm for partner selection in Virtual Enterprises
by Fangqi Cheng, Feifan Ye, Jianguo Yang
International Journal of Materials and Product Technology (IJMPT), Vol. 34, No. 3, 2009

Abstract: Partner selection problem seeks to find a best combination of enterprises by optimising a nonlinear objective over the given constraints. In this paper the partner selection problem is modelled as a nonlinear integer programming problem and an Ant Colony Optimisation (ACO) algorithm embedded project scheduling is presented for solving the problem with the lead time, subproject cost and risk factor constraints in Virtual Enterprises (VE). Genetic Algorithm (GA) and enumeration algorithm are introduced for comparison to check the effectiveness of the ACO algorithm. A case study is implemented to verify the feasibility of the proposed approach and the computational results are satisfactory.

Online publication date: Tue, 14-Apr-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Materials and Product Technology (IJMPT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com