Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/11382
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKothari, Ravi-
dc.contributor.authorGhosh, Diptesh-
dc.date.accessioned2013-11-20T12:36:09Z-
dc.date.available2013-11-20T12:36:09Z-
dc.date.copyright2012-01-
dc.date.issued2013-11-20-
dc.identifier.urihttp://hdl.handle.net/11718/11382-
dc.description.abstractThe single row facility layout problem (SRFLP) 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 two tabu search implemen- tations, one involving an exhaustive search of the 2-opt neighborhood and the other involving an exhaustive search of the insertion neighborhood. We also present techniques to signi cantly speed up the search of the two neighborhoods. Our computational experiments show that the speed up techniques are e ective, and our tabu search implementations are competitive. Our tabu search implementations improved several previously known best solutions for large sized benchmark SRFLP instances.en_US
dc.language.isoenen_US
dc.relation.ispartofseries;W.P. No. 2012-01-03-
dc.subjectFacilities planning and designen_US
dc.subjectSingle Row Facility Layouten_US
dc.subjectTabu Searchen_US
dc.titleTabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoodsen_US
dc.typeWorking Paperen_US
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
2012-01-03Kothari.pdf421.58 kBAdobe PDFView/Open


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