柔性机器加工排序问题中的遗传算法

A Genetic Algorithm Approach to the Flexible Machine Process Sequencing Problem

现代制造系统中 ,计算机辅助加工计划 ( CAPP)起着非常重要的作用 ,它是从计算机辅助设计 ( CAD)到计算机辅助制造 ( CAM)不可缺少的中间环节。在允许作业柔性加工的基础上 ,本文提出一种新的两目标机器加工排序问题。由于该加工排序是一个 NP-完全问题 ,进而构造了一个新的遗传算法求解该问题的非劣解解集。数值计算表明 ,该方法对两目标的柔性加工排序问题是有效的。

In the modern manufacturing systems, the computer aided process planning plays a very important role. It is an indispensable linkage between CAD and CAM. In this paper, we propose a new machine process sequencing problem with two objectives considering the operation flexibility. As this problem is NP complete, we develop a genetic algorithm approach to obtain the set of its non inferior solutions. The numerical experiments show the effectiveness of the proposed method in dealing with the flexible process sequencing problem with two objectives.