A Competitive Genetic Algorithm for Single Row Facility Layout

Uma Kothari () and Diptesh Ghosh ()

Working Papers from eSocialSciences

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. A genetic algorithm to solve large SRFLP instances is presented. [W.P. No. 2012-03-01]. URL:[http://www.iimahd.ernet.in/assets/snippets/workingpaperpdf/11085928692012-03-01.pdf].

Keywords: Facilities planning and design; Single Row Facility Layout; Genetic algorithm; NP-Hard problem; competitive; population generation method; Random initialization (RND); Flow based permutation (FBP); Worst pair together (WPT); mating pool; Roulette; Partially-matched crossover (PMX); Cycle crossover (CX); Swap Mutation (search for similar items in EconPapers)
Date: 2012-04
Note: Institutional Papers
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.esocialsciences.org/Download/repecDownl ... &AId=4915&fref=repec

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:ess:wpaper:id:4915

Access Statistics for this paper

More papers in Working Papers from eSocialSciences
Bibliographic data for series maintained by Padma Prakash ().