During the COVID-19 pandemic, authorities in many places have implemented various countermeasures, including setting up a cordon sanitaire to restrict population movement. This paper proposes a bi-level programming model to deploy a limited number of parallel checkpoints at each entry link around the cordon sanitaire to achieve a minimum total waiting time for all travelers. At the lower level, it is a transportation network equilibrium with queuing for a fixed travel demand and given road network. The feedback process between trip distribution and trip assignment results in the predicted waiting time and traffic flow for each entry link. For the lower-level model, the method of successive averages is used to achieve a network equilibrium with queuing for any given allocation decision from the upper level, and the reduced gradient algorithm is used for traffic assignment with queuing. At the upper level, it is a queuing network optimization model. The objective is the minimization of the system’s total waiting time, which can be derived from the predicted traffic flow and queuing delay time at each entry link from the lower-level model. Since it is a nonlinear integer programming problem that is hard to solve, a genetic algorithm with elite strategy is designed. An experimental study using the Nguyen-Dupuis road network shows that the proposed methods effectively find a good heuristic optimal solution. Together with the findings from two additional sensitivity tests, the proposed methods are beneficial for policymakers to determine the optimal deployment of cordon sanitaire given limited resources.
Read full abstract