A novel swarm optimization technique for partner selection in virtual enterprise

Abstract

Partner selection is a critical issue in formation of virtual enterprises and increasing its operational effectiveness. Such a problem belongs to combinatorial optimization category and known as NP-hard problem. Usually, evolutionary methods are being adopted to obtain near-optimal solutions. In this paper, a variant of swarm optimization is proposed to handle combinatorial problems efficiently compared to its continuous counterpart. The method substantially reduces the number of tuning parameters in the algorithm. The algorithm presented include main crucial factors for partner selection such as the running cost, reaction time and running risk and select the partners for various processes that minimizes total cost. The working of the algorithm is demonstrated with the help of a typical example. Exhaustive simulation illustrates the effectiveness of algorithm.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 7 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.