Permutation Flow Shop Scheduling Problem Based on Hybrid Binary Distribution Estimation Algorithm

被引:0
|
作者
Pei X. [1 ]
Zhao H. [1 ]
机构
[1] School of Management, Tianjin University of Technology, Tianjin
关键词
Biogeography-based optimization(BBO); Building block; Distribution estimation algorithm; Permutation flow shop scheduling;
D O I
10.3969/j.issn.1004-132X.2017.22.016
中图分类号
学科分类号
摘要
To solve the permutation flow shop scheduling problems with the objective of minimizing makespan, an effective new hybrid binary estimation distribution algorithm(HB-EDA) was proposed based on binary estimation of distribution algorithm and BBO. HB-EDA took distribution estimation algorithm as architecture and the binary probability model was used as the evolutionary basis. For the excellent chromosomes and the inferior chromosomes, the link gene blocks with the dominant informations and the disadvantage informations were excavated by the probability model, these blocks were reserved in two archives for future use. Integrating with migration operator of BBO, two block archives were used to update maternal chromosomes with certain migration rate to generate sub-groups, then performing segmentation and recombination on the chromosomes to further selecting high fitness solution. Simulation results on Reeves and Taillard suites and comparisons with other algorithms validate the excellent searching ability and efficiency of the proposed algorithm. © 2017, China Mechanical Engineering Magazine Office. All right reserved.
引用
收藏
页码:2752 / 2759
页数:7
相关论文
共 25 条
  • [1] Garey M.R., Johnson D.S., Computers and Intractability: a Guide to the Theory of NP-Completeness, 23, 5, pp. 11-19, (1979)
  • [2] Chung C.S., Flynn J., Kirca O., A Branch and Bound Algorithm to Minimize the Total Flow Time for M-machine Permutation Flowshop Problems, International Journal of Production Economics, 79, 3, pp. 185-196, (2002)
  • [3] Framinan J.M., Gupta J.N.D., Leisten R., A Review and Classification of Heuristics for Permutation Flow-shop Scheduling with Makespan Objective, Journal of the Operational Research Society, 55, 12, pp. 1243-1255, (2004)
  • [4] Ruiz R., Maroto C., A Comprehensive Review and Evaluation of Permutation Flowshop Heuristics, European Journal of Operational Research, 165, 2, pp. 479-494, (2005)
  • [5] Ceberio J., Irurozki E., Mendiburu A., Et al., A Review on Estimation of Distribution Algorihms in Permutation-based Combinatorial Optimization Problems, Progress in Artificial Intelligence, 1, 1, pp. 103-117, (2012)
  • [6] Wang S., Wang L., Fang C., Et al., Advances in Estimation of Distribution Algorithms, Control and Decision, 27, 7, pp. 961-966, (2012)
  • [7] Lima C.F., Pelikan M., Lobo F.G., Et al., Loopy Substructural Local Search for the Bayesian Optimization Algorithm, International Workshop on Engineering Stochastic Local Search Algorithms, pp. 61-75, (2009)
  • [8] Larraanaga P., Lozano J.A., Estimation of Distribution Algorithms: a New Tool for Evolutionary Computation, pp. 1140-1148, (2002)
  • [9] Liu H., Gao L., Pan Q., A Hybrid Particle Swarm Optimization with Estimation of Distribution Algorithm for Solving Permutation Flowshop Scheduling Problem, Expert Systems with Applications, 38, 4, pp. 4348-4360, (2011)
  • [10] Tzeng Y.R., Chen C.L., Chen C.L., A Hybrid EDA with ACS for Solving Permutation Flow Shop Scheduling, The International Journal of Advanced Manufacturing Technology, 60, 9-12, pp. 1139-1147, (2012)