节点文献

改进遗传算法求解含单转运系统车间调度问题

Improved genetic algorithm for flowshop scheduling problem with single-transporter systems

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 轩华武怡璇王薛苑

【Author】 XUAN Hua;WU Yi-xuan;WANG Xue-yuan;School of Management, Zhengzhou University;

【机构】 郑州大学管理学院

【摘要】 研究单转运系统分布式置换流水线调度问题,任一工厂内连续两台机器间有一台运输能力有限的转运机器人。基于此,提出一种多策略融合改进遗传算法以最小化最大完工时间。引入Logistic-tent混沌搜索、基于K-均值聚类的NEH算法和修正NEH算法以改善初始工厂加工序列群的质量,运用结合均匀多点交叉和互换变异的自适应交叉变异算子或工厂内/间交叉变异算子进行解的调整,设计一种基于主工厂的邻域搜索(key-factory-based local search, KFLS)和半初始化策略进行再次优化。仿真结果表明了该算法的有效性。

【Abstract】 A distributed permutation flowline problem of single-transporter systems was studied where an available transport robot with limited transport capacity between two continuous machines exist in any factory. Based on this, the multi-strategy fusion improved genetic algorithm was proposed to minimize the maximum completion time. The Logistic-tent chaotic search, Nawaz-Enscore-Ham(NEH) algorithm based on K-means clustering and the modified NEH algorithm were introduced to improve the quality of the initial factory processing sequence group. The self-adaptive crossover and mutation operators based on uniform multi-point crossover and exchange mutation or inter/external-factory crossover and mutation operators were applied to adjust solutions. The key-factory-based local search and semi-initialization strategy were designed for re-optimization. Simulation results show that the algorithm is effective.

【基金】 河南省科技攻关计划基金项目(232102321093、232102321026);国家自然科学基金项目(U1804151);2023年河南省哲学社会科学规划基金项目(2023BJJ085)
  • 【文献出处】 计算机工程与设计 ,Computer Engineering and Design , 编辑部邮箱 ,2025年01期
  • 【分类号】TH186;TP18
  • 【下载频次】20
节点文献中: 

本文链接的文献网络图示:

本文的引文网络