遗传算法和禁忌搜索算法在车间调度中的研究进展  

The Study of Genetic and Tabu Search Algorithm in Job-Shop Scheduling Problem

作　　者：黄明[1] 闫淑娟[1] 梁旭[1] 

机构地区：[1]大连铁道学院电气信息分院,116028

出　　处：《工业控制计算机》2004年第2期4-5,共2页Industrial Control Computer

基　　金：辽宁省基金资助项目(20022114)

摘　　要：遗传算法与禁忌搜索算法的出现为解决高维组合优化问题提供了强有力工具。二者既有共性,又有个性。本文综述了遗传算法和禁忌搜索算法及它们的混合策略在车间调度优化问题中的应用现状。The appearance of genetic algorithms and tabu search provide powerful tools for solving combinatorial optimization problems in multi-dimensions.This article researches the applications of genetic algorithm and tabu search in Job-shop Plan Problems, and emphases on the hybrid strategy of its in Job-shop Plan Problems.

关 键 词：遗传算法 禁忌搜索算法 车间调度 GA 智能搜索算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]