基于竞选算法的生产调度问题的研究  

Researchs on Job Scheduling Problems by Election-survey Algorithm

作　　者：吕文阁[1] 刘志勇[1] 成思源[1] 骆少明[1] 张湘伟[1] 

机构地区：[1]广东工业大学机电工程学院,广东广州510090

出　　处：《机床与液压》2009年第10期33-36,66,共5页Machine Tool & Hydraulics

基　　金：教育部高等学校博士学科专项科研基金项目(20050562003);广东省自然科学基金项目(07001748)

摘　　要：选取优化问题中热点和难点问题——车间调度问题作为竞选算法的应用研究对象,探讨竞选算法的有效性和实现技术。通过对车间调度问题的特点进行分析,设计了一种实现车间调度的竞选算法;引入解的表达方法,并建立了相应的解译规则,可以有效地避免非法解的产生;对获得适应度函数的方法进行了探讨。经对MT06调度问题的实验证明,将竞选算法应用于车间生产调度问题的方法是可行的。Election-survey algorithm was applied in the optimization of job shop scheduling problems, the effectiveness and related characteristics for election-survey algorithm to solve job shop scheduling were discussed. Based on the analysis to job scheduling problems, a election-survey algorithm was presented to achieve job shop scheduling. A new method to express solution was used, and corresponding decoding rules were established to prevent illegal results. The method to obtain fitness function was discussed. Experiment on scheduling problem of MT06 was carried out, result shows that it is reasonable and effective for applying election-survey algorithm in the optimization of job shop scheduling problems.

关 键 词：竞选算法 生产调度 

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