本文選題：切割路徑優(yōu)化 + 嵌套識別��； 參考：《計算機輔助設(shè)計與圖形學(xué)學(xué)報》2017年11期

【摘要】：為解決在平面圖形切割領(lǐng)域中采用不同的切割順序以及切割起止點導(dǎo)致切割路徑空行程相差甚遠的問題,提出一種包含多重嵌套封閉環(huán)的平面切割路徑優(yōu)化算法.首先提出一種多重嵌套封閉環(huán)識別子算法,并以四向鏈表節(jié)點為基礎(chǔ)構(gòu)建包含多重嵌套封閉環(huán)的平面切割路徑模型;然后考慮各封閉環(huán)的幾何特征以及彼此之間的關(guān)系,將切割路徑優(yōu)化問題轉(zhuǎn)化為多個關(guān)聯(lián)的動態(tài)旅行商問題組合;最后通過逐層多次調(diào)用禁忌貪婪算法對切割路徑進行優(yōu)化求解,在優(yōu)化中同時考慮封閉環(huán)之間的切割順序及各封閉環(huán)切割起止點的選擇.仿真實驗結(jié)果表明,該算法對包含多重嵌套封閉環(huán)的平面切割路徑建模和優(yōu)化是可行和有效的.
[Abstract]:In order to solve the problem that different cutting sequences and cutting starting and ending points are used in the field of planar graphic cutting, a new algorithm of planar cutting path optimization is proposed, which includes multiple nested closed rings. Firstly, a multi-nested closed loop recognition algorithm is proposed, and a planar cutting path model with multiple nested closed rings is constructed on the basis of four-direction linked list nodes, and then the geometric characteristics of each closed ring and the relationship between each other are considered. The cutting path optimization problem is transformed into multiple interrelated dynamic traveling salesman problems. Finally, the cutting path is optimized by using Tabu greedy algorithm layer by layer. In the optimization, the cutting sequence between the closed rings and the choice of the starting and ending points of the closed rings are taken into account. The simulation results show that the algorithm is feasible and effective for the modeling and optimization of planar cutting paths with multiple nested closed rings.
【作者單位】： 廣東工業(yè)大學(xué)機電工程學(xué)院;佛山博文機器人自動化科技有限公司;河源鵬翔超高壓水切割機械有限公司;
【基金】：廣東省應(yīng)用型科技研發(fā)專項資金(2015B090922003) 廣東省前沿與關(guān)鍵技術(shù)創(chuàng)新專項資金(2016B090911002) 佛山市科技創(chuàng)新團隊項目(2015IT100072)
【分類號】：TP301.6

【相似文獻】

相關(guān)期刊論文 前8條

1 徐知行,叢文龍,唐可洪;計算機輔助選擇裝配方法[J];吉林大學(xué)學(xué)報(工學(xué)版);2005年06期

2 王世華;楊建梅;;求解社區(qū)項目博弈的一種改進貪婪算法研究[J];數(shù)學(xué)的實踐與認識;2014年05期

3 楊潔;;基于貪婪算法的衛(wèi)星區(qū)域觀測擺角方案選擇方法[J];廣西科學(xué)院學(xué)報;2006年02期

4 申時凱;吳紹兵;申浩如;王付艷;管彥慶;;計算最短公共超串的貪婪算法[J];計算機工程與設(shè)計;2007年08期

5 周柳陽;高珩;梁翥;;貪婪算法的實際應(yīng)用[J];硅谷;2009年02期

6 李e，

本文編號：1996852