Network flow planning algorithm
It is a two-step sub-optimal algorithm, called Network Flow Planning (NFP) algorithm for large-scale bus evacuation problems
C1. A two-step sub-optimal algorithm, NFP, is proposed for large-scale BEPs
with the objective of minimizing the evacuation time.
C2. A network flow model with the objective of minimizing the total travel
time for BEPs is formulated and it is proven that it can be solved by
linear programming.
C3. For post-processing, a task construction sub-algorithm is developed to
transfer the solution of the network flow model into evacuation tasks
based on the evenly pairing theorem.
C4. Based on the same theorem, a task assignment sub-algorithm is designed
to allocate the constructed tasks to all buses as even as possible
引用格式
Yuanyuan Feng (2026). Network flow planning algorithm (https://ww2.mathworks.cn/matlabcentral/fileexchange/123890-network-flow-planning-algorithm), MATLAB Central File Exchange. 检索时间: .
| 版本 | 已发布 | 发行说明 | Action |
|---|---|---|---|
| 1.0.0 |
