Abstract: Characterizing the network flow is of fundamental importance to understand the complex dynamics of networks. And passenger flow characteristics of the subway network are very relevant for an effective transportation management in urban cities. In this study, passenger flow of Seoul metropolitan subway network is investigated and characterized through statistical analysis. Traditional betweenness centrality measure considers only topological structure of the network and ignores the transportation factors. This paper proposes a weighted betweenness centrality measure that incorporates monthly passenger flow volume. We apply the proposed measure on the Seoul metropolitan subway network involving 493 stations and 16 lines. Several interesting insights about the network are derived from the new measures. Using Kolmogorov-Smirnov test, we also find out that monthly passenger flow between any two stations follows a power-law distribution and other traffic characteristics such as congestion level and throughflow traffic follow exponential distribution.
Abstract: Disasters are quite experienced in our days. They are
caused by floods, landslides, and building fires that is the main
objective of this study. To cope with these unexpected events,
precautions must be taken to protect human lives. The emphasis on
disposal work focuses on the resolution of the evacuation problem in
case of no-notice disaster. The problem of evacuation is listed as a
dynamic network flow problem. Particularly, we model the
evacuation problem as an earliest arrival flow problem with load
dependent transit time. This problem is classified as NP-Hard. Our
challenge here is to propose a metaheuristic solution for solving the
evacuation problem. We define our objective as the maximization of
evacuees during earliest periods of a time horizon T. The objective
provides the evacuation of persons as soon as possible. We
performed an experimental study on emergency evacuation from the
tunisian children’s hospital. This work prompts us to look for
evacuation plans corresponding to several situations where the
network dynamically changes.
Abstract: The solution algorithm, based on Lagrangian relaxation, a sub-gradient method and a heuristic to find the upper bound of the solution, is proposed to solve the coordinated fleet routing and flight scheduling problems. Numerical tests are performed to evaluate the proposed algorithm using real operating data from two Taiwan airlines. The test results indicate that the solution algorithm is a significant improvement over those obtained with CPLEX, consequently they could be useful for allied airlines to solve coordinated fleet routing and flight scheduling problems.
Abstract: Recently global concerns for the energy security have
steadily been on the increase and are expected to become a major
issue over the next few decades. Energy security refers to a resilient
energy system. This resilient system would be capable of
withstanding threats through a combination of active, direct security
measures and passive or more indirect measures such as redundancy,
duplication of critical equipment, diversity in fuel, other sources of
energy, and reliance on less vulnerable infrastructure. Threats and
disruptions (disturbances) to one part of the energy system affect
another. The paper presents methodology in theoretical background
about energy system as an interconnected network and energy supply
disturbances impact to the network. The proposed methodology uses
a network flow approach to develop mathematical model of the
energy system network as the system of nodes and arcs with energy
flowing from node to node along paths in the network.