本文選題：裝夾規(guī)劃 + 加工特征�。� 參考：《機(jī)械工程學(xué)報(bào)》2017年07期

【摘要】：針對(duì)基于加工特征的計(jì)算機(jī)輔助裝夾規(guī)劃問題,提出一種基于多態(tài)蟻群算法的裝夾規(guī)劃優(yōu)化方法。根據(jù)零件的加工特征,定義了加工操作單元,建立零件的裝夾規(guī)劃模型;接著提出了集成順序優(yōu)先約束的多態(tài)蟻群求解裝夾規(guī)劃的優(yōu)化算法。其中順序優(yōu)先約束是通過對(duì)加工操作單元的劃分,實(shí)現(xiàn)禁忌加工操作單元的動(dòng)態(tài)調(diào)整;多態(tài)蟻群算法將局域搜索與全局搜索進(jìn)行結(jié)合,并根據(jù)狀態(tài)轉(zhuǎn)移概率在可行的加工操作單元中進(jìn)行選擇,完成整個(gè)裝夾路徑的規(guī)劃。最后通過典型零件裝夾規(guī)劃的實(shí)例,驗(yàn)證了提出的多態(tài)蟻群算法在求解裝夾規(guī)劃問題中的可行性和有效性。
[Abstract]:In order to solve the problem of computer-aided clamping planning based on machining features, an optimization method based on polymorphic ant colony algorithm is proposed. According to the machining characteristics of the parts, the machining operation unit is defined, and the clamping planning model of the parts is established, and then the optimization algorithm for solving the clamping planning with polymorphic ant colony which integrates sequential precedence constraints is proposed. Among them, sequential priority constraint is to realize dynamic adjustment of Tabu processing operation unit by dividing processing operation unit, and polymorphic ant colony algorithm combines local search with global search. According to the state transition probability, we select the feasible processing operation unit to complete the planning of the whole clamping path. Finally, the feasibility and effectiveness of the proposed polymorphic ant colony algorithm in solving the clamping planning problem is verified by an example of typical parts clamping planning.
【作者單位】： 嘉興學(xué)院機(jī)電工程學(xué)院;
【基金】：國(guó)家自然科學(xué)科學(xué)基金(61403163) 浙江省自然科學(xué)基金(LY13E050021,LQ14G010008) 浙江省公益性技術(shù)應(yīng)用研究計(jì)劃(2015C31069)資助項(xiàng)目
【分類號(hào)】：TH162;TP18

【相似文獻(xiàn)】

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

1 謝龍漢;;CATIA螺旋加工和清根加工方法[J];CAD/CAM與制造業(yè)信息化;2008年08期

，

本文編號(hào)：2085517