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/11396| Title: | Path relinking for single row facility layout |
| Authors: | Kothari, Ravi Ghosh, Diptesh |
| Keywords: | Facilities planning and design;Single Row Facility Layout;Tabu Search;Lin- Kernighan neighborhood search;Scatter search, Path relinking |
| Issue Date: | 22-Nov-2013 |
| Series/Report no.: | ;W.P. No. 2012-05-01 |
| Abstract: | The single row facility layout problem is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In this paper we present path relinking algorithms to solve large sized instances of the problem. We use three di erent metaheuristics to generate sets of good quality initial solutions and subject the solutions in these sets to path relinking. We present our computational experience on 43 benchmark instances with up to 110 facilities. |
| URI: | http://hdl.handle.net/11718/11396 |
| Appears in Collections: | Working Papers |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2012-05-01Kothari.pdf | Path relinking for single row facility layout | 334.05 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.