一种混合嵌套分区算法及其在车间调度中的应用(英文)  

Hybrid Nested Partitions Algorithm and Its Application to JSP

作　　者：闫利军[1] 李宗斌[1] 卫军胡[1] 袁小阳[2] 

机构地区：[1]西安交通大学机械制造系统工程国家重点实验室,西安710049 [2]西安交通大学现代设计及转子系统教育部实验室,西安710049

出　　处：《系统仿真学报》2008年第20期5700-5705,共6页Journal of System Simulation

基　　金：the National High-Tech.R & D Program,China (2007AA04Z121)

摘　　要：设计了一种嵌套分区算法框架下的局部搜索算法,即基于最优计算量分配技术的序遗传算法,该算法采用序优化思想保证在有限计算量条件下得到局部最优解,并用遗传算法的进化搜索能力和学习能力对解空间进行搜索。将设计的局部搜索算法与嵌套分区算法相结合提出一种新的混合优化算法,用该混合优化算法求解几个标准的随机车间调度问题,数字仿真的结果表明该混合算法的优化性能好于遗传算法及基于最优计算量分配技术的序优化方法。A class of order optimization （OO） with optimal computing budget allocation （OCBA） based genetic algorithm （GA） was designed to perform local search in the framework of nested partitions method （NP）. The local searching algorithm borrows from the idea of OO to ensure the quality of the design found with a reduction in computation effort and applies the evolutionary searching mechanism and learning capability of GA to effectively perform exploration and exploitation. Proposed hybrid algorithm retains the property of global search and convergence of NP and the powerful local searching capability of OO with OCBA based GA algorithm. The effectiveness of hybrid algorithm was demonstrated by numerical simulation results based on stochastic job-shop scheduling benchmarks and its optimization quality is much better than pure GA and OO with OCBA algorithm.

关 键 词：遗传算法 序优化 最优计算量分配 嵌套分区 随机车间调度 

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