dc.contributor.author | Kothari, Ravi | |
dc.contributor.author | Ghosh, Diptesh | |
dc.date.accessioned | 2013-11-25T12:27:29Z | |
dc.date.available | 2013-11-25T12:27:29Z | |
dc.date.copyright | 2012-01 | |
dc.date.issued | 2013-11-25 | |
dc.identifier.uri | http://hdl.handle.net/11718/11432 | |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | ;W.P. No. 2012-01-04 | |
dc.subject | Facilities planning and design | en_US |
dc.subject | Single Row Facility Layout | en_US |
dc.subject | Lin-Kernighan Neigh- borhood | en_US |
dc.subject | Insertion Neighborhood | en_US |
dc.subject | Local search | en_US |
dc.title | A Lin-Kernighan heurisitic for single row facility layout | en_US |
dc.type | Working Paper | en_US |