IIMA Institutional Repository
This Institutional Repository has been created to collect, preserve and distribute the scholarly output of Indian Institute of Management, Ahmedabad. This will work as an important tool to facilitate scholarly communication and preserve the institution knowledge. The Vikram Sarabhai Library is proud to be hosting the repository for the dissemination and preservation of this valuable knowledge resource of the IIMA community.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/11391| Title: | Population Heuristics for the Corridor Allocation Problem |
| Authors: | Ghosh, Diptesh Kothari, Ravi |
| Keywords: | Facility planning and design;corridor allocation;double row layout;Genetic algorithm;Scatter search;path relinking |
| Issue Date: | 22-Nov-2013 |
| Series/Report no.: | ;W.P. No. 2012-09-02 |
| 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. |
| URI: | http://hdl.handle.net/11718/11391 |
| 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 |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.