A novel swarm optimisation approach for risk-based partner selection in virtual enterprises

S.S. Mahapatra, N.R. Nayak, K. Prasanna and G.S. Beriha

International Journal of Services and Operations Management, 2011, vol. 10, issue 1, 52-73

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.

Keywords: discrete PSO; particle swarm optimisation; DPSO; virtual enterprises; partner selection; ANOVA; DOE; proportional likelihood; modifications; data mining; design of experiments. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=41989 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:10:y:2011:i:1:p:52-73

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().