DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1331

Full metadata record

DC FieldValueLanguage
contributor.authorNayak, N-
contributor.authorPrasanna, K-
contributor.authorDatta, S-
contributor.authorMahapatra, S S-
contributor.authorSahu, S-
date.accessioned2010-12-20T08:46:29Z-
date.available2010-12-20T08:46:29Z-
date.issued2010-12-
identifier.citationInternational Conference on Industrial Engineering and Engineering Management (IEEM 2010)7th-10th December 2010 Macau, PR China.en
identifier.urihttp://hdl.handle.net/2080/1331-
descriptionCopyright belongs to Proceedings Publisheren
description.abstractPartner 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.en
format.extent200442 bytes-
format.mimetypeapplication/pdf-
language.isoen-
subjectVirtual enterprisesen
subjectDiscrete particle swarm optimizationen
subjectPartner selectionen
subjectRisken
titleA Novel Swarm Optimization Technique for Partner Selection in Virtual Enterpriseen
typeArticleen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
P-0035 ssm2.pdf195KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

Powered by DSpace Feedback