Dunker, T.T.DunkerRadons, G.G.RadonsWestkämper, E.E.Westkämper2022-03-032022-03-032005https://publica.fraunhofer.de/handle/publica/20852110.1016/j.ejor.2003.01.0022-s2.0-12344302133This 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 ot the layouts.enGenetischer Algorithmusgenetic algorithmLayout-KonzeptionAlgorithmusDynamische ProgrammierungLayout670300journal article