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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Materials and Product Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
