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

基于浮点型编码策略的差分多目标柔性车间调度优化
引用本文:蔡 霞,李枚毅,王 康,肖 建.基于浮点型编码策略的差分多目标柔性车间调度优化[J].计算机应用研究,2013,30(4):999-1003.
作者姓名:蔡 霞  李枚毅  王 康  肖 建
作者单位:湘潭大学 信息工程学院, 湖南 湘潭 411105
基金项目:国家自然科学基金资助项目(61272295, 61070088)
摘    要:运用进化算法求解柔性车间调度问题时,编码的特殊性对进化策略造成的局限制约了算法的搜索能力。为此,提出一种基于浮点型编码策略的差分多目标优化算法。该算法采用基于工序权重的浮点数编码—解码机制,消除了排列组合型编码方式对进化操作带来的约束,运用差分进化策略生成新个体,以提高优秀个体产生的几率,进而保证算法有更好的收敛性。将算法与传统算法及其改进形式在相同测试用例上进行对比,结果表明,本算法在保证收敛性的同时,搜索到更多的非支配个体,体现出更好的分布性。此外,提出了平行决策和等价平行决策的定义,将柔性车间调度模型的研究拓展至决策空间。

关 键 词:柔性车间调度  浮点型编码策略  差分进化  等价平行决策

Float-code based differential evolutionary multi-objective optimization forflexible Job-Shop scheduling problem
CAI Xi,LI Mei-yi,WANG Kang,XIAO Jian.Float-code based differential evolutionary multi-objective optimization forflexible Job-Shop scheduling problem[J].Application Research of Computers,2013,30(4):999-1003.
Authors:CAI Xi  LI Mei-yi  WANG Kang  XIAO Jian
Affiliation:College of Information Engineering, Xiangtan University, Xiangtan Hunan 411105, China
Abstract:Evolutionary algorithms (EAs) for optimizing flexible Job-Shop scheduling are always confined to the code-decode mechanism. Traditional coding strategy restricts the search ability of EAs. This paper proposed a differential evolutionary algorithm using float value based coding strategy on operation procedures for solving FJSP. Combining the float-based weight coefficient code-decode mechanism and differential evolutionary strategy, the algorithm averted the influence of permutation and combination coding strategies and could obtain the global optimal solutions. The results obtained from the computational study show that this algorithm can achieve the Pareto optimal solution with an ideal uniformity. Furthermore, giving the definitions of parallel decision and equivalent parallel decision expands the study of FJSP into decision space.
Keywords:flexible Job-Shop scheduling  float coding strategy  differential evolution  equivalent parallel decision
本文献已被 CNKI 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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