Model and a solution algorithm for the dynamic resource allocation problem for large-scale transportation network evacuation
Develop an MILP model for the dynamic resource allocation problem. Describe evacuation traffic dynamics using the earliest arrival flow formulation. Reduce the combinatorial complexity by introducing auxiliary binary variables. Apply Benders decomposition scheme to solve the problem efficiently.
resource allocation benders decomposition evacuation planning mixed integer linear program