EPrints@IIT Delhi >
Faculty Research Publicatons  >
Management Studies >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/1476

Full metadata record

DC FieldValueLanguage
dc.contributor.authorSolimanpur, M-
dc.contributor.authorVrat, Prem-
dc.contributor.authorShankar, Ravi-
dc.identifier.citationComputers & Operations Research, 32(3), 583-598en
dc.description.abstractSingle row machine layout problem is one of the most commonly used layout patterns, especially in flexible manufacturing systems. In this paper, this problem is formulated as a non-linear 0-1 programming model in which the distance between the machines is sequence dependent. An ant algorithm has been developed to solve this problem. A technique is proposed to efficiently implement the proposed algorithm. The performance of the proposed heuristic is tested over a number of problems selected from the literature. Computational results indicate that the proposed approach is more effective compared to many existing algorithms in this area.en
dc.format.extent624367 bytes-
dc.subjectSingle row layouten
dc.subjectFacility layouten
dc.subjectAnt colony optimizationen
dc.titleAn ant algorithm for the single row layout problem in flexible manufacturing systemsen
Appears in Collections:Management Studies

Files in This Item:

File Description SizeFormat
solimanpurant2005.pdf609.73 kBAdobe PDFView/Open
View Statistics

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


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback