Surrogate-assisted automatic evolving of dispatching rules for multi-objective dynamic job shop scheduling using genetic programming

被引:27
|
作者
Zeitrag, Yannik [1 ]
Figueira, Jose Rui [1 ]
Horta, Nuno [2 ]
Neves, Rui [2 ]
机构
[1] Univ Lisbon, Inst Super Tecn, CEGIST, Av Rovisco Pais 1, P-1049001 Lisbon, Portugal
[2] Univ Lisbon, Inst Super Tecn, Inst Telecomunicacoes, Av Rovisco Pais 1, P-1049001 Lisbon, Portugal
关键词
Multi-objective optimization; Surrogates; Hyper-heuristic; Genetic programming; Dynamic job shop scheduling; Machine learning; HYPER-HEURISTICS; ALGORITHM; DESIGN;
D O I
10.1016/j.eswa.2022.118194
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Dispatching rules are simple but efficient heuristics to solve multi-objective job shop scheduling problems, particularly useful to face the challenges of dynamic shop environments. A promising method to automatically evolve non-dominated rules represents multi-objective genetic programming based hyper-heuristic (MO-GP-HH). The aim of such methods is to approximate the Pareto front of non-dominated dispatching rules as good as possible in order to provide a sufficient set of efficient solutions from which the decision maker can select the most preferred one. However, one of the main drawbacks of existing approaches is the computational demanding simulation-based fitness evaluation of the evolving rules. To efficiently allocate the computational budget, surrogate models can be employed to approximate the fitness. Two possible ways, that estimate the fitness either based on a simplified problem or based on samples of fully evaluated individuals making use of machine learning techniques are investigated in this paper. Several representatives of both categories are first examined with regard to their selection accuracy and execution time. Furthermore, we developed a surrogate-assisted MO-GP-HH framework, incorporating a pre-selection task in the NSGA-II algorithm. The most promising candidates are consequently implemented in the framework. Using a dynamic job shop scenario, the two proposed algorithms are compared to the original one without using surrogates. With the aim to minimize the mean flowtime and maximum tardiness, experimental results demonstrate that the proposed algorithms outperform the former. Making use of surrogates leads to a reduction in computational costs of up to 70%. Another interesting finding shows that the enhanced ability to identify duplicates based on the phenotypic characterization of individuals is particularly helpful in increasing diversity within a population. This study illustrates the positive effect of this mechanism on the exploration of the entire Pareto front.
引用
收藏
页数:19
相关论文
共 50 条
  • [1] Phenotype Based Surrogate-Assisted Multi-objective Genetic Programming with Brood Recombination for Dynamic Flexible Job Shop Scheduling
    Zhang, Fangfang
    Mei, Yi
    Nguyen, Su
    Zhang, Mengjie
    [J]. 2022 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2022, : 1218 - 1225
  • [2] Evolving Dispatching Rules for Multi-objective Dynamic Flexible Job Shop Scheduling via Genetic Programming Hyper-heuristics
    Zhang, Fangfang
    Mei, Yi
    Zhang, Mengjie
    [J]. 2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 1366 - 1373
  • [3] Surrogate-Assisted Genetic Programming for Dynamic Flexible Job Shop Scheduling
    Zhang, Fangfang
    Mei, Yi
    Zhang, Mengjie
    [J]. AI 2018: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, 11320 : 766 - 772
  • [4] Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems
    Tay, Joc Cing
    Ho, Nhu Binh
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 54 (03) : 453 - 473
  • [5] Automatic Design of Dispatching Rules with Genetic Programming for Dynamic Job Shop Scheduling
    Shady, Salama
    Kaihara, Toshiya
    Fujii, Nobutada
    Kokuryo, Daisuke
    [J]. ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS: THE PATH TO DIGITAL TRANSFORMATION AND INNOVATION OF PRODUCTION MANAGEMENT SYSTEMS, PT I, 2020, 591 : 399 - 407
  • [6] Evolving Ensembles of Dispatching Rules Using Genetic Programming for Job Shop Scheduling
    Park, John
    Nguyen, Su
    Zhang, Mengjie
    Johnston, Mark
    [J]. GENETIC PROGRAMMING (EUROGP 2015), 2015, 9025 : 92 - 104
  • [7] Surrogate-Assisted Evolutionary Multitask Genetic Programming for Dynamic Flexible Job Shop Scheduling
    Zhang, Fangfang
    Mei, Yi
    Nguyen, Su
    Zhang, Mengjie
    Tan, Kay Chen
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2021, 25 (04) : 651 - 665
  • [8] Selection Schemes in Surrogate-Assisted Genetic Programming for Job Shop Scheduling
    Su Nguyen
    Zhang, Mengjie
    Johnston, Mark
    Kay Chen Tan
    [J]. SIMULATED EVOLUTION AND LEARNING (SEAL 2014), 2014, 8886 : 656 - 667
  • [9] Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling
    Zeitrag, Yannik
    Figueira, Jose Rui
    [J]. JOURNAL OF SCHEDULING, 2023, 26 (03) : 289 - 314
  • [10] Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling
    Yannik Zeiträg
    José Rui Figueira
    [J]. Journal of Scheduling, 2023, 26 : 289 - 314