Ant colony optimization for Cuckoo Search algorithm for permutation flow shop scheduling problem

被引:24
作者
Zhang, Yu [1 ]
Yu, Yanlin [1 ]
Zhang, Shenglan [1 ]
Luo, Yingxiong [1 ]
Zhang, Lieping [1 ]
机构
[1] Guilin Univ Technol, Coll Mech & Control Engn, Guilin, Peoples R China
来源
SYSTEMS SCIENCE & CONTROL ENGINEERING | 2019年 / 7卷 / 01期
基金
中国国家自然科学基金;
关键词
Levy flight; Cuckoo Search algorithm; dynamic balance factor; self-adaptive step; permutation flow shop scheduling problem; TIME;
D O I
10.1080/21642583.2018.1555063
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A Cuckoo Search (CS) algorithm based on ant colony algorithm is proposed for scheduling problem in permutation flow shop scheduling problem (PFSP). When the raised CS algorithm obtains the position of the bird nest to be updated, it is used as a set of initial solution of the ant colony optimization algorithm (ACO), and ACO algorithm search optimization is performed in a very small range. After that, the solution obtained by the ACO search is taken as a new candidate solution, compared with the candidate bird nest according to the fitness degree. When the candidate solution of the ACO search optimization is better than the one generated by the Levy flight, the latter is replaced. Finally, the CS algorithm is selected, changing the new bird nest position according to the abandonment probability. The updated position tends to be more optimal, which improves the quality of the solution as well as the convergence speed and accuracy of the algorithm. Comparing the performance of the proposed algorithm with the standard Cuckoo one, by testing function, the optimized performance was verified. Finally, the Car benchmark test served as test data, and the performance in the PFSP was compared. The effectiveness and superiority in the algorithm in solving problem were confirmed.
引用
收藏
页码:20 / 27
页数:8
相关论文
共 30 条
  • [1] New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
    Abedinnia, Hamid
    Glock, Christoph H.
    Brill, Andreas
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2016, 74 : 165 - 174
  • [2] Binh H., 2016, Neural Computing and Applications, V30, P1, DOI DOI 10.1007/S00521-016-2823-5
  • [3] Link Prediction based on Quantum-Inspired Ant Colony Optimization
    Cao, Zhiwei
    Zhang, Yichao
    Guan, Jihong
    Zhou, Shuigeng
    [J]. SCIENTIFIC REPORTS, 2018, 8
  • [4] CARLIER J, 1978, RAIRO-RECH OPER, V12, P333
  • [5] Ant Colony Optimization based on Pareto optimality: application to a congested router controlled by PID regulation
    Chebli, Samira
    Elakkary, Ahmed
    Sefiani, Nacer
    [J]. SYSTEMS SCIENCE & CONTROL ENGINEERING, 2018, 6 (01) : 360 - 369
  • [6] Identification of transient boundary conditions with improved cuckoo search algorithm and polynomial approximation
    Chen, Hao-long
    Yu, Bo
    Zhou, Huan-lin
    Meng, Zeng
    [J]. ENGINEERING ANALYSIS WITH BOUNDARY ELEMENTS, 2018, 95 : 124 - 141
  • [7] A self-adaptive chaotic differential evolution algorithm using gamma distribution for unconstrained global optimization
    Coelho, Leandro dos Santos
    Hultmann Ayala, Helon Vicente
    Mariani, Viviana Cocco
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2014, 234 : 452 - 459
  • [8] Multi-type ant system algorithm for the time dependent vehicle routing problem with time windows
    Deng Ye
    Zhu Wanhong
    Li Hongwei
    Zheng Yonghui
    [J]. JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2018, 29 (03) : 625 - 638
  • [9] Faris H., 2016, SYSTEMS SCI CONTROL, V4, P1
  • [10] A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
    Fernandez-Viagas, Victor
    Framinan, Jose M.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 81 : 167 - 177