Data on supply chains is often sparse due to reluctance among actors to share their data, making supply chain simulation modeling difficult. As a result, supply chain simulation models suffer from parametric and structural uncertainties, and there is a large variety of plausible simulation models that would align with the sparse observations about the real-world supply chain. Constructing a diverse set of models that fit sparse data is not an easy task. A relatively unknown approach to generating this diverse set of plausible models is the Quality Diversity (QD) algorithm. This study evaluates the feasibility of using QD to generate a diverse ensemble of supply chain simulation models for a varying degree of data sparseness. The results show that QD is able to generate a diverse ensemble of supply chain models, including the ground truth. As expected, QD successfully identifies the structure of the ground truth most frequently for a low level of data sparseness. When the sparseness of the data increases, QD is prone to overfitting, identifying supply chain structures that are more complex than the ground truth. Further research should focus on reviewing the calibration metric for sparse data, to reduce the overfitting of complex network structures.

The police control room determines where to send available police units to intercept a fleeing fugitive. Models can support the police with decision-making for fugitive interception. The police have, at most, a few minutes to determine an interception strategy. Therefore, a timely calculation of the interception positions is essential to support police interception operations. The number of nodes in the network, each being a crossing where routes of the fleeing suspect can split, greatly contributes to the computation time. Graph coarsening is a promising approach to reduce the complexity of the network, and therefore the computation time. We compare four graph coarsening algorithms on five road networks and assess their impact on computation time and solution quality for the fugitive interception problem. Based on the comparison, we propose and test a new method specifically for fugitive interception. This method, Search Space Representation, improves the quality of the best solutions obtained by the optimization algorithm with up to 12%, improves the reliability of the optimization to find high-quality solutions, and decreases the number of function evaluations required to obtain high-quality solutions to 5000–10,000 depending on the size and complexity of the road network, which is feasible for real-time decision-making. Search Space Representation can be applied to reduce the computation time of other network-based optimization problems.

One of the tasks of police is catching fleeing suspects, where the police interception positions depend on the fleeing suspect’s route choices. Various conceptualizations of route choice decision-making of fleeing suspects exist. However, we do not know the effects of these different models of fugitive behavior on the calculated police interception strategy. Therefore, we operationalize two models of route choice and implement these in a simulation. Police interception strategies are obtained by optimization. The resulting sets of routes and the calculated police interception positions are subsequently compared and interpreted. The experiments show that the different route-choice models result in different escape routes and, therefore, different calculated police interception positions. The differences are larger when the road network is complex and contains non-uniform obstacles. In other words, the robustness of the calculated police interception positions for each model largely depends on the network topology.

Illicit supply chains for products like counterfeit Personal Protective Equipment (PPE) are characterized by sparse data and great uncertainty about the operational and logistical structure, making criminal activities largely invisible to law enforcement and challenging to intervene in. Simulation is a way to get insight into the behavior of complex systems, using calibration to tune model parameters to match its real-world counterpart. Calibration methods for simulation models of illicit supply chains should work with sparse data, while also tuning the structure of the simulation model. Thus, this study addresses the question: “To what extent can various model calibration techniques reconstruct the underlying structure of an illicit supply chain when varying the degree of data sparseness?” We evaluate the quality-of-fit of a reference technique, Powell's Method, and three model calibration techniques that have shown promise for sparse data: Approximate Bayesian Computing, Bayesian Optimization, and Genetic Algorithms. For this, we use a simulation model of a stylized counterfeit PPE supply chain as ground truth. We extract data from this ground truth and systematically vary its sparseness. We parameterize structural uncertainty using System Entity Structure. The results demonstrate that Bayesian Optimization and Genetic Algorithms are suitable for reconstructing the underlying structure of an illicit supply chain for a varying degree of data sparseness. Both techniques identify a diverse set of optimal solutions that fit with the sparse data. For a comprehensive understanding of illicit supply chain structures, we propose to combine the results of the two techniques. Future research should focus on developing a combined algorithm and incorporating solution diversity.