求解可重入并行机调度的混合禁忌搜索算法.pdfVIP

Journalof ISSNl001—9081 2012—09．01 ComputerApplications CODEN 计算机应用，2012，32(9)：2451—2454 JYIIDU http：／／www．joca．an 文章编号：1001—9081(2012)09—2451—04 求解可重入并行机调度的混合禁忌搜索算法 赵月。，胡玉梅 (天津大学理学院，天津300072) (}通信作者电子邮箱zhaoyue3025@tju．edu．ca) 摘要：为解决带有一台远程服务设备的可重入并行机调度问题，设计了一种混合禁忌搜索算法。针对传统禁 忌搜索算法只从单起始点搜索、容易陷入局部最优等缺点，混合禁忌搜索算法设计了一种Restart策略。当传统禁忌 搜索算法陷入局部最优时，用Restart策略重新产生初始解以进行禁忌搜索，将传统的禁忌搜索算法从单起始点搜索 改进成多起始点搜索。数值实验中将混合禁忌搜索算法与启发式算法cs相比，结果表明该算法具有较高的求解质 量，且其计算时间是可接受的。 关键词：调度；混合禁忌搜索算法；可重入；并行机；服务设备 中图分类号：TP301．6；TPl8文献标志码：A tabusearchfor reentranton machines Hybrid scheduling jobsparallel ZHAOYue‘．HUYu．mei (School旷Science，TianjinUniversity,Tianjin300072，China) Abstract：Atabusearch was inthis forthereentrant on proposed hybrid algorithm paper schedulingproblemparallel machineswitharemoteservice that one wasusedinthetraditional equipment．Concerningonly start—point tabusearch whichmadeit inlocal Restartmethodwasestablishedinthe tabusearch algorithm trapped optimumeasily，a hybrid thetraditionaltabusearch was inlocal Restartmethodwas algorithm．When algorithmtrapped optimum，the usedtorebuild theinitialsolutionand withthetabusearch traditional searchwas preceded algorithm．Thus，thesinglestart—point changed into weremadebetweenthe tabusearch anda Coordinate multiplestart-pointssearch．Comparisons hybrid algorithm