Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/11432
Title: | A Lin-Kernighan heurisitic for single row facility layout |
Authors: | Kothari, Ravi Ghosh, Diptesh |
Keywords: | Facilities planning and design;Single Row Facility Layout;Lin-Kernighan Neigh- borhood;Insertion Neighborhood;Local search |
Issue Date: | 25-Nov-2013 |
Series/Report no.: | ;W.P. No. 2012-01-04 |
Abstract: | The 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 known to be NP-hard. In this paper, we present a neighborhood search heuristic called LK-INSERT which uses a Lin-Kernighan neighborhood structure built on insertion neighborhoods. To the best of our knowledge this is the rst such heuristic for the SRFLP. Our computational experiments show that LK-INSERT is competitive and improves the best known solutions for several large sized benchmark SRFLP instances. |
URI: | http://hdl.handle.net/11718/11432 |
Appears in Collections: | Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2012-01-04Kothari.pdf | 389.48 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.