Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPonnambalam, S G-
dc.contributor.authorSudhakarapandian, R-
dc.contributor.authorMahapatra, S S-
dc.contributor.authorSaravanasankar, S-
dc.identifier.citationIEEE International Conference on Automation Science and Engineering, 2008. CASE 2008, Arlington, VA, P 603 - 608en
dc.descriptionCopyright for the paper belongs to IEEEen
dc.description.abstractIn the present work, an attempt has been made to form disjoint machine cells using modified ART1 (adaptive resonance theory) to handle the real valued workload matrix. The methodology first allocates the machines to various machine cells and then parts are assigned to those cells with the aid of degree of belongingness through a membership index. The proposed algorithm uses a supplementary procedure to effectively take care of the problem of generating cells with single machine that may be encountered at times. A modified grouping efficiency (MGE) is proposed to measure the performance of the clustering algorithm. The results of modified ART1 algorithm are compared with the results obtained from K-means clustering and genetic algorithm. The modified ART1 results are also compared with the literature results in terms of number of exceptional elements. The performance of the proposed algorithm is tested with genetic algorithm and K-means clustering algorithm. The results distinctly indicate that the proposed algorithm is quite flexible, fast and efficient in computation for cell formation problems and can be applied in industries with convenience.en
dc.format.extent272162 bytes-
dc.subjectART neural netsen
dc.subjectcellular manufacturingen
dc.subjectpattern clusteringen
dc.subjectproduction engineering computingen
dc.titleModified ART1 neural networks for cell formation using production dataen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
sudhagara pandiay.pdf265.78 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.