| Article ID: | iaor19981358 |
| Country: | Netherlands |
| Volume: | 7 |
| Issue: | 1 |
| Start Page Number: | 111 |
| End Page Number: | 126 |
| Publication Date: | Jan 1997 |
| Journal: | Computational Optimization and Applications |
| Authors: | Pardalos Panos M., Mavridou Thelma D. |
| Keywords: | heuristics |
The facility layout problem (FLP) has many practical applications and is known to be NP-hard. During recent decades exact and heuristic approaches have been proposed in the literature to solve FLPs. In this paper we review the most recent developments regarding simulated annealing and genetic algorithms for solving facility layout problems approximately.