Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1705078 | Applied Mathematical Modelling | 2010 | 12 Pages |
Abstract
This paper considers a new class of network flows, called dynamic generative network flows in which, the flow commodity is dynamically generated at a source node and dynamically consumed at a sink node and the arc-flow bounds are time dependent. Then the maximum dynamic flow problem in such networks for a pre-specified time horizon T is defined and mathematically formulated in both arc flow and path flow presentations. By exploiting the special structure of the problem, an efficient algorithm is developed to solve the general form of the dynamic problem as a minimum cost static flow problem.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Hassan Salehi Fathabadi, Seyed Ahmad Hosseini,