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

基于遗传/自适应神经网络混合算法求解作业车间调度问题
引用本文:庄艺锋.基于遗传/自适应神经网络混合算法求解作业车间调度问题[J].漳州师院学报,2008(3):36-38.
作者姓名:庄艺锋
作者单位:[1]漳州职业技术学院机械工程系,福建漳州363000
摘    要:本文针对一类加工时间可变的调度问题,用遗传算法和基于约束满足的自适应神经网络混合算法进行了研究.遗传算法迭代生成的染色体对应非可行解,由自适应神经网络运算后得到可行解,对应的染色体作为新一代染色体.本算例的目标函数是基于任务的提前/拖期惩罚、附加惩罚以及加工时间的偏离量惩罚,目标是确定最优加工时间和最优加工顺序极小化目标函数,并与一般的遗传算法相比较,最后结果证明了本文算法的有效性.

关 键 词:遗传算法  自适应神经网络  混合算法  生产调度

Hybrid Method Based on Genetic Algorithm and Adaptive Neural Network for Job-shop Scheduling Problems with Variable Processing Times
ZHUANG Yi-feng.Hybrid Method Based on Genetic Algorithm and Adaptive Neural Network for Job-shop Scheduling Problems with Variable Processing Times[J].Journal of ZhangZhou Teachers College(Philosophy & Social Sciences),2008(3):36-38.
Authors:ZHUANG Yi-feng
Institution:ZHUANG Yi-feng (Department of Mechanical Engineering, Zhangzhou Institute of Technology, Zhangzhou, Fujian 363000, China)
Abstract:A new algorithm which effectively combines genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) was proposed to solve job-shop scheduling problems which the jobs have variable processing times. In the hybrid method GA is used to iterate for searching optimal solutions, CSANN is used to solve feasible solutions during the iteration of GA. The total objective function is based on earliness/tardiness penalties, additional penalties and the deviation of processing times penalties. The objective is to find the optimal common due-date, the opt imal sequence and optimal processing times to minimize the objective function. Computer simulations have shown the good performance of the proposed hybrid method.
Keywords:genetic algorithm  adaptive neural network  variable processing times  scheduling
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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