Population Heuristics for the Corridor Allocation Problem

IIMA Institutional Repository

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Ghosh, Diptesh	-
dc.contributor.author	Kothari, Ravi	-
dc.date.accessioned	2013-11-22T10:51:45Z	-
dc.date.available	2013-11-22T10:51:45Z	-
dc.date.copyright	2012-09	-
dc.date.issued	2013-11-22	-
dc.identifier.uri	http://hdl.handle.net/11718/11391	-
dc.description.abstract	The corridor allocation problem is one of assigning a given set of facilities in two rows along a straight corridor so as to minimize a weighted sum of the distances between every pair of facilities. This problem has practical applications in arrangements of rooms in o ces and in hospitals. The problem is NP-hard. In this paper, we present two population based metaheuristic implementations for the problem; a genetic algorithm with local search embedded in it, and a scatter search algorithm with path relinking. We report the results of our experiments with these algorithms on benchmark instances with up to 49 facilities.	en_US
dc.language.iso	en	en_US
dc.relation.ispartofseries	;W.P. No. 2012-09-02	-
dc.subject	Facility planning and design	en_US
dc.subject	corridor allocation	en_US
dc.subject	double row layout	en_US
dc.subject	Genetic algorithm	en_US
dc.subject	Scatter search	en_US
dc.subject	path relinking	en_US
dc.title	Population Heuristics for the Corridor Allocation Problem	en_US
dc.type	Working Paper	en_US
Appears in Collections:	Working Papers

Files in This Item:

File	Description	Size	Format
2012-09-02.pdf	Population Heuristics for the Corridor Allocation Problem	403.56 kB	Adobe PDF	View/Open