基于Wang-Landau算法的动态设施布局方法

动态设施布局问题是设施在车间内多个阶段的布局规划问题。目前，针对动态设施布局问题，国内外学者对离散模型研究较多，而对连续模型的研究却较少。根据连续动态设施布局的特性与需求，构建了不等面积设施的动态设施布局连续模型。求解该模型的难点在于缺乏一种高效的布局优化方法。Wang-Landau算法是一种改进的蒙特卡罗算法。通过将Wang-Landau算法与空位点放置策略、外推移动策略、内压移动策略三种启发式策略相结合，提出一种基于Wang-Landau抽样的启发式算法，并以此求解该模型。使用文献中已有的测试算例对提出的算法进行测试，计算结果表明，所提出的算法在求解连续动态设施布局问题上是有效的。

Wang-Landau algorithm for the dynamic facility layout problem

The dynamic facility layout problem is the problem of placing facilities in a certain plant for multiple stages. Nowadays, most of researches for the dynamic facility layout problem focus on the discrete models. According to its characteristics and requirements, this paper established a continual model for the unequal area dynamic facility layout problem. The greatest challenge in solving the dynamic facility layout problem consists in lacking a high-performance optimization method. The Wang-Landau algorithm is an improved Monte Carlo method. By combining the Wang-Landau algorithm, the vacant point strategy, pushing strategy and pressuring strategy, this paper proposed a heuristic Wang-Landau algorithm. The proposed algorithm has been tested on instances from the literature and the computational results show that the heuristic Wang-Landau algorithm is effective method for solving the dynamic facility layout problem.