Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9663768 | European Journal of Operational Research | 2005 | 15 Pages |
Abstract
This paper presents an algorithm combining dynamic programming and genetic search for solving a dynamic facility layout problem. While the quadratic assignment formulation of this problem has been deeply investigated there are very few papers solving it for departments of unequal size. We describe a model which can cope with unequal sizes, which may change from one period in time to the next. For each period a genetic algorithm evolves a population of layouts while the dynamic programming provides the evaluation of the fitness of the layouts.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Thomas Dunker, Günter Radons, Engelbert Westkämper,