透過您的圖書館登入
IP:3.147.73.35
  • 學位論文

運用啟發式演算法求解多樓層倉儲系統之多目標最佳化問題

Solving Multi-Objectives Optimization of Multi Floor Facility Layout by using Metaheuristic Algorithm

指導教授 : 郭財吉

摘要


倉儲設施規劃問題是倉庫營運的重要關鍵,通常倉儲設施規劃設計時會嘗試最佳化不同的目標例如貨架的方向、當有相互衝突時的空間分配、設施的整體配置等,這也是一個二次分配問題(Quadratic Assignment Problem;QAP),在本研究中,分兩階段解決多樓層倉儲設施佈局問題,第一階段是同時滿足兩個目標,第一個為最小化各部門之間的總物料搬運成本和最大化緊密程度評比值,由於提出的二次分配問題數學模型已被證實為一NP-hard,因此本研究使用一混合式啟發式演算法來求解最佳設施佈置;第二階段是透過關鍵指標法盡量減少倉儲人員在搬運物料時的風險,並以國內一消費性電子產品公司為例。

並列摘要


The warehouse layout problem is a key to warehouse operations. Generally, warehouse layout design models attempt to optimize different objectives such as the orientation of storage racks, the allocation of space among competing uses, the overall configuration of the facility, etc. It is also called Quadratic Assignment Problem. In this study, a multi floor facility layout problem is solved by two stages. The first stage is to simultaneously minimize the total material handling cost among all the departments and the total occupied room area. Since proposed mathematical model was shown to be NP-hard, a hybrid heuristic was developed for determining the optimal layout. The second stage is to minimize the labor’s risk by key indicators method. The result is illustrated by e electronic company.

參考文獻


黃祥熙、黃昱偉、張啟豪 (2009)。多樓層設施佈置之研究,屏東科技大學工業管理研究所。
Abido, M. A., & Abdel-Magid, Y. L. (1999). Hybridizing rule-based power system stabilizers with genetic algorithms. IEEE Transactions on Power Systems, 14(2), 600-607. doi:10.1109/59.761886
Aiello, G., Enea, M., & Galante, G. (2006). A multi-objective approach to facility layout problem by genetic search algorithm and Electre method. Robotics and Computer-Integrated Manufacturing, 22(5), 447-455. doi:http://dx.doi.org/10.1016/j.rcim.2005.11.002
Ahmadi, A., Pishvaee, M. S., & Akbari Jokar, M. R. (2017). A survey on multi-floor facility layout problems. Computers & Industrial Engineering, 107, 158-170. doi:http://dx.doi.org/10.1016/j.cie.2017.03.01
Amberg, A., Domschke, W., & Voß, S. (2000). Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees. European Journal of Operational Research, 124(2), 360-376. doi:http://dx.doi.org/10.1016/S0377-2217(99)00170-8

延伸閱讀