Optimization of process plans using a constraint-based tabu search approach
Optimization of process plans using a constraint-based tabu search approach
复制标题
DOI：
10.1080/00207540310001652897
复制
发表时间：
2004-05-15
影响因子：
9.2
通讯作者：
Nee, AYC
中科院分区：
文献类型：
--
作者：
Li, WD;Ong, SK;Nee, AYC
理想情况下，计算机辅助工艺设计系统应该生成和优化工艺计划，以确保良好的制造实践的应用，并在生产过程中保持零件所需的功能规格的一致性。应同时考虑关键过程，如选择加工资源、确定装配计划和零件的排序操作，以实现全局最优解。本文将这些过程综合起来，建模为基于约束的优化问题，并提出了一种基于禁忌搜索的方法来有效地解决该问题。在优化模型中，使用的机床和刀具的成本、机床更换、刀具更换、安装和偏离良好的制造实践(惩罚函数)是优化的评价标准。根据优先约束对规划可行性和加工质量的影响，定义了零件中特征及其相关操作之间的几何和制造交互的优先约束，并对其进行了分类。提出了一种混合约束处理方法，并将其嵌入到优化算法中，以在大规模约束空间中高效地进行搜索。通过算例比较了该方法与遗传算法和模拟退火法以及约束处理方法和其他约束方法的优劣，突出了该方法在解质量和算法计算效率方面的性能。
A computer-aided process planning system should ideally generate and optimize process plans to ensure the application of good manufacturing practices and maintain the consistency of the desired functional specifications of a part during its production processes. Crucial processes, such as selecting machining resources, determining set-up plans and sequencing operations of a part should be considered simultaneously to achieve global optimal solutions. In this paper, these processes are integrated and modelled as a constraint-based optimization problem, and a tabu search-based approach is proposed to solve it effectively. In the optimization model, costs of the utilized machines and cutting tools, machine changes, tool changes, set-ups and departure from good manufacturing practices (penalty function) are the optimization evaluation criteria. Precedence constraints from the geometric and manufacturing interactions between features and their related operations in a part are defined and classified according to their effects on the plan feasibility and processing quality. A hybrid constraint-handling method is developed and embedded in the optimization algorithm to conduct the search efficiently in a large-size constraint-based space. Case studies, which are used for comparing this approach with the genetic algorithm and simulated annealing approaches, and the proposed constraint-handling method and other constraint methods, are discussed to highlight the performance of this approach in terms of the solution quality and computational efficiency of the algorithm.