Path Relinking for Single Row Facility Layout

Ravi Kothari and Diptesh Ghosh ()

No WP2012-05-01, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

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 different 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.

Date: 2012-05-01
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/6038336162012-05-01.pdf English Version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:11436

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().