Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/13508
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKothari, Ravi
dc.contributor.authorGhosh, Diptesh
dc.date.accessioned2015-05-12T08:55:05Z
dc.date.available2015-05-12T08:55:05Z
dc.date.issued2014
dc.identifier.citationKothari, R., & Ghosh, D. (2014). A scatter search algorithm for the single row facility layout problem. Journal Of Heuristics, (2), 125.en_US
dc.identifier.issn13811231
dc.identifier.urihttp://hdl.handle.net/11718/13508
dc.description.abstractThe single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard and research has focused on heuristics to solve large instances of the problem. In this paper we present a scatter search algorithm to solve large size SRFLP instances. Our computational experiments show that the scatter search algorithm is an algorithm of choice when solving large size SRFLP instances within limited time.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectAlgorithmen_US
dc.titleA scatter search algorithm for the single row facility layout problemen_US
dc.typeArticleen_US
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
A scatter search algorithm for the single row facility layout problem.pdf
  Restricted Access
268.04 kBAdobe PDFView/Open Request a copy


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