SUMMARY OF EXAMPLES OF PERFORMING SIMULATIONS ON SPREADSHEETS WITH ANALYTIC SOLVER PLATFORM

By -

SUMMARY

Increasingly, spreadsheet software is being used to perform simulations. As illustrated in Secs. 20.1 and 20.4, the standard Excel package sometimes is sufficient to do this. In addition, some Excel add-ins now are available that greatly extend these capabilities. ASPE is an especially powerful add-in of this kind.

When using ASPE, each input cell that has a random value is referred to as an uncer- tain variable cell. The procedure for defining an uncertain variable cell includes selecting one of 46 types of probability distributions from the Distributions menu to enter into the cell. When historical data are available, ASPE also has a procedure for identifying which continuous distribution fits the data best.

An output cell that is used to forecast a measure of performance is called a results cell. Each trial of a simulation run generates a value in each results cell. When the simulation run is completed, ASPE provides the results in a variety of useful forms, including a frequency distribution, a statistics table, a percentiles table, and a cumulative chart.

When a simulation model has one or two decision variables, ASPE provides a para- meter analysis report that systematically applies simulation to identify at least an approximation of an optimal solution. A trend chart also provides additional insights to aid in decision making.

In addition, ASPE includes a powerful optimization module called Solver. This module efficiently uses a series of simulation runs to search for an optimal solution for a simulation model with any number of decision variables.

The availability of such powerful software now enables managers to add simulation to their personal tool kit of OR techniques for analyzing some key managerial problems. A variety of examples in this chapter illustrate some of the many possibilities for important applications of simulation.

Comments

Post a Comment

Popular posts from this blog

DUALITY THEORY:THE ESSENCE OF DUALITY THEORY

By -
Image
THE ESSENCE OF DUALITY THEORY Given our standard form for the primal problem at the left (perhaps after conversion from another form), its dual problem has the form shown to the right. Thus, with the primal problem in maximizatio n form, the dual problem is in minimization form instead. Furthermore, the dual problem uses exactly the same pa r amete r s as the primal problem, but in different locations, as summarized below. 1. The coefficients in the objective function of the primal problem are the right-hand sides of the functional constraints in the dual problem. 2. The right-hand sides of the functional constraints in the primal problem are the coef- ficients in the objective function of the dual problem. 3. The coefficients of a variable in the functional constraints of the primal problem are the coefficients in a functional constraint of the dual problem. To highlight the comparison, now look at these same two problems in matrix notation (as introduced at the beginn
Read more

NETWORK OPTIMIZATION MODELS:THE MINIMUM SPANNING TREE PROBLEM

By -
Image
THE MINIMUM SPANNING TREE PROBLEM The minimum spanning tree problem bears some similarities to the main version of the shortest-path problem presented in the preceding section. In both cases, an undi r ecte d and connected network is being considered, where the given information includes some mea- sure of the positive length (distance, cost, time, etc.) associated with each link. Both problems also involve choosing a set of links that have the shortest total length among all sets of links that satisfy a certain property. For the shortest-path problem, this property is that the chosen links must provide a path between the origin and the destination. For the minimum spanning tree problem, the required property is that the chosen links must provide a path between ea c h pair of nodes. The minimum spanning tree problem can be summarized as follows: 1. You are given the nodes of a network but not the links. Instead, you are given the po- tential links and the positive length for each
Read more

NETWORK OPTIMIZATION MODELS:THE SHORTEST-PATH PROBLEM

By -
Image
THE SHORTEST-PATH PROBLEM Although several other versions of the shortest-path problem (including some for directed networks) are mentioned at the end of the section, we shall focus on the following simple version. Consider an undi r ecte d and connected network with two special nodes called the origin and the destination. Associated with each of the links (undirected arcs) is a non- negative distance. The objective is to find the shortest path (the path with the minimum total distance) from the origin to the destination. A relatively straightforward algorithm is available for this problem. The essence of this procedure is that it fans out from the origin, successively identifying the shortest path to each of the nodes of the network in the ascending order of their (shortest) distances from the origin, thereby solving the problem when the destination node is reached. We shall first outline the method and then illustrate it by solving the shortest-path problem encountered by the See
Read more