Discrete-event simulation optimization: a review of past approaches and propositions for future direction

Over the past twenty years, a significant body of work has been undertaken on the topic of methods and approaches to optimizing discrete-event simulation models. Then, as is now, one of the greatest challenges in optimizing discrete-event simulations is the inability to precisely identify "the" optimal solution to a given system model. This is especially the case as the feasible solution space expands. Also over the past twenty years, computational speed has increased, computing and modeling costs have decreased and theoretical developments in the field of simulation optimization have emerged. Yet a divide appears to be widening. Recent literature indicates a lack of new, innovative approaches to optimizing large scale discrete-event simulation models as well as an absence in addressing the growing chasm between the simulation modeling, optimization and outcome improvement processes. Many of the studies and advances undertaken in the early to mid-90's are those still cited today when discussing simulation optimization. This paper discusses and provides an overview of theoretical and methodological directions in discrete-event simulation optimization. In addition, it suggests areas of study for advancing the field. It is proposed that advances should move the field of study and application in the direction of blurring the boundaries between simulation modeling, optimization and change implementation communities instead of widening the gaps.

[1]  V. V. Emelyanov,et al.  An AI-based object-oriented tool for discrete manufacturing systems simulation , 1997, J. Intell. Manuf..

[2]  Xin-She Yang,et al.  Engineering Optimization: An Introduction with Metaheuristic Applications , 2010 .

[3]  Craig A. Tovey,et al.  On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers , 2004, Adapt. Behav..

[4]  Leyuan Shi,et al.  A new hybrid optimization algorithm , 1999 .

[5]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[6]  Talal M. Alkhamis,et al.  Discrete search methods for optimizing stochastic systems , 1998 .

[7]  Masayuki Matsui,et al.  Adam—Eve-like genetic algorithm: a methodology for optimal design of a simple flexible assembly system , 1999 .

[8]  M. Clerc,et al.  Particle Swarm Optimization , 2006 .

[9]  Siddhartha Bhattacharyya,et al.  Genetic learning through simulation: An investigation in shop floor scheduling , 1998, Ann. Oper. Res..

[10]  Philippe Lacomme,et al.  Multi-agent approach and stochastic optimization: random events in manufacturing systems , 1999, J. Intell. Manuf..

[11]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[12]  Nicholas V. Findler,et al.  Pattern search for optimization , 1987 .

[13]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[14]  Jorge Haddock,et al.  Simulation optimization using simulated annealing , 1992 .

[15]  Xin-She Yang,et al.  Firefly Algorithms for Multimodal Optimization , 2009, SAGA.

[16]  Felix Breitenecker,et al.  Genetic Algorithms in Discrete Event Simulation , 1995, EUROSIM International Conference.

[17]  Andrew J. Mason,et al.  Integrated Simulation, Heuristic and Optimisation Approaches to Staff Scheduling , 1998, Oper. Res..

[18]  David E. Goldberg,et al.  Genetic and evolutionary algorithms come of age , 1994, CACM.

[19]  Mitsuo Gen,et al.  Parallel machine scheduling problems using memetic algorithms , 1997 .

[20]  E. Hopper,et al.  A genetic algorithm for a 2D industrial packing problem , 1999 .

[21]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[22]  Ming Liang,et al.  Machine cell/part family formation considering processing times and machine capacities: a simulated annealing approach , 1998 .

[23]  Resit Unal,et al.  A Framework for the Optimization of Discrete-Event Simulation Models , 1996 .

[24]  Leyuan Shi,et al.  New parallel randomized algorithms for the traveling salesman problem , 1999, Comput. Oper. Res..

[25]  Farhad Azadivar,et al.  Simulation optimization with qualitative variables and structural model changes: A genetic algorithm approach , 1999, Eur. J. Oper. Res..

[26]  Andrea E. Olsson Particle Swarm Optimization: Theory, Techniques and Applications , 2010 .

[27]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[28]  H. Pierreval,et al.  Using evolutionary algorithms and simulation for the optimization of manufacturing systems , 1997 .

[29]  Mitsuo Gen,et al.  Hybrid evolutionary method for capacitated location-allocation problem , 1997 .

[30]  Mark A. Wellman,et al.  A genetic algorithm approach to optimization of asynchronous automatic assembly systems , 1995 .

[31]  Leovigildo Lopez-Garcia,et al.  A simulator that uses Tabu search to approach the optimal solution to stochastic inventory models , 1999 .

[32]  Jiyin Liu,et al.  The impact of neighbourhood size on the process of simulated annealing: computational experiments on the flowshop scheduling problem , 1999 .

[33]  Alexandre Dolgui,et al.  A stochastic method for discrete and continuous optimization in manufacturing systems , 1997, J. Intell. Manuf..