融合路径重连的混合算法求解作业车间调度问题.pdfVIP

机械工程师

MECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEERMECHANICALENGINEER

融合路径重连的混合算法求解作业车间调度问题

孟悦，赵诗奎

（济南大学机械工程学院，济南250022）

摘：

针对作业车间调度问题，以优化最大完工时间为目标，提出一种融合路径重连、邻域结构和遗传算法的混合算法。

邻域结构能够指导工序的移动，大大减少搜索时间，提高搜索能力；路径重连作为邻域结构的一种有效弥补方式，通过探索

高质量解及其逆解之间的差异，生成一系列路径解，对路径解进行评价，选择较好的解进入下一代，可以进一步提升算法性

能。结合作业车间调度问题的43个基准算例进行仿真分析，验证了所提算法具有良好的求解性能。

关键词：

作业车间调度问题；遗传算法；邻域结构；路径重连

中图分类号:TP391文献标志码:粤文章编号：员园园圆原圆猿猿猿（圆园员9）12原园032原园6

AHybridAlgorithmofFusionPathRelinkingtoSolveJobShopSchedulingProblem

MENGYueZHAOShikui

（SchoolofMechanicalEngineering,UniversityofJinan,Jinan250022,China）

Abstract:Inordertooptimizethemaximumcompletiontime,ahybridalgorithmintegratingpathrelinking,neighborhood

structuresearchandgeneticalgorithmisproposedforthejobshopschedulingproblem（JSP）.Theneighborhoodstructure

canguidethemovementoftheoperation,greatlyreducethesearchtime,andimprovethesearchability.Pathrelinkingis

aneffectivewaytomakeupfortheneighborhoodstructure.Byexploringthedifferencebetweenacertainhigh-quality

solutionanditsinversesolution,aseriesofpathsolutionsaregenerated.Thepathsolutionsareevaluated,andbetter

solutionsareselectedtoenterthenextgeneration,whichcanfurtherimprovetheperformanceof