Please use this identifier to cite or link to this item:
|Title:||Application of evolutionary algorithms for solving multi-objective simulation optimization problems|
|Authors:||Hay, L.L. |
|Citation:||Hay, L.L.,Peng, C.E.,Suyan, T.,Juxin, L. (2009). Application of evolutionary algorithms for solving multi-objective simulation optimization problems. Studies in Computational Intelligence 171 : 91-110. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-88051-6_5|
|Abstract:||Most optimization problems associated with real-world complex systems are too difficult to bemodeled analytically. The difficulty may come from the uncertainties involved in the input and output of the system, the complex (often nonlinear) relationships between the system decision variables and the system performances, and possible multiple, conflicting performance measures to be considered when choosing the best design. In light of this, discrete event simulation has become one of the most popular tools for the analysis and design of complex systems due to its flexibility, its ability to model systems unable to be modeled through analytical methods, and its ability to model the time dynamic behavior of systems . However, simulation can only evaluate system performances for a given set of values of the system decision variables, i.e., it lacks the ability of searching for optimal values which would optimize one or several responses of the system. This explains the increasing popularity of research in integrating both simulation and optimization, known as simulation optimization: the process of finding the best values of decision variables for a system where the performance is evaluated based on the output of a simulation model of this system. © 2009 Springer-Verlag Berlin Heidelberg.|
|Source Title:||Studies in Computational Intelligence|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 9, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.