کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1705078 1012423 2010 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Maximum flow problem on dynamic generative network flows with time-varying bounds
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مکانیک محاسباتی
پیش نمایش صفحه اول مقاله
Maximum flow problem on dynamic generative network flows with time-varying bounds
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematical Modelling - Volume 34, Issue 8, August 2010, Pages 2136–2147
نویسندگان
, ,