Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6897752 | European Journal of Operational Research | 2013 | 10 Pages |
Abstract
Mathematical programming has been proposed in the literature as an alternative technique to simulating a special class of Discrete Event Systems. There are several benefits to using mathematical programs for simulation, such as the possibility of performing sensitivity analysis and the ease of better integrating the simulation and optimisation. However, applications are limited by the usually long computational times. This paper proposes a time-based decomposition algorithm that splits the mathematical programming model into a number of submodels that can be solved sequentially to make the mathematical programming approach viable for long running simulations. The number of required submodels is the solution of an optimisation problem that minimises the expected time for solving all of the submodels. In this way, the solution time becomes a linear function of the number of simulated entities.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Arianna Alfieri, Andrea Matta,