Research on Optimization of Nesting Problem in Shipbuilding

瀏覽統計 Email 通知 RSS Feed

簡歷

基本資料

Project title

Code/計畫編號

MOST106-2221-E019-045

Translated Name/計畫中文名

船廠排版問題最佳化研究

Project Coordinator/計畫主持人

Wei-Chu Weng

Funding Organization/主管機關

National Science and Technology Council

Department/Unit

Department of Systems Engineering and Naval Architecture

Website

https://www.grb.gov.tw/search/planDetail?id=12243674

Year

2017

Start date/計畫起

01-08-2017

Expected Completion/計畫迄

01-07-2018

Bugetid/研究經費

607千元

ResearchField/研究領域

機械工程

"根據申請人多年研究，造船工業所面對的二維不規則形材排版問題，相較其他工業所面對的問題困難許多。在學術界，許多相關研究論文所探討的二維不規則形材排版問題案例，不規則形狀相較母材尺寸小很多，不論應用BLF(bottom-left fill)演算法或NFP(no-fit polygon) 演算法，都能排出令人滿意的結果。然而，根據申請人近三年的研究發現，這兩種常用排版方法面對造船工業的二維不規則排版問題效果都不好。本計畫擬針對造船工業的二維不規則排版問題提出形材排版順序最佳化研究，以改善排版方法的排版效果。不規則形材的排版順序是排版結果好壞最關鍵的參數，最佳化方法的目的就是要找出這些形材那些適合相鄰排版。最佳化排版順序可說是解決困難的二維不規則形材排版問題的最後一哩路，本計畫的重點是提出TWM(the worst moves)策略，協助禁制搜尋法(tabu search)搜尋最佳的排版順序。最佳化計算過程中，使用商用排版軟體作為評估工具，並挑選多個船廠實例進行測試，且和人工排版結果比較。" "According to the applicant researches, the irregular nesting problem in shipbuilding is more difficult than the one in other industries. There are many academic papers concerning irregular nesting problems with the success when handling the irregular shapes much smaller than their material sheets. Both the popular nesting algorithms, BLF(bottom-left fill) or NFP(no-fit polygon), can layout small irregular shapes on a material sheet tightly. However, my researching works of the last three years have shown that none of the two algorithms can satisfyingly handle the nesting problem in shipbuilding. The proposal proposes a TWM (the worst moves, TWM) strategy helps the method of tabu search optimizing the nesting sequence of large irregular shapes. A commercial nesting software is chosen as the evaluation tool, several practical cases are used to test the optimization application and be compared with."

DSpace CRIS

Research on Optimization of Nesting Problem in Shipbuilding

基本資料

Description