A scatter search algorithm for the single row facility layout problem

IIMA Institutional Repository

Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/13508

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kothari, Ravi
dc.contributor.author	Ghosh, Diptesh
dc.date.accessioned	2015-05-12T08:55:05Z
dc.date.available	2015-05-12T08:55:05Z
dc.date.issued	2014
dc.identifier.citation	Kothari, R., & Ghosh, D. (2014). A scatter search algorithm for the single row facility layout problem. Journal Of Heuristics, (2), 125.	en_US
dc.identifier.issn	13811231
dc.identifier.uri	http://hdl.handle.net/11718/13508
dc.description.abstract	The 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.iso	en	en_US
dc.publisher	Springer	en_US
dc.subject	Algorithm	en_US
dc.title	A scatter search algorithm for the single row facility layout problem	en_US
dc.type	Article	en_US
Appears in Collections:	Journal Articles

Files in This Item:

File	Description	Size	Format
A scatter search algorithm for the single row facility layout problem.pdf Restricted Access		268.04 kB	Adobe PDF	View/Open Request a copy