4.7 Article

Evolutionary Learning Based Simulation Optimization for Stochastic Job Shop Scheduling Problems

期刊

APPLIED SOFT COMPUTING
卷 106, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2021.107309

关键词

Stochastic Job Shop Scheduling Problem; Simulation Optimization; Ordinal Optimization; Genetic Programming (GP); Simulation based metaheuristics; Learning based simulation optimization

资金

  1. Electronic Component Systems for European Leadership Joint Undertaking [737459]
  2. European Union
  3. Science Foundation Ireland (SFI) [SFI 16/RC/3918]
  4. European Regional Development Fund

向作者/读者索取更多资源

This research advances evolutionary SO methods literature by exploring the use of metamodeling within these techniques. The proposed ELBSO method utilizes a Machine Learning based simulation metamodel created using Genetic Programming to optimize the Stochastic Job Shop Scheduling Problem, outperforming other algorithms in solution quality and computation time.
Simulation Optimization (SO) techniques refer to a set of methods that have been applied to stochastic optimization problems, structured so that the optimizer(s) are integrated with simulation experiments. Although SO techniques provide promising solutions for large and complex stochastic problems, the simulation model execution is potentially expensive in terms of computation time. Thus, the overall purpose of this research is to advance the evolutionary SO methods literature by researching the use of metamodeling within these techniques. Accordingly, we present a new Evolutionary Learning Based Simulation Optimization (ELBSO) method embedded within Ordinal Optimization. In ELBSO a Machine Learning (ML) based simulation metamodel is created using Genetic Programming (GP) to replace simulation experiments aimed at reducing computation. ELBSO is evaluated on a Stochastic Job Shop Scheduling Problem (SJSSP), which is a well known complex production planning problem in most industries such as semiconductor manufacturing. To build the metamodel from SJSSP instances that replace simulation replications, we employ a novel training vector to train GP. This then is integrated into an evolutionary two-phased Ordinal Optimization approach to optimize an SJSSP which forms the ELBSO method. Using a variety of experimental SJSSP instances, ELBSO is compared with evolutionary optimization methods from the literature and typical dispatching rules. Our findings include the superiority of ELBSO over all other algorithms in terms of the quality of solutions and computation time. Furthermore, the integrated procedures and results provided within this article establish a basis for future SO applications to large and complex stochastic problems. (C) 2021 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据