A Two-Phase Extended Great Deluge Algorithm for the Dynamic Layout Problem

摘要

The dynamic layout problem (DLP) deals with the arrangement of manufacturing facilities over time in order to minimize the sum of the material handling and rearrangement costs. This paper presents an efficient algorithm based on the extended great deluge (EGD) to solve this problem. The proposed approach improves the initial EGD algorithm and adapts it to solve the DLP. This approach consists of two phases. The first phase tries to find a very good initial solution, while the second phase improves this solution. Numerical results for 48 test problems from previous research are reported and compared. The solutions found by our approach are very competitive and a great set of the obtained results are better than or are in par with the well-known best solutions.