設施佈置問題(Facility Layout Problem)是一典型組合最佳化問題。本研究利用切割樹結構搭配自我適應式和聲搜尋法求解不等面積設施佈置問題。SGHS與和聲搜尋法(Harmony Search Algorithm, HS)最大的差別在於利用學習週期(Learning Mechanisms, LP),讓和聲記憶考量(Harmony Memory Consideration Rate, HMCR)與調音機率(Pitch Adjustment Rate, PAR)經由常態分配(Normal Distribution)方式自我產生。此外,新發展的調音機制是由子樹間的調音與子樹內的調音所組成。 為了評估此方法的有效性,本研究針對具代表性的問題做了一系列的測詴,並與文獻上的求解結果比較,問題如:O7、O8、O9與Ba12。而較大的例子如Du62也曾在合理的時間內求解到答案。
The Facility Layout Problem (FLP) is a typical combinational optimization problem. In this research, a slicing tree and self-adaptive harmony search (SGHS) based heuristic is proposed for solving unequal-area block layout problem. The major difference between SGHS and harmony search (HS) is the harmony memory consideration rate and pitch adjustment rate of SGHS are dynamically adapted by the learning mechanisms. Furthermore, the newly developed pitch adjustment is composed of two schemes, intra-subtrees and inner-subtrees. To evaluate the effectiveness of this approach, a series of computational experiments are performed and testing results are compared to those found in the literature. Datasets of well known problems, O7, O8, O9, and Ba12 are used for demonstration. Additionally, a large problem instance comprised of 62 facilities has been solved in reasonable time.