Computational issues for accessibility in discrete event simulation

Abstract

Several simulation model building and analysis issues have been studied using a computational complexity approach. More specifically, four problems related to simulation model building and analysis (accessibility of states, ordering of events, noninterchangeability of model implementations, and execution stalling) have been shown to be NP-hard search problems. These results imply that it is unlikely that a polynomial-time algorithm can be devised to verify structural properties of discrete event simulation models, unless P = NP. This article considers the problem of accessibility , identifies special cases that are polynomially solvable or remain NP-hard, and discusses implications with respect to the other three problems. A local search procedure and variations of simulated annealing are presented to address accessibility . Computational results illustrate these heuristics and demonstrate their strengths limitations.

Simulation optimization: A comprehensive review on theory and applications

“…They use two approaches to estimate the optimal solution and show that both are guaranteed to converge to the set of global optimal solutions. Yücesan and Jacobson (1996) consider solving the accessibility problem by using a local search procedure and five different variants of SA algorithms. SA outperforms the local search, but must be customized (i.e., modification of the annealing schedule) to the problem at hand, a major undertaking.…”

A survey of recent advances in discrete input parameter discrete-event simulation optimization

“…Zeng and Wu (1993) present a strategy for introducing perturbation analysis techniques into a simulated annealing algorithm for simulation optimization. Yücesan and Jacobson (1996) present a simulated annealing algorithm to address the simulation search problem ACCESSIBILITY (Jacobson and Yücesan, 1999). Stuckman et al (1991) compare a Bayesian/sampling algorithm, simulated annealing and genetic algorithms on their applicability and effectiveness to globally optimize simulations.…”