GENETIC SEARCH AND THE DYNAMIC FACILITY LAYOUT PROBLEM

Citation
Dg. Conway et Ma. Venkataramanan, GENETIC SEARCH AND THE DYNAMIC FACILITY LAYOUT PROBLEM, Computers & operations research, 21(8), 1994, pp. 955-960
Citations number
7
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Engineering, Industrial
ISSN journal
03050548
Volume
21
Issue
8
Year of publication
1994
Pages
955 - 960
Database
ISI
SICI code
0305-0548(1994)21:8<955:GSATDF>2.0.ZU;2-1
Abstract
This research examines the suitability of genetic algorithms to the pr oblem of facility layout over time. Genetic algorithms use the princip les of genetics to evolve an initial population of solutions into a po pulation of superior solutions. One advantage of this approach is its ability to include multiple constraints as well as non-linear and non- convex objective functions. We present a genetic procedure for the mul ti-period facility layout problem and report results for two test prob lems.