Network flow planning algorithm

Versión 1.0.0 (3,83 KB) por Yuanyuan Feng
It is a two-step sub-optimal algorithm, called Network Flow Planning (NFP) algorithm for large-scale bus evacuation problems
0.0
(0)
15 descargas
Actualizado 25 ene 2023

Ver licencia

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

Citar como

Yuanyuan Feng (2024). Network flow planning algorithm (https://www.mathworks.com/matlabcentral/fileexchange/123890-network-flow-planning-algorithm), MATLAB Central File Exchange. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R2018b
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Etiquetas Añadir etiquetas

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versión Publicado Notas de la versión
1.0.0