平面切割路徑規(guī)劃與優(yōu)化研究
發(fā)布時間：2018-09-05 10:03
【摘要】：平面切割在制造業(yè)的材料加工中占有很大的比重,隨著人口紅利的消退、制造業(yè)生產(chǎn)成本在逐年上升,倒逼一些傳統(tǒng)制造業(yè)考慮將其落后的生產(chǎn)工藝往智能化生產(chǎn)方向改造。作為板材加工中涉及的平面切割環(huán)節(jié),如何自主地對已經(jīng)確定的切割部件規(guī)劃出一條更短的切割路徑,從而降低生產(chǎn)加工時間,減少設備損耗,提升切割加工質(zhì)量等問題,此即平面切割路徑規(guī)劃與優(yōu)化問題,已然成了工業(yè)界以及學術(shù)界研究的熱點。本論文在總結(jié)前人工作的基礎(chǔ)上,根據(jù)平面切割圖文件的特點,提出了平面切割圖切割路徑規(guī)劃與優(yōu)化的一些改進算法和方案。本文的工作主要由以下幾部分組成:1)在平面切割圖數(shù)據(jù)初始化處理方面:基于DXF文件的特殊格式,提出了平面切割圖讀取與存儲的接口函數(shù)與數(shù)據(jù)結(jié)構(gòu);基于存儲的基本圖元數(shù)據(jù),提出了封閉環(huán)的識別與存儲算法;并提出一種適用于單批次多切割圖紙的自動切割路徑規(guī)劃算法框架。2)在平面切割路徑規(guī)劃與優(yōu)化方面:基于切割部件的幾何特征,構(gòu)建了切割路徑的數(shù)學模型;然后提出將此種平面切割路徑轉(zhuǎn)化為動態(tài)旅行商問題模型;提出采用禁忌貪婪算法對切割路徑空行程進行優(yōu)化,并研究了貪婪準則權(quán)重系數(shù)對空行程優(yōu)化的影響;并利用禁忌貪婪算法分別在不同模型下對同一組平面切割圖的切割路徑求解。3)在包含多重嵌套封閉環(huán)的平面切割路徑建模與優(yōu)化方面:提出了封閉環(huán)嵌套識別算法;構(gòu)建四向鏈表對包含多重嵌套封閉環(huán)的平面切割圖進行建模;最后提出采用逐層多次調(diào)用禁忌貪婪算法(n-GR-DTSP)對此種平面切割路徑進行求解,并給出仿真案例進行分析說明。4)在某些平面切割中出于對切割部件的保護,而提出的需要添加切割引導線方面:提出了板材語義信息判斷算法;提出了切割引導線自動添加、干涉判斷、自動調(diào)整算法。
[Abstract]:Plane cutting occupies a large proportion in the material processing of manufacturing industry. With the decline of population dividend, the production cost of manufacturing industry is rising year by year, forcing some traditional manufacturing industries to consider transforming their backward production technology to the direction of intelligent production. As a plane-cutting link involved in sheet metal processing, how to plan a shorter cutting path for certain cutting parts independently, so as to reduce production processing time, reduce equipment loss, and improve cutting quality, etc. The problem of plane cutting path planning and optimization has become a hot topic in industry and academia. On the basis of summing up the previous work and according to the characteristics of plane cutting graph file, this paper puts forward some improved algorithms and schemes for cutting path planning and optimization of plane cutting graph. The main work of this paper is composed of the following parts: (1) in the aspect of data initialization of plane cutting graph: based on the special format of DXF file, the interface function and data structure of reading and storing plane cutting graph are put forward; Based on the stored basic graph metadata, the recognition and storage algorithm of closed loop is proposed. An algorithm framework of automatic cutting path planning for single batch and multiple cutting drawings is proposed. In the aspect of plane cutting path planning and optimization, a mathematical model of cutting path is built based on the geometric characteristics of cutting parts. Then, this paper puts forward a dynamic traveling salesman problem model, proposes a Tabu greedy algorithm to optimize the path empty travel, and studies the influence of the weight coefficient of greedy criterion on the empty travel optimization. And using Tabu greedy algorithm to solve the cutting path of the same set of plane cutting graph under different models respectively. 3) in the aspect of modeling and optimization of the plane cutting path including multiple nested closed rings, a closed ring nested recognition algorithm is proposed. A four-direction list is constructed to model the planar cutting graph which contains multiple nested closed rings. Finally, a layer by layer multiple invocations Tabu greedy algorithm (n-GR-DTSP) is proposed to solve the planar cutting path. A simulation case is given to illustrate how to protect the cutting parts in some plane cutting, but the need to add the cutting guide line is put forward: the algorithm for judging the semantic information of the plate, the automatic adding of the cutting guide line are put forward. Interference judgment, automatic adjustment algorithm.
【學位授予單位】：廣東工業(yè)大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TG48
本文編號：2223948
[Abstract]:Plane cutting occupies a large proportion in the material processing of manufacturing industry. With the decline of population dividend, the production cost of manufacturing industry is rising year by year, forcing some traditional manufacturing industries to consider transforming their backward production technology to the direction of intelligent production. As a plane-cutting link involved in sheet metal processing, how to plan a shorter cutting path for certain cutting parts independently, so as to reduce production processing time, reduce equipment loss, and improve cutting quality, etc. The problem of plane cutting path planning and optimization has become a hot topic in industry and academia. On the basis of summing up the previous work and according to the characteristics of plane cutting graph file, this paper puts forward some improved algorithms and schemes for cutting path planning and optimization of plane cutting graph. The main work of this paper is composed of the following parts: (1) in the aspect of data initialization of plane cutting graph: based on the special format of DXF file, the interface function and data structure of reading and storing plane cutting graph are put forward; Based on the stored basic graph metadata, the recognition and storage algorithm of closed loop is proposed. An algorithm framework of automatic cutting path planning for single batch and multiple cutting drawings is proposed. In the aspect of plane cutting path planning and optimization, a mathematical model of cutting path is built based on the geometric characteristics of cutting parts. Then, this paper puts forward a dynamic traveling salesman problem model, proposes a Tabu greedy algorithm to optimize the path empty travel, and studies the influence of the weight coefficient of greedy criterion on the empty travel optimization. And using Tabu greedy algorithm to solve the cutting path of the same set of plane cutting graph under different models respectively. 3) in the aspect of modeling and optimization of the plane cutting path including multiple nested closed rings, a closed ring nested recognition algorithm is proposed. A four-direction list is constructed to model the planar cutting graph which contains multiple nested closed rings. Finally, a layer by layer multiple invocations Tabu greedy algorithm (n-GR-DTSP) is proposed to solve the planar cutting path. A simulation case is given to illustrate how to protect the cutting parts in some plane cutting, but the need to add the cutting guide line is put forward: the algorithm for judging the semantic information of the plate, the automatic adding of the cutting guide line are put forward. Interference judgment, automatic adjustment algorithm.
【學位授予單位】：廣東工業(yè)大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TG48
【參考文獻】
相關(guān)期刊論文 前10條
1 劉山和;錢曉明;樓佩煌;武星;;基于遺傳蟻群混合算法的激光切割機路徑優(yōu)化[J];機械制造與自動化;2016年06期
2 湯德佑;周子琳;;基于臨界多邊形的不規(guī)則件啟發(fā)式排樣算法[J];計算機應用;2016年09期
3 陳艷平;李紅;儲正陽;;基于歐拉回路的數(shù)控火焰切割路徑優(yōu)化研究與實現(xiàn)[J];制造業(yè)自動化;2015年06期
4 史偉民;方俊;楊亮亮;;基于模擬退火蟻群混合算法的裁床樣片切割路徑優(yōu)化[J];浙江理工大學學報;2015年03期
5 徐晟逸;蘇平;鄧暉飛;;分步求解切割路徑的優(yōu)化算法研究[J];機電工程技術(shù);2014年09期
6 于瑩瑩;陳燕;李桃迎;;改進的遺傳算法求解旅行商問題[J];控制與決策;2014年08期
7 蔣麒麟;王宗榮;李翔英;;基于蟻群算法的鈑金件數(shù)控切割路徑規(guī)劃[J];制造業(yè)自動化;2014年04期
8 侯媛彬;高陽東;鄭茂全;;基于貪心-遺傳算法的混合軌跡加工走刀空行程路徑優(yōu)化[J];機械工程學報;2013年21期
9 饒衛(wèi)振;金淳;;基于求解TSP問題的改進貪婪算法[J];運籌與管理;2012年06期
10 楊建軍;劉保業(yè);鞠錄巖;;激光切割路徑優(yōu)化的雙重編碼改進遺傳算法[J];解放軍理工大學學報(自然科學版);2012年06期
，本文編號：2223948
本文鏈接：http://sikaile.net/kejilunwen/jiagonggongyi/2223948.html
最近更新
教材專著
