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

運用類免疫系統之演算法求解脊椎式設施規劃問題

Applying the Artificial Immune Systems Algorithms to Solve the Facility Planning Problem of Spine

指導教授 : 林文祥
共同指導教授 : 陳榮昌(Rong-Chang Chen)

摘要


設施佈置 (Facility Layout)是指在生產規劃的過程中,將各種設備做最有效的組合,使生產流程可以穩定且有效的進行。因此,如何求得一個良好的設施佈置模式便顯得格外重要。而設施的佈置模式以運輸系統作為考量可分為四種,分別為單一排列佈置、多排列佈置、迴圈佈置及開放式欄位佈置,其中較為常見且受到許多學者探討的是單一排列佈置問題。本研究針對單一排列佈置問題下的脊椎式佈置 (Spine Layout)進行探討,目的是為了尋找一個搬運成本最低的佈置模式。 本研究運用類免疫系統 (Artificial Immune Systems, AIS)為基礎的演算法並結合空間填滿曲線 (Space-Filling Curve, SFC)的優點來進行工作站的配置,並使用實驗計劃法 (Design of Experiments, DOE)對測試問題進行參數實驗後,針對兩種脊椎式設施佈置問題進行測試。每個測試問題具有單向順時針及雙向兩種不同的物料搬運方向來探討其搬運成本的差異。最後將本研究與窮舉法及基因演算法 (Genetic Algorithms, GA)所得之結果做一比較與分析,發現本研究所運用之演算法都能求得與窮舉法相同的結果,且雖在運算速度上略遜於基因演算法,但在執行結果及運算時間的穩定性上都更具有效率。

並列摘要


Facility layout can be effective combination equipment in production planning process, make stable and efficient production process can be carried out. Therefore, how to obtain a good facility layout mode will be important issue. Facility layout mode is based on the transportation system, it can be divided into four categories, single layout, multi layout, loop layout and open field layout. Single layout problem is often explored by many scholars. In this study used a spine layout problem under the single layout. The purpose of this study is to find a layout mode of the lowest transportation cost. In this study used algorithm of the Artificial Immune Systems (AIS) combined with the advantages of Space-Filling Curve (SFC), and use Design of Experiments (DOE) to test problems applied with spine layout problem. A test problem with one-way and two-way two different clockwise directions was investigated differences of the material handling cost. Finally, results of the research be compared with to analysis exhaustive method and Genetic Algorithm (GA), research found that the algorithm of this study could obtain the same result with the exhaustive method, the computing speed genetic algorithm lower than result of this study. However, the implementation and the stability of computing time more efficiently.

參考文獻


Lian, K., Zhang, C., Shao, X., & Gao, L. (2011). Single row facility layout problem using an imperialist competitive algorithm. Proceedings of the 41st International Conference on Computers and Industrial Engineering.
彭國銘(民90)。晶圓製造廠設施規劃改善之研究(碩士論文)。取自台灣博碩士論文系統。(系統編號400.2 037M 90-21)
Anjos, M. F., & Vannelli, A. (2008). Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. INFORMS Journal on Computing, 20(4), 611-617. doi:10.1287/ijoc.1080.0270
Al-Enezi, J. R., Abbod, M. F., & Alsharhan, S. (2010). Artificial imuune systems–models, algorithms and applications. International Journal of Research and Reviews in Applied Sciences, 3(2), 118-131.
Azadivar, F., & Wang, J. (2000). Facility layout optimization using simulation and genetic algorithm. International Journal of Production Research, 38(17), 4369-4383. doi:10.1080/00207540050205154

延伸閱讀