A Competitive Genetic Algorithm for Single Row Facility Layout

Ravi Kothari and Diptesh Ghosh ()

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

Abstract: The single row facility layout is the NP-Hard problem of arranging facilities with given lengths on a line, so as to minimize the weighted sum of the distances between all pairs of facilities. Owing to the computational complexity of the problem, researchers have developed several heuristics to obtain good quality solutions. In this paper, we present a genetic algorithm to solve large SRFLP instances. Our computational experiments show that an appropriate selection of genetic operators can yield high quality solutions in spite of starting with an initial population that is largely randomly generated. Our algorithm improves the previously best known solutions for several benchmark instances and is competitive for the remaining ones.

Date: 2012-03-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/11085928692012-03-01.pdf English Version (application/pdf)

Related works:
Working Paper: A Competitive Genetic Algorithm for Single Row Facility Layout (2012)
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:11433

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