Computers and Industrial Engineering, ( ISI ), Volume (65), No (7), Year (2013-7) , Pages (531-536)

Title : ( Maximum dynamic network flow interdiction problem: New formulation )

Authors: maria Afshari Rad , Hossein Taghizadeh Kakhki ,

Access to full-text not allowed by authors

Citation: BibTeX | EndNote

Abstract

We consider the dynamic version of the maximum flow network interdiction problem; that is, we assume a positive number is assigned to each arc which indicates the traversal time of the flow through that arc. We also assume that an intruder uses a single resource with limited budget to interrupt the flow of a single commodity through the network within a given time limit of T. A new formulation based on the concept of Temporally Repeated Flow (TRF) is presented. The problem is then solved using Benders’ decomposition. Another solution method, based on the most vital arcs in a network is also discussed. Finally, some computational results are reported

Keywords

Maximum dynamic flow Network interdiction Temporally repeated flows Benders’ decomposition Vital arc
برای دانلود از شناسه و رمز عبور پرتال پویا استفاده کنید.

@article{paperid:1035400,
author = {Afshari Rad, Maria and Taghizadeh Kakhki, Hossein},
title = {Maximum dynamic network flow interdiction problem: New formulation},
journal = {Computers and Industrial Engineering},
year = {2013},
volume = {65},
number = {7},
month = {July},
issn = {0360-8352},
pages = {531--536},
numpages = {5},
keywords = {Maximum dynamic flow Network interdiction Temporally repeated flows Benders’ decomposition Vital arc},
}

[Download]

%0 Journal Article
%T Maximum dynamic network flow interdiction problem: New formulation
%A Afshari Rad, Maria
%A Taghizadeh Kakhki, Hossein
%J Computers and Industrial Engineering
%@ 0360-8352
%D 2013

[Download]