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

遗传算法求解多目标柔性Job-shop问题
引用本文:杨帆,周成平,周代义,严江江.遗传算法求解多目标柔性Job-shop问题[J].微计算机信息,2007,23(33):163-165.
作者姓名:杨帆  周成平  周代义  严江江
作者单位:1. 武汉 华中科技大学图像识别与人工智能研究所图像信息处理与智能控制教育部重点实验室,430074
2. 上海 宝钢集团上海二钢有限公司,200090
摘    要:本文描述了基于可变机器约束的多目标柔性Job-shop调度问题模型,并应用一种改进的遗传算法进行求解。我们采用了表示工序先后顺序及机器选择的二维编码方式,以多目标优化函数为度量,通过三种遗传操作扩展后代的多样性和算法的搜索空间。仿真结果验证了该算法能有效解决多目标优化问题。

关 键 词:遗传算法  多目标柔性job-shop调度  可变机器
文章编号:1008-0570(2007)11-3-0163-03
修稿时间:2007-08-03

Solving Multi-objective Flexible Job-shop Scheduling Problem with Genetic Algorithm
YANG FAN,ZHOU CHENGPING,ZHOU DAIYI,YAN JIANGJIANG.Solving Multi-objective Flexible Job-shop Scheduling Problem with Genetic Algorithm[J].Control & Automation,2007,23(33):163-165.
Authors:YANG FAN  ZHOU CHENGPING  ZHOU DAIYI  YAN JIANGJIANG
Abstract:The model of flexible job shop scheduling problem with alterable machines is described, and an improved GA scheduling approach is used to solve the problem.Two-dimensional encoding method represents the priority dispatching sequence and machines which are selected, multi-objective optimization functions are used as evaluation, and the three genetic operators can enlarge the population and search space. The effectiveness of the proposed algorithm is verified by computation results.
Keywords:genetic algorithm  multi--objective flexible job-shop scheduling  alterable machines
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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