Content deleted Content added
m Removed invisible unicode characters + other fixes, replaced: → (24) using AWB (12016) |
Revised based on feedback from simulation class (IND E 535) at University of Washington. |
||
Line 3:
Once a system is mathematically modeled, computer-based simulations provide the information about its behavior. Parametric simulation methods can be used to improve the performance of a system. In this method, the input of each variable is varied with other parameters remaining constant and the effect on the design objective is observed. This is a time-consuming method and improves the performance partially. To obtain the optimal solution with minimum computation and time, the problem is solved iteratively where in each iteration the solution moves closer to the optimum solution. Such methods are known as ‘numerical optimization’ or ‘simulation-based optimization’.<ref>Nguyen, Anh-Tuan, Sigrid Reiter, and Philippe Rigo. "A review on simulation-based optimization methods applied to building performance analysis."''Applied Energy'' 113 (2014): 1043–1058.</ref>
In simulation experiment, the goal is to evaluate the effect of different values of input variables on a system, which is called running simulation experiments. However
Specific simulation based optimization methods can be chosen according to figure 1 based on the decision variable types.<ref>Jalali, Hamed, and Inneke Van Nieuwenhuyse. "Simulation optimization in inventory replenishment: a classification." IIE Transactions 47.11 (2015): 1217-1235.</ref>
Line 20:
=== Heuristic methods ===
[[Heuristic (computer science)|Heuristic methods]] change accuracy by speed. Their goal is to find a good solution faster than the traditional methods, when they are too slow or fail in solving the problem. Usually they find local optimal instead of the optimal value; however, the values are considered close enough of the final solution. Examples of this kind of method is [[Tabu search|tabu search]] or
=== Stochastic approximation ===
Line 82:
==== Neuro-dynamic programming ====
Neuro-dynamic programming is the same as dynamic programming except that the former has the concept of approximation architectures. It combines
== Limitations ==
Simulation
== Application ==
|