| 王林平,贾振元,王福吉,赵国凯.综合作业调度问题基于可行域的遗传算法[J].,2011,(2):205-209 |
| 综合作业调度问题基于可行域的遗传算法 |
| Solving complete job shop scheduling problem using genetic algorithm in feasible domain |
| |
| DOI：10.7511/dllgxb201102009 |
| 中文关键词: 综合作业调度问题 可行域 遗传算法 装配体分类 可操作基因串 |
| 英文关键词: complete job shop scheduling problem feasible domain genetic algorithm constituent type operable gene string |
| 基金项目:“八六三”国家高技术研究发展计划资助项目(2003AA414022). |
|
| 摘要点击次数: 1599 |
| 全文下载次数: 878 |
| 中文摘要: |
| 综合作业调度问题(CJSSP)同时考虑了加工约束与装配约束,成为约束严调度问题,而现有求解JSSP的遗传算法不能保证约束严问题染色体的可行性．描述了基本CJSSP,在定义的装配体分类和可操作基因串两个关键概念的基础上,设计出了基于可行域的交叉和变异方法．采用改编自JSSP的基准问题和实际调度问题进行了算法测试,并与规则算法的结果进行了比较,表明设计的遗传算法是可行和有效的． |
| 英文摘要: |
| The complete job shop scheduling problem (CJSSP) considers machining and assembly constraints simultaneously and becomes tight-constraint problem. The existing genetic algorithms developed for JSSP can not maintain chromosome′s feasibility of this tight-constrained problem. The basic CJSSP is described. Two key concepts, constituent type and operable gene string, are defined and then applied to building crossover and mutation operation in the feasible domain. The genetic algorithm is tested in both practical instances and problems adapted from JSSP benchmarks. The computation result is compared with that of some heuristics and it is demonstrated that the proposed algorithm is both feasible and efficient. |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |
|
|
|