Scatter search algorithms 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/11422

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kothari, Ravi	-
dc.contributor.author	Ghosh, Diptesh	-
dc.date.accessioned	2013-11-25T11:46:04Z	-
dc.date.available	2013-11-25T11:46:04Z	-
dc.date.copyright	2012-04	-
dc.date.issued	2013-11-25	-
dc.identifier.uri	http://hdl.handle.net/11718/11422	-
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 four scatter search algorithms to solve large sized SRFLP instances. Our computational experiments show that these algorithms generate better solutions to 26 of the 43 large sized benchmark SRFLP instances than were previously known in the literature. In the other 17 instances they output the best solutions previously known in the literature.	en_US
dc.language.iso	en	en_US
dc.relation.ispartofseries	;W.P. No. 2012-04-01	-
dc.subject	Facilities planning and design	en_US
dc.subject	Single Row Facility Layout	en_US
dc.subject	Scatter search	en_US
dc.title	Scatter search algorithms for the single row facility layout problem	en_US
dc.type	Working Paper	en_US
Appears in Collections:	Working Papers

Files in This Item:

File	Description	Size	Format
2012-04-01Kothari.pdf		398.65 kB	Adobe PDF	View/Open