Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/11396
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKothari, Ravi-
dc.contributor.authorGhosh, Diptesh-
dc.date.accessioned2013-11-22T10:52:53Z-
dc.date.available2013-11-22T10:52:53Z-
dc.date.copyright2012-05-
dc.date.issued2013-11-22-
dc.identifier.urihttp://hdl.handle.net/11718/11396-
dc.description.abstractThe single row facility layout problem is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In this paper we present path relinking algorithms to solve large sized instances of the problem. We use three di erent metaheuristics to generate sets of good quality initial solutions and subject the solutions in these sets to path relinking. We present our computational experience on 43 benchmark instances with up to 110 facilities.en_US
dc.language.isoenen_US
dc.relation.ispartofseries;W.P. No. 2012-05-01-
dc.subjectFacilities planning and designen_US
dc.subjectSingle Row Facility Layouten_US
dc.subjectTabu Searchen_US
dc.subjectLin- Kernighan neighborhood searchen_US
dc.subjectScatter search, Path relinkingen_US
dc.titlePath relinking for single row facility layouten_US
dc.typeWorking Paperen_US
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
2012-05-01Kothari.pdfPath relinking for single row facility layout334.05 kBAdobe PDFView/Open


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