Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem

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.

[1]  Chun Hung Cheng,et al.  An improved pair-wise exchange heuristic for the dynamic plant layout problem , 2000 .

[2]  Uday Venkatadri,et al.  Strategic interpolative design of dynamic manufacturing systems layouts , 1991 .

[3]  Taho Yang,et al.  Flexible machine layout design for dynamic and uncertain production environments , 1998, Eur. J. Oper. Res..

[4]  Chun Hung Cheng,et al.  Genetic search and the dynamic layout problem , 2000, Comput. Oper. Res..

[5]  Sunderesh S. Heragu,et al.  Facility layout design in a changing environment , 1999 .

[6]  David W. Coit,et al.  Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems , 1996, INFORMS J. Comput..

[7]  Meir J. Rosenblatt,et al.  The dynamics of plant layout , 1986 .

[8]  Timothy L. Urban.  Solution procedures for the dynamic facility layout problem , 1998, Ann. Oper. Res..

[9]  Adil Baykasoglu,et al.  A simulated annealing algorithm for dynamic layout problem , 2001, Comput. Oper. Res..

[10]  Engelbert Westkämper,et al.  A coevolutionary algorithm for a facility layout problem , 2003 .

[11]  M. Venkataramanan,et al.  SOLUTIONS FOR THE CONSTRAINED DYNAMIC FACILITY LAYOUT PROBLEM , 1992 .

[12]  Marc Goetschalckx,et al.  An interactive layout heuristic based on hexagonal adjacency graphs , 1992 .

[13]  T. A. Lacksonen.  Preprocessing for static and dynamic facility layout problems , 1997 .

[14]  Munirpallam A. Venkataramanan,et al.  Genetic search and the dynamic facility layout problem , 1994, Comput. Oper. Res..

[15]  I. Murthy,et al.  A parametric approach to solving bicriterion shortest path problems , 1991 .

[16]  Joseph B. Mazzola,et al.  A Tabu-Search Heuristic for the Dynamic Plant Layout Problem , 1997, INFORMS J. Comput..

[17]  Chun Hung Cheng,et al.  Dynamic layout algorithms: a state-of-the-art survey , 1998 .

[18]  B. Montreuil,et al.  Dynamic layout design given a scenario tree of probable futures , 1992 .