Scatter Search Algorithms for the Single Row Facility Layout Problem

Ravi Kothari and Diptesh Ghosh ()

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

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.

Date: 2012-04-02
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/4478615922012-04-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:11434

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 ().