Exploiting Adaptive Ladder Queue into Repast Simulation platform

Efficiently scheduling the pending event set of a discrete event simulator is a challenging problem. A critical point consists in identifying the most suitable data structure to ensure good performances of the simulation engine. Adaptive Ladder Queue (ALQ) proved to outperform other data structures available in literature, claiming O(1) amortized access time both in theory and in practice. Its value comes out even when used in other contexts. Agent-based modelling and simulation tools are largely catching on and provide a considerable opportunity to investigate ALQ performance. This paper provides an illustration of the potential of the above introduced data structure, in the context of Repast Simphony, a Java-based modelling system.