A novel swarm optimisation approach for risk-based partner selection in virtual enterprises Online publication date: Wed, 11-Mar-2015
by S.S. Mahapatra, N.R. Nayak, K. Prasanna, G.S. Beriha
International Journal of Services and Operations Management (IJSOM), Vol. 10, No. 1, 2011
Abstract: Selection of right partners is vital for virtual enterprise (VE) to take the advantage of market opportunity. Partner selection problem belongs to combinatorial optimisation category and known as NP-hard. A modified discrete particle swarm optimisation (PSO) algorithm is proposed, in this work, to select alliances in a VE. The velocity terms, which is commonly used in the standard PSO algorithm, is avoided; rather, the concept of proportional likelihood with modifications, a method used in data mining techniques, is adopted to improve solution quality. A set of experiments have been conducted and results indicate PSO algorithm is an effective and efficient way to solve the partner selection problems with precedence, risk of failure and due date constraints. A design of experiment (DoE) approach is adopted to study statistical significance of various model parameters on solution quality.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Services and Operations Management (IJSOM):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook