柔性作业车间调度的精确邻域结构混合进化算法
Evolutionary Algorithm with Precise Neighborhood Structure for Flexible Workshop Scheduling
投稿时间:2020-06-08  
DOI:10.11908/j.issn.0253-374x.20220     稿件编号:    中图分类号:TP301.6
 
摘要点击次数: 40    全文下载次数: 32
中文摘要
      为解决现有基于关键路径的邻域搜索存在无效移动多、盲目性大以及仅优化单一目标的问题,设计了更加明确精准有效的邻域结构,包括同机器移动和跨机器移动两步操作;在此基础上,给出相应的关键工序精确移动条件,并将其从优化最大完工时间推广到多目标优化;为兼顾算法局部搜索和全局搜索,将其与进化算法进行混合,实现局部与全局的优势互补,并给出相应的混合算法框架;最后,通过两个国际通用的案例集进行测试,并将测试结果与成熟的算法进行对比,验证了所设计算法的有效性和高效性。
英文摘要
      In order to solve the problems of the existing neighborhood search based on critical path, such as too many invalid moves, too much blindness and optimization one objective, a more precise and effective neighborhood structure is designed, including the two-step operation of the same machine movement and the cross-machine movement. Based on which, the corresponding operation movement conditions are given and extended from the optimization of the maximum completion time to multi-objective optimization. Besides, to realize the complementary advantages of local and global search, the algorithm is mixed with the evolutionary algorithm, and the corresponding hybrid algorithm framework is given. Moreover, two internationally used case sets are tested, and the test results are compared with those of other algorithms to verify the effectiveness and efficiency of the proposed algorithm.
HTML   查看全文  查看/发表评论  

您是第8276830位访问者
版权所有《同济大学学报(自然科学版)》
主管单位:教育部 主办单位:同济大学
地  址: 上海市四平路1239号 邮编:200092 电话:021-65982344 E-mail: zrxb@tongji.edu.cn
本系统由北京勤云科技发展有限公司设计