Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/11422
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKothari, Ravi-
dc.contributor.authorGhosh, Diptesh-
dc.date.accessioned2013-11-25T11:46:04Z-
dc.date.available2013-11-25T11:46:04Z-
dc.date.copyright2012-04-
dc.date.issued2013-11-25-
dc.identifier.urihttp://hdl.handle.net/11718/11422-
dc.description.abstractThe single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard and research has focused on heuristics to solve large instances of the problem. In this paper we present four scatter search algorithms to solve large sized SRFLP instances. Our computational experiments show that these algorithms generate better solutions to 26 of the 43 large sized benchmark SRFLP instances than were previously known in the literature. In the other 17 instances they output the best solutions previously known in the literature.en_US
dc.language.isoenen_US
dc.relation.ispartofseries;W.P. No. 2012-04-01-
dc.subjectFacilities planning and designen_US
dc.subjectSingle Row Facility Layouten_US
dc.subjectScatter searchen_US
dc.titleScatter search algorithms for the single row facility layout problemen_US
dc.typeWorking Paperen_US
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
2012-04-01Kothari.pdf398.65 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.