Simulation–optimization configurations for real-time decision-making in fugitive interception

Abstract

Simulation–optimization models are well-suited for real-time decision-support to the control room for search and interception of fugitives by Police on a road network, due to their ability to encode complex behavior while still optimizing the interception.

The typical simulation–optimization configuration is simulation model optimization, where the simulation model describes the system to be optimized, and the optimizer attempts to find the combination of decision variables that maximizes the interception probability. However, the repeated evaluation of the simulation model leads to high computation time, thus rendering it inadequate for time-constrained decision contexts. To support police interception operations in real-time, timely calculation of the solution is essential. Sequential simulation–optimization, where the simulation model, with its rich behavior, constructs (part of) the constraints of an optimization problem, could decrease the computation time.

We compare the computation time for two configurations of simulation–optimization (typical simulation model optimization and sequential simulation–optimization) for various problem instances of the fugitive interception problem. We show that sequential simulation–optimization reduces the computation time of large instances of the fugitive interception case study ten-fold. This result illustrates the potential of sequential simulation–optimization to mitigate the expensive optimization of simulation models.