簡易檢索 / 詳目顯示

研究生: 林子翔
Tsu-Hsiang Lin
論文名稱: 應用生物共生演算法2.0於三維裁切最佳化之研究-以保麗龍裁切為例
SOS2.0 Algorithm for Solving Three Dimensional Cutting Problem - A Case Study of Cutting Styrofoam
指導教授: 鄭明淵
Min-Yuan Cheng
口試委員: 楊亦東
I-Tung Yang
吳育偉
Yu-Wei Wu
學位類別: 碩士
Master
系所名稱: 工程學院 - 營建工程系
Department of Civil and Construction Engineering
論文出版年: 2022
畢業學年度: 110
語文別: 中文
論文頁數: 116
中文關鍵詞: 啟發式演算法生物共生演算法2.0三維裁切保麗龍裁切
外文關鍵詞: Heuristic Algorithm, Symbiotic Organism Search 2.0, Three Dimensional Cutting, Styrofoam Cutting
相關次數: 點閱:281下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 現近年來,電腦資訊技術迅速的發展並被廣泛地應用在各個領域中,許多複雜的工程問題可藉由啟發式演算法解決,已裁切為例,一維裁切及二維裁切已有許多成功案例,三維裁切現今並無較多完整研究案例。
    Selin等人在2019提出較可行三維裁切方法,將三維問題劃分成兩個階段,第一階段的二維裁切(2DCSP)問題,以及第二階段一維裁切(1DCSP)問題,本研究以保麗龍裁切維例,將改善Selin等人的方法論,並延發出一套更完善的3D裁切方法論。
    鄭明淵博士以及Richard Gosno等人於2021時年發展出生物共生演算2.0(Symbiotic Organisms Search 2.0 [3],新增了兩個進化的不同特徵,Self Parameter Updating (SPU)以及Chaotic maps sequencing;SPU加強了探索功能;Chaotic maps sequencing則是加強了開發功能,將這兩個特性結合起來發揮更好的平衡探索及開發。SOS2.0相較於SOS,提供了更好的性能以外,也提高了計算效率與搜索最佳解的能力,成為了更好的SOS算法的一種後續方法。
    本研究選用保麗龍裁切維案例,應用SOS2.0進行組合配置計算,研究結果顯示,相較於Selin等人方法以及目前現場以人力經驗計算之下,可得出餘料最少之最佳解。


    Computer information technologies have been growing and applying in many different fields rapidly in recent years, and many complex constructional issues could be resolved by utilizing Heuristic Algorithm; there have been many successful cases in one-dimensional and two-dimensional cutting, however, there have not been many completed third-dimensional cutting in recent research.
    Selin with her team have proposed the possibilities of three-dimensional cutting methods such as splitting it into two phases which are 2D cutting (2DCSP) in the first phase and 1D cutting (1DCSP) in the second phase. Therefore, by using Styrofoam cutting as an example for this research, not only can improve Selin’s study but also develop a set of more completed 3D cutting.
    Dr. Zheng and Richard Gosno have discovered “Symbiotic Organisms Search 2.0” in year of 2021, and they have added two different advanced features such as “Self Parameter Updating (SPU)” and “Chaotic maps sequencing;” The SPU is capable of enhancing exploring features and where Chaotic maps sequencing focuses more on exploiting features, by merging these unique characteristics of both will obtain a better balanced exploration and exploitation. In comparison of SOS 2.0 and SOS, it not only provided greater performance, but also increased computational efficiency and optimal exploration solution, which makes it an effective after-method for SOS algorithm. Therefore, the study will be focused on developing a methodology of advanced 3D cutting based on styrofoam-cutting
    Therefore, the study will be mainly focused on using styrofoam cutting as an example to calculate assembly combination by utilizing SOS 2.0. As a result of the research, it demonstrates the optimal method of saving remaining material under the comparison of Selin’s study and current on-site manpower empirical calculation.

    摘要 B ABSTRACT C 致謝 D 目錄 E 表目錄 H 圖目錄 I 第一章 緒論 4 1.1 研究動機 4 1.2 研究目的 6 1.3 研究範圍與限制 6 1.4 研究方法與流程 7 第二章 文獻回顧 8 2.1啟發式演算法 8 2.2生物共生演算法(Symbiotic Organisms Search) 9 2.2.1生物共生演算法 9 2.2.2生物共生演算法2.0 13 2.3一維裁切問題(1DCSP) 14 2.4二維裁切問題(2DCSP) 15 2.4.1二維裁切基本分類 15 2.4.2二維裁切方法介紹 18 2.5.三維裁切問題(3DCSP) 22 2.5.1三維裁切基本分類 22 2.5.2三維裁切方法介紹 22 2.5.3第一階段垂直切割: 二維裁切問題(2DCSP) 25 2.5.4第二階段水平切割: 一維裁切問題(1DCSP) 27 2.5.5三維裁切結果說明 28 2.6.三維裁切可改善部分 29 第三章 方法及模式建立 30 3. 保麗龍裁切方法流程圖 33 3.1 Sort and classify data in x , y , z direction 35 3.2 Generate 2D cutting pattern with Non-Guillotine Cut 37 3.2.1 保麗龍2DCSP裁切方法流程圖 37 3.2.2 NGC放置策略 38 3.2.3 Difference process(DP) 39 3.2.4 2DCSP(NGC)裁切方法介紹 41 3.2.5 2DCSP(NGC)演算法建立 50 3.2.6 編碼方式 52 3.3 Compare all sides to choose minimum waste 55 3.3.1 排放順序結果( 多片排序 ) 55 3.3.2 2DCSP產出結論: 57 3.4 Generate 1D cutting pattern 58 3.4.1 1DCSP下次適應裝箱法介紹 58 3.4.2 編碼方式 58 3.5 Obtain the best 3D cutting pattern 61 3.6 1D cutting execution 62 3.7 2D cutting execution 64 第四章 案例測試與分析 65 4.1案例一: 本研究流程(4)測試與各流程結果比較 65 4.1.1 案例一資料 66 4.1.2 方法(1) : 3DCSP總餘料計算 67 4.1.3 方法(2) : 3DCSP總餘料計算 69 4.1.4 方法(3) : 3DCSP總餘料計算 72 4.1.5 方法(4) : 3DCSP總餘料計算 75 4.1.6 3DCSP總餘料比較 81 4.2案例二: 保麗龍實際案例測試與結果 82 4.2.1案例二資料 82 4.2.2 方法(1) : 3DCSP總餘料計算 84 4.2.3 方法(2) : 3DCSP總餘料計算 85 4.2.4 方法(3) : 3DCSP總餘料計算 86 4.2.5 方法(4) : 3DCSP總餘料計算 88 4.2.6 3DCSP總餘料比較 97 第五章 結論與建議 99 5.1結論 99 5.2 建議 100 參考文獻 101

    [1] Cheng, M. Y., & Prayogo, D. (2014). Symbiotic organisms search: a new metaheuristic optimization algorithm. Computers & Structures, 139, 98-112.
    [2] Hegazy, T., & Elbeltagi, E. (1999). EvoSite: Evolution-based model for site layout planning. Journal of computing in civil engineering, 13(3), 198-206.
    [3] Cheng, M. Y., & Gosno, R. A. (2021). SOS 2.0: an evolutionary approach for SOS algorithm. Evolutionary Intelligence, 14(4), 1965-1983.
    [4] Cheng, M. Y., Prayogo, D., & Tran, D. H. (2016). Optimizing multiple-resources leveling in multiple projects using discrete symbiotic organisms search. Journal of Computing in Civil Engineering, 30(3), 04015036.
    [5] Cheng, M. Y., & Lien, L. C. (2011). A hybrid swarm intelligence based particle bee algorithm for benchmark functions and construction site layout optimization. Proceedings of the 28th ISARC, Seoul, 898-904.
    [6] Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.
    [7] Kennedy, J., & Eberhart, R. (1995, November). Particle swarm optimization. In Proceedings of ICNN'95-international conference on neural networks (Vol. 4, pp. 1942-1948). IEEE..
    [8] Dorigo, M., Birattari, M., & Stutzle, T. (2006). Ant colony optimization. IEEE computational intelligence magazine, 1(4), 28-39.
    [9] Karaboga, D., & Basturk, B. (2007). A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of global optimization, 39(3), 459-471.
    [10] Prayogo, D., Cheng, M. Y., Wu, Y. W., Redi, A. A. N., Yu, V. F., Persada, S. F., & Nadlifatin, R. (2020). A novel hybrid metaheuristic algorithm for optimization of construction management site layout planning. Algorithms, 13(5), 117.
    [11] 邱雅萍 (2017)。自動調適生物共生演算法在工程上之應用–以鋼筋裁切為例。「國立臺灣科技大學-營建工程系」發表之論文。
    [12] 張乃文 (2018)。建工程專案動態物料配置最佳化模式之研究。「國立臺灣科技大學-營建工程系」發表之論文。
    [13] Dib, N., & El‐Asir, B. (2018). Optimal design of analog active filters using symbiotic organisms search. International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, 31(5), e2323.

    [14] 王俊堯(2018)。應用自動調適生物共生演算法於二維鋼板切割最佳化之研究。「國立臺灣科技大學-營建工程系」發表之論文。
    [15] Do, D. T., Lee, D., & Lee, J. (2019). Material optimization of functionally graded plates using deep neural network and modified symbiotic organisms search for eigenvalue problems. Composites Part B: Engineering, 159, 300-326.
    [16] Bozorg-Haddad, O., Azarnivand, A., Hosseini-Moghari, S. M., & Loáiciga, H. A. (2017). Optimal operation of reservoir systems with the symbiotic organisms search (SOS) algorithm. Journal of Hydroinformatics, 19(4), 507-521.
    [17] 游麗娟(2000)。基因演算法於幾何形狀最佳化設計之研究。「國立中央大學-機械工程研究所」發表之論文。
    [18] 林郁晨(2019)。應用生物共生演算法推估地下水污染物釋放歷史與污染源位置。「國立交通大學-環境工程研究所」發表之論文。
    [19] 蔡志豐(2014)。改良式快速基因演算法。「中央大學-工程與管理之應用」發表之論文。
    [20] Gharehchopogh, F. S., Shayanfar, H., & Gholizadeh, H. (2020). A comprehensive survey on symbiotic organisms search algorithms. Artificial Intelligence Review, 53(3), 2265-2312.
    [21] 張彥文(2017)。即時資料為基礎的作業現場製程規劃與彈性管控系統。「國立交通大學-資訊管理研究所」發表之論文。
    [22] Wäscher, G., Haußner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European journal of operational research, 183(3), 1109-1130.
    [23] Allen, S. D., Burke, E. K., & Kendall, G. (2011). A hybrid placement strategy for the three-dimensional strip packing problem. European Journal of Operational Research, 209(3), 219-227.
    [24] Gonzalez, Y., Miranda, G., & Leon, C. (2016). Multi-objective multi-level filling evolutionary algorithm for the 3D cutting stock problem. Procedia Computer Science, 96, 355-364.
    [25] Altın, S., Aydilek, T., Şirvan, U., Kesikburun, D., Öner, A., & Kutup, N. (2018, August). Three Dimensional Cutting Stock Problem in Mattress Production: A Case Study. In The International Symposium for Production Research (pp. 949-960). Springer, Cham.
    [26] Martello, S., Pisinger, D., Vigo, D., Boef, E. D., & Korst, J. (2007). Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. ACM Transactions on Mathematical Software (TOMS), 33(1), 7-es.
    [27] George, J. A., & Robinson, D. F. (1980). A heuristic for packing boxes into a container. Computers & Operations Research, 7(3), 147-156.
    [28] Brandao, F., & Pedroso, J. P. (2016). Bin packing and related problems: General arc-flow formulation with graph compression. Computers & Operations Research, 69, 56-67.
    [29] De Queiroz, T. A., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2012). Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, 39(2), 200-212.
    [30] Dyckhoff, H. (1981). A new linear programming approach to the cutting stock problem. Operations Research, 29(6), 1092-1104.
    [31] Beasley, J. E. (2004). A population heuristic for constrained two-dimensional non-guillotine cutting. European Journal of Operational Research, 156(3), 601-627.
    [32] Jakobs, S. (1996). On genetic algorithms for the packing of polygons. European journal of operational research, 88(1), 165-181.
    [33] De Carvalho, J. V. (1999). Exact solution of bin‐packing problems using column generation and branch‐and‐bound. Annals of Operations Research, 86, 629-659.
    [34] Martin, M., Oliveira, J. F., Silva, E., Morabito, R., & Munari, P. (2021). Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm. Expert Systems with Applications, 168, 114257..
    [35] Prayogo, D., Gaby, G., Wijaya, B. H., & Wong, F. T. (2020, May). Reliability-based Design with Size and Shape Optimization of Truss Structure Using Symbiotic Organisms Search. In IOP Conference Series: Earth and Environmental Science (Vol. 506, No. 1, p. 012047). IOP Publishing.
    [36] Cheng, M. Y., Fang, Y. C., & Wang, C. Y. (2021). Auto-tuning SOS Algorithm for Two-Dimensional Orthogonal Cutting Optimization. KSCE Journal of Civil Engineering, 1-15.
    [37] Gonçalves, J. F., & Resende, M. G. (2011). A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. Journal of Combinatorial Optimization, 22(2), 180-201.
    [38] 歐淑民(2011)。以改良粒子群演算法求解鋼筋裁切最佳化問題。「朝陽科技大學-營建工程系」發表之論文。

    無法下載圖示 全文公開日期 2025/01/25 (校內網路)
    全文公開日期 2027/01/25 (校外網路)
    全文公開日期 2027/01/25 (國家圖書館:臺灣博碩士論文系統)
    QR CODE