摘要
针对计算机辅助工艺规划中的工艺路线的决策问题,提出了一种基于蚁群算法的工艺路线生成及优化算法。该算法将被加工零件划分为若干特征元,并由各个特征元的加工链得到该零件的加工元;根据加工元的属性,用加权海明距离表示加工元之间的相似度;根据加工元之间的约束条件,确定其优先加工关系并得到各自的前趋加工元;对基本蚁群算法进行改进,在禁忌准则和约束条件的限制下对解空间进行搜索,从而得到优化的零件加工工艺路线。通过实例验证了该算法的可行性和有效性。
Based on the ant colony algorithm, an algorithm was proposed for the process route optimization to solve the decision-making problems of the process route in a Computer Aided Process Planning （CAPP） system. Each part was divided into some feature cells, and the operation cells were generated by machining chains of feature cells. The similarity of every two operation cells was represented by the weighted Hamming distance on the basis of their properties. According to the constraints of the operation cells,the preference sequences of the operation cells were determined, and the fore cells of each operation cell were obtained. A process route was generated and optimized by using the modified ant colony algorithm under the taboo criterion and constraints. Experiments results revealed that this algorithm was feasible and effective.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2010年第7期1378-1382,共5页
Computer Integrated Manufacturing Systems
基金
国家863计划资助项目(2007AA042005)
国家自然科学基金资助项目(50975193)
高等学校博士学科点专项科研基金资助项目(20060056016)~~
关键词
计算机辅助工艺规划
特征元
加工元
工艺路线
优化
蚁群算法
computer aided process planning
feature cell
operation cell
process route
optimization
ant colony algorithm
