Improved Genetic Algorithm for Solving Flexible Job Shop Scheduling Problem with Machine Deterioration Effect

被引:0
|
作者
Lin, Yali [1 ]
Zhang, Peng [2 ]
机构
[1] Dalian Jiaotong Univ, Coll Software, Dalian, Peoples R China
[2] Dalian Jiaotong Univ, Innovat Entrepreneurship Inst Educ, Dalian, Peoples R China
关键词
Flexible job shop scheduling; Improved genetic algorithm; Could model; Machine deterioration algorithm; Cloud model; Machine deterioration effect; Hamming similarity;
D O I
10.1109/iccsnt47585.2019.8962439
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
An improved cloud adaptive genetic annealing algorithm is proposed for the multi-objective FJSP with machine deterioration effect [16]. In terms of shortcomings for poor local search ability and premature convergence in GA, we improve fitness calculations, cross-variation, etc. Fitness calculation is combined with local search ability and probability jump property of simulated annealing algorithm to make it jump out of the local optimal solution. The Hamming similarity is inserted in the crossover operation, and the similarity is used to detect whether crossover operation is required, which can accelerate the running efficiency and convergence speed of the algorithm. Then, the cross-operation combines the adaptive crossover probability of the cloud model to enhance the global search capability of the algorithm. At last, we set standard position and cross position to improve cross-operation, which can enhance the global search ability of the algorithm. Through simulation experiments, the effectiveness of the algorithm for the integrated multi-objective shop scheduling algorithm is verified.
引用
收藏
页码:131 / 134
页数:4
相关论文
共 50 条
  • [31] A genetic algorithm for the Flexible Job-shop Scheduling Problem
    Pezzella, F.
    Morganti, G.
    Ciaschetti, G.
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (10) : 3202 - 3212
  • [32] A genetic algorithm for a Bicriteria flexible job shop scheduling problem
    Vilcot, Geoffrey
    Billaut, Jean-Charles
    Esswein, Carl
    2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1240 - 1244
  • [33] An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints
    Zhang, Guohui
    Hu, Yifan
    Sun, Jinghe
    Zhang, Wenqiang
    SWARM AND EVOLUTIONARY COMPUTATION, 2020, 54
  • [34] An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints
    Zhang G.
    Hu Y.
    Sun J.
    Zhang W.
    Swarm and Evolutionary Computation, 2020, 54
  • [35] Flexible Job-Shop Scheduling Problem by Genetic Algorithm
    Ida, Kenichi
    Oka, Kensaku
    ELECTRICAL ENGINEERING IN JAPAN, 2011, 177 (03) : 28 - 35
  • [36] The Improved Genetic Algorithm for Multi-objective Flexible Job Shop Scheduling Problem
    Yang, Jian Jun
    Ju, Lu Yan
    Liu, Bao Ye
    MECHANICAL, MATERIALS AND MANUFACTURING ENGINEERING, PTS 1-3, 2011, 66-68 : 870 - 875
  • [37] The Improved Simulated Annealing Genetic Algorithm for Flexible Job-Shop Scheduling Problem
    Gu, Xiaolin
    Huang, Ming
    Liang, Xu
    PROCEEDINGS OF 2017 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2017), 2017, : 22 - 27
  • [38] An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem
    Xiuli Wu
    Xiajing Liu
    Ning Zhao
    Memetic Computing, 2019, 11 : 335 - 355
  • [39] Solving the Flexible Job Shop Scheduling Problem Based on Memetic Algorithm
    Zhang, Guohui
    ADVANCES IN PRODUCT DEVELOPMENT AND RELIABILITY III, 2012, 544 : 1 - 5
  • [40] An improved Jaya algorithm for solving the flexible job shop scheduling problem with transportation and setup times
    Li, Jun-qing
    Deng, Jia-wen
    Li, Cheng-you
    Han, Yu-yan
    Tian, Jie
    Zhang, Biao
    Wang, Cun-gang
    KNOWLEDGE-BASED SYSTEMS, 2020, 200