A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf
.
:{unav)
2012
Computational optimization and applications
The facility layout problem (FLP) has many practical applications and is known to be N P-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.
doi:10.1023/a:1008623913524
fatcat:qkdslz4dqzbkvfx3crj4rfjzie