| | 1 | = Optimize Parameters of !AnyLogic 6 Simulation Models = |
| | 2 | |
| | 3 | == Introduction == |
| | 4 | We assume the reader is familiar with xj technologies [http://www.anylogic.com AnyLogic 6] and has basic understanding of the [http://www.java.com Java] programming language. |
| | 5 | |
| | 6 | This howto is written as a tutorial by taking one of the sample models that ships with !AnyLogic and add connectors to optimize its parameters with !HeuristicLab algorithms. If you go through this tutorial you will hopefully get an idea on how to solve your specific problem and implement the connector in your model. If you're interested in the technical details and the backgrounds you can also read the first section of the howto aimed more at developers: [DevelopersOptimizingExternalApplications optimize parameters of simulation models.] |
| | 7 | |
| | 8 | == !AnyLogic 6 Supply Chain model == |
| | 9 | The model which we are going to optimize with !HeuristicLab comes preinstalled with !AnyLogic 6 and is called //Supply Chain//. You can open it either on the //Welcome page// after starting !AnyLogic 6 or by choosing "Sample Models" from the Help menu. After you opened the model you can try to run the Simulation. There is also an //Optimization Experiment// in this model which uses the proprietary optimization package !OptQuest. |
| | 10 | |
| | 11 | === Optimization Problem === |
| | 12 | Let's talk a little about the optimization problem: There are three players in a supply chain of which the first one produces goods from an unlimited source of resources and the last one sells goods to an unlimited number of customers. Each player maintains an inventory of goods out of which it fulfills the demands of the next player. There are ordering costs, holding costs and shipping costs. The optimization consists of defining parameters of an (s,S) inventory policy. The lower //s// in this policy defines the inventory level at which an order will be placed and the upper //S// defines the level which should be filled by the order. The optimization goal is to minimize the sum of all costs in the chain while satisfying a certain service level which is represented as the customer waiting time. If customers have to wait too long then the solution (aka. the parameters of the policy) is considered infeasible. In total we have 6 decision variables, one target variable and a constraint. |
| | 13 | |
| | 14 | == Preparing the Simulation Model == |
