By Topic

Ranking a list of discrete-event models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
de Swaan Arons, H. ; Erasmus Univ., Rotterdam, Netherlands ; Boer, C.A.

It has been demonstrated that Arena simulation models can be parameterized and stored in a relational database for later use. In this way an Arena model can be uniquely described by assigning the right values to the corresponding parameters. These parameters contain detailed information concerning type and number of modules, entities and routes which entities follow through the system. A modeler could query such a database hoping that it would contain the Arena (sub)model that one has in mind. Unfortunately, an exact match will seldom occur but the database might contain one or more similar models. In earlier work a numerical algorithm was proposed resulting in a ranked list of simulation models in the database. According to this the lower a model is ranked the more it resembles the specified model. This model depends on a number of weight factors. In this paper the ranking algorithm is evaluated by carrying out a number of experiments.

Published in:

Simulation Symposium, 2002. Proceedings. 35th Annual

Date of Conference:

14-18 April 2002