A simulated annealing algorithm for dynamic layout problem

摘要: Abstract Increased level of volatility in today's manufacturing world demanded new approaches for modelling and solving many its well-known problems like the facility layout problem. Over a decade ago Rosenblatt published key paper on dynamic version problems. Since then, various other researchers proposed improved models algorithms to solve Balakrishnan Cheng have recently comprehensive review literature about this subject. The problem was defined as complex combinatorial optimisation efficiency SA is very well known. However, it has not been applied DLP based available literature. In research SA-based procedure developed results test are reported. Scope purpose One characteristic environments volatility. Under volatile environment (or environment) demand stable. To operate efficiently under such facilities must be adaptive changing conditions. This requires solution (DLP). which optimal solutions can found small size makes use algorithm DLP. Simulated annealing (SA) well-established stochastic neighbourhood search technique. It potential presents detail how apply an extensive computational study. study shows that quite effective