Optimizing dynamic evacuation using Mixed-Integer linear programming
This study presents a new approach to optimize the dynamic evacuation process through a dynamic traffic assignment model formulated using mixed-integer linear programming (MILP). The model approximates the travel time for evacuee groups with a piecewise linear function that accounts for variations in travel time due to load-dependent factors. Significant delays are transferred to subsequent groups to simulate delay propagation. The primary objective is to minimize the network clearance time—the total time required for the last group of evacuees to reach safety from the start of the evacuation. Given the model’s computational intensity, a simplified version is introduced for comparison. Both the original and simplified models are tested on small networks and benchmarked against the Cell Transmission Model, a well-regarded method in dynamic traffic assignment literature. Additional objectives, including average travel time and average evacuation time, are explored. A sensitivity analysis is conducted to assess how varying the number of evacuee groups impacts model outcomes.
In the past few decades, the demand for cellular networks has grown tremendously due to the growing demand for data. However, the vast majority of the users are dynamic since they use their smart…
Due to the emergence of technology, electric motors (EMs), an essential part of electric vehicles (which basically act as engines), have become a pivotal component in modern industries. Monitoring…
This study presents a new approach to optimize the dynamic evacuation process through a dynamic traffic assignment model formulated using mixed-integer linear programming (MILP). The model…