具有工件约束的模具制造优化调度算法研究  

Research on optimal scheduling algorithm in mold manufacturing with work-piece constraints

作　　者：王延斌[1] 高国安[1] 赵立忠[1] 

机构地区：[1]哈尔滨工业大学现代生产技术中心,黑龙江哈尔滨150001

出　　处：《计算机集成制造系统》2005年第10期1419-1424,1443,共7页Computer Integrated Manufacturing Systems

基　　金：国防科学技术工业委员会"十五"重点资助项目~~

摘　　要：为解决具有工件约束的模具制造优化调度问题,提出了一种利用蚁群算法和优先分配启发式调度算法相结合的调度算法。该算法能够方便地描述问题的约束条件的特点。首先,由蚁群算法确定模具零件各工序所用的加工机床,用节点模式下的有向图描述问题的解空间,用蚂蚁种子信息素踪迹更新策略对信息素进行更新,以获得问题的解;然后,利用优先分配启发式调度算法确定在同一台机床上加工的各零件的先后顺序。实验结果验证了算法的有效性。To solve the problem of optimal scheduling of mold manufacturing with work-piece constraints, a scheduling algorithm combing the ant colony algorithm and the preferential assignment heuristic scheduling algorithm was put forward. The constraint conditions of the problem could be easily described by this algorithm. First, the processing machine tools used in each procedures of mold parts were determined by using the ant colony algorithm A problem＇s solution space was described by directed-graph in node mode, and the pheromone was updated by the ant seeds pheromone track updating strategy to obtain solutions to the problems. Then, the order of parts to be processed on the same machine tool was determined by the preferential assignment heuristic scheduling algorithm. The experiment results demonstrated the effectiveness of the given algorithm.

关 键 词：工件约束 蚁群算法 优先分配启发式算法 模具制造 优化调度 

分 类 号：TH166[机械工程—机械制造及自动化] TG76[金属学及工艺—刀具与模具]