Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/13616
Title: Insertion based lin-kernighan heuristic for single row facility layout
Authors: Kothari, R.
Ghosh, Diptesh
Keywords: Heuristic
Issue Date: 2013
Publisher: Elsevier Ltd
Citation: Kothari, R., & Ghosh, D. (2013). Insertion based Lin–Kernighan heuristic for single row facility layout. Computers And Operations Research, 40129-136.
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 first such heuristic for the SRFLP. Our computational experiments show that LK-INSERT is competitive for most instances, and it improves the best-known solutions for several large sized benchmark SRFLP instances.
URI: http://hdl.handle.net/11718/13616
ISSN: 03050548
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
Insertion based Lin-Kernighan Heuristic for Single Row Facility Layout.pdf
  Restricted Access
216.21 kBAdobe PDFView/Open Request a copy


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