dc.contributor.author | Kothari, Ravi | |
dc.contributor.author | Ghosh, Diptesh | |
dc.date.accessioned | 2013-11-25T11:45:56Z | |
dc.date.available | 2013-11-25T11:45:56Z | |
dc.date.copyright | 2012-03 | |
dc.date.issued | 2013-11-25 | |
dc.identifier.uri | http://hdl.handle.net/11718/11421 | |
dc.description.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 the 24 instances of 43 benchmark instances and is competitive for the
remaining ones. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | ;W.P. No. 2012-03-01 | |
dc.subject | Facilities planning and design | en_US |
dc.subject | Single Row Facility Layout | en_US |
dc.subject | Genetic algorithm | en_US |
dc.title | A competitive genetic algorithm for single row facility layout | en_US |
dc.type | Working Paper | en_US |