摘要
针对有限缓冲区流水线调度问题,提出了一种多搜索模式遗传算法,算法使用多个交叉和变异操作进行解空间的探索和改良,并采用基于有向图的邻域结构来增强局部搜索。同时,局部搜索和变异操作受决策概率控制。基于典型算例的仿真和比较研究验证了所提算法的有效性。
A genetic algorithm with multiple search modes was proposed for flow-shop scheduling with limited buffers. Multiple crossover operators and mutation operators were utilized in the algorithm for evolutionary exploration and exploitation among the solution space, and a directed graph model based neighborhood structure was also applied to improve the local search. Moreover, the local search and mutation were controlled by decision probability. Simulation results and comparisons based on benchmarks demonstrated the effectiveness of the proposed algorithm.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2005年第7期1041-1046,共6页
Computer Integrated Manufacturing Systems
基金
国家自然科学基金资助项目(60204008
60374060)
国家973计划资助项目(2002CB312200)。~~
关键词
遗传算法
流水线调度
有限缓冲区
<Keyword>genetic algorithm
flow-shop scheduling
limited buffers
