Paper Info
Title
Genetic search and the dynamic facility layout problem
Abstract
This research examines the suitability of genetic algorithms to the problem of facility layout over time. Genetic algorithms use the principles of genetics to evolve an initial population of solutions into a population 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 multi-period facility layout problem and report results for two test problems.
Year
DOI
Venue
1994
10.1016/0305-0548(94)90023-X
Computers & OR
Keywords
DocType
Volume
dynamic facility layout problem,genetic search
Journal
21
Issue
ISSN
Citations 
8
Computers and Operations Research
37
PageRank 
References 
Authors
6.55
0
2
Name
Order
Citations
PageRank
Daniel G. Conway17315.38
M. A. Venkataramanan224520.52