Based on Tabu Search and Particle Swarm Optimization Algorithms Solving Job Shop Scheduling Optimization Problems

Liang Xu, Li Yanpeng, Jiao Xuan
{"title":"Based on Tabu Search and Particle Swarm Optimization Algorithms Solving Job Shop Scheduling Optimization Problems","authors":"Liang Xu, Li Yanpeng, Jiao Xuan","doi":"10.1109/ICDMA.2013.78","DOIUrl":null,"url":null,"abstract":"Solving the Job shop Scheduling problem, the design is based on Particle Swarm Optimization and Taboo Search which is a fast algorithm, And in this algorithm, bring in particle swarm strategy and taboo search strategy, A hybrid intelligence algorithm based on Particle Swarm algorithm and the taboo Search algorithm(TS-PSO) is designed. It overcomes particle swarm optimization algorithm in solving combinatorial optimization problem, and better to avoid the tabu search algorithm falling into local optimum, and convergence speed has also been increased. Through particle swarm and taboo search algorithm combined, the results show that this algorithm has very good accuracy of convergence, and is feasible, and compared with the traditional scheduling algorithm, Embodies the obvious superiority.","PeriodicalId":403312,"journal":{"name":"2013 Fourth International Conference on Digital Manufacturing & Automation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Fourth International Conference on Digital Manufacturing & Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMA.2013.78","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Solving the Job shop Scheduling problem, the design is based on Particle Swarm Optimization and Taboo Search which is a fast algorithm, And in this algorithm, bring in particle swarm strategy and taboo search strategy, A hybrid intelligence algorithm based on Particle Swarm algorithm and the taboo Search algorithm(TS-PSO) is designed. It overcomes particle swarm optimization algorithm in solving combinatorial optimization problem, and better to avoid the tabu search algorithm falling into local optimum, and convergence speed has also been increased. Through particle swarm and taboo search algorithm combined, the results show that this algorithm has very good accuracy of convergence, and is feasible, and compared with the traditional scheduling algorithm, Embodies the obvious superiority.
基于禁忌搜索和粒子群算法求解作业车间调度优化问题
为解决作业车间调度问题,设计了一种基于粒子群优化和禁忌搜索的快速算法,并在该算法中引入了粒子群策略和禁忌搜索策略,设计了一种基于粒子群算法和禁忌搜索算法的混合智能算法(TS-PSO)。该算法在解决组合优化问题时克服了粒子群算法的缺点,更好地避免了禁忌搜索算法陷入局部最优,提高了收敛速度。通过粒子群算法和禁忌搜索算法的结合,结果表明该算法具有很好的收敛精度,并且是可行的,并且与传统的调度算法相比,体现出明显的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信