首页 | 本学科首页   官方微博 | 高级检索  
     

多阶段多产品调度问题的链式智能体遗传算法
引用本文:吴亚丽,张万良,张立香. 多阶段多产品调度问题的链式智能体遗传算法[J]. 控制理论与应用, 2011, 28(2): 215-222
作者姓名:吴亚丽  张万良  张立香
作者单位:西安理工大学,自动化与信息工程学院,陕西,西安,710048
基金项目:陕西省自然科学基金资助项目(2010JQ8006); 陕西省教育厅科学研究计划资助项目(2010JK711).
摘    要:将遗传算法的编码方式与智能体系统的演化结构相结合,提出一种求解多阶段多产品调度问题的链式智能体遗传算法.算法采用基于订单序列的编码方式,采用一种新的后向指派规则实现编码和可行调度间的一一对应.通过各智能体与其邻域环境的竞争与合作以及自身的自学习操作实现种群的演化过程.对多阶段多产品调度问题的仿真结果表明:链式智能体遗传...

关 键 词:多阶段多产品调度问题  启发式规则  遗传算法  智能体系统
收稿时间:2009-07-03
修稿时间:2010-02-25

Chain-like agent genetic algorithm for multi-stage multi-product scheduling problem
WU Ya-li,ZHANG Wan-liang and ZHANG Li-xiang. Chain-like agent genetic algorithm for multi-stage multi-product scheduling problem[J]. Control Theory & Applications, 2011, 28(2): 215-222
Authors:WU Ya-li  ZHANG Wan-liang  ZHANG Li-xiang
Affiliation:(Automation and Information Engineering School,Xi’an University of Technology,Xi’an Shaanxi 710048,China)
Abstract:Combined the coding characteristic of the genetic algorithm with the evolution structure in the multi-agent system, a chain-like agent genetic algorithm is proposed to solve the multi-stage multi-product scheduling problem. The order-sequences-based encoding means is adopted, and the one-to-one correspondence between the encoding and feasible scheduling is achieved by new post-assignment rules. The population evolution is implemented by the operators of agent such as competition and cooperation with the dynamic neighboring environment and self-learning operator with its own knowledge. The simulation results of multi-stage multi-product scheduling problem show that the combination of chainlike agent genetic algorithm with the new heuristic rule not only increases the diversity of the population but also improves the convergent performance. It is effective in solving the multi-stage multi-product scheduling problem.
Keywords:multi-stage multi-product scheduling problem   heuristic rule   genetic algorithm   agent system
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《控制理论与应用》浏览原始摘要信息
点击此处可从《控制理论与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号