.png){kind=icon}
返回
A hybrid biogeography-based optimization algorithm for job shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2014.04.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a hybrid biogeography-based optimization (HBBO) algorithm has been proposed for the job-shop scheduling problem (JSP). Biogeography-based optimization (BBO) is a new bio-inpired computation method that is based on the science of biogeography. The BBO algorithm searches for the global optimum mainly through two main steps: migration and mutation. As JSP is one of the most difficult combinational optimization problems, the original BBO algorithm cannot handle it very well, especially for instances with larger size. The proposed HBBO algorithm combines the chaos theory and searching around the optimum strategy with the basic BBO, which makes it converge to global optimum solution faster and more stably. Series of comparative experiments with particle swarm optimization (PSO), basic BBO, the CPLEX and 14 other competitive algorithms are conducted, and the results show that our proposed HBBO algorithm outperforms the other state-of-the-art algorithms, such as genetic algorithm (GA), simulated annealing (SA), the PSO and the basic BBO. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Job-shop scheduling problem (JSP)
Biogeography-based optimization (BBO)
Chaos theory
Hybrid biogeography-based optimization (HBBO)
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions在不同的流程时间和迟到相关目标函数下，作业车间调度问题的优先级规则的比较
OAAI
OAAI分享收藏分享收藏A tabu search method guided by shifting bottleneck for the job shop scheduling problem作业车间调度问题的转移瓶颈引导的禁忌搜索方法
PREAI
分享收藏
查看更多内容