Optimizing Dynamic Evacuation Using Mixed-Integer Linear Programming

Збережено в:

Бібліографічні деталі
Опубліковано в::	Mathematics vol. 13, no. 1 (2025), p. 12
Автор:	Hamoud Bin Obaid
Інші автори:	Trafalis, Theodore B, Abushaega, Mastoor M, Altherwi, Abdulhadi, Hamzi, Ahmed
Опубліковано:	MDPI AG
Предмети:	Mathematical programming Propagation Traffic assignment Time dependence Linear programming Integer programming Sensitivity analysis Transportation models Equilibrium Roads & highways Optimization Travel time Linear functions Transportation planning Traffic flow Mixed integer Evacuation
Онлайн доступ:	Citation/Abstract Full Text + Graphics Full Text - PDF
Теги:	Додати тег Немає тегів, Будьте першим, хто поставить тег для цього запису!

Опис
Короткий огляд:	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.
ISSN:	2227-7390
DOI:	10.3390/math13010012
Джерело:	Engineering Database