摘要
针对加工操作排序是一个动态的、多约束的组合优化的过程,提出了基于遗传算法的加工操排序方法。以最小变化机床、装夹和刀具次数为目标,构建操作排序优化模型。根据加工规则建立工艺约束关系,生成操作优先关系矩阵,验证并调整加工操作确保排序有效。采用双层编码遗传算法将加工资源与操作相关联,分析操作优先关系矩阵划分加工阶段,减少无效解的求解空间。应用遗传算子选择、交叉和变异,并对算法进行了改进,采用进化逆转操作提高局部搜索能力,加快收敛速度。最后通过实例验证该算法的有效性和实用性。
Aiming at processing operation sequencing is a dynamic combinatorial optimization problem with multi-constraints, a method based on genetic algorithm is presented. An operation sequence optimization model is built by taking the minimum number of changes machines, setups and cutting tools as the objective. Operation precedence relation matrix is generated according to the rules of process constraint and the process operations are verified and adjusted by using the matrix to ensure the process route is feasible. Hier-archic genetic algorithm was adapted to associate operation with processing resources, dividing the processing stages by analyzing operation precedence relation matrix to reduce invalid solutions. Genetic operators of crossover and mutation are applied and the algorithm was improved by using reverse evolution operator to enhance the local searching ability and accelerated the convergence speed. Finally, an example is given to testify the effectiveness and practicability of this algorithm.
出处
《组合机床与自动化加工技术》
北大核心
2016年第11期126-129,133,共5页
Modular Machine Tool & Automatic Manufacturing Technique
基金
河北省自然科学基金项目(E2010000052)
关键词
CAPP
操作排序
遗传算法
操作优先关系矩阵
工艺路线优化
CAPP
operation sequencing
genetic algorithm
operation precedence relation matrix
process route optimization
