Maximum dynamic network flow interdiction problem: New formulation
سال
: 2013
چکیده: 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
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
کلیدواژه(گان): Maximum dynamic flow
Network interdiction
Temporally repeated flows
Benders’ decomposition
Vital arc
کالکشن
:
-
آمار بازدید
Maximum dynamic network flow interdiction problem: New formulation
Show full item record
| contributor author | ماریا افشاری راد | en |
| contributor author | حسین تقی زاده کاخکی | en |
| contributor author | maria Afshari Rad | fa |
| contributor author | Hossein Taghizadeh Kakhki | fa |
| date accessioned | 2020-06-06T13:13:32Z | |
| date available | 2020-06-06T13:13:32Z | |
| date issued | 2013 | |
| identifier uri | http://libsearch.um.ac.ir:80/fum/handle/fum/3346599 | |
| description 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 | en |
| language | English | |
| title | Maximum dynamic network flow interdiction problem: New formulation | en |
| type | Journal Paper | |
| contenttype | External Fulltext | |
| subject keywords | Maximum dynamic flow Network interdiction Temporally repeated flows Benders’ decomposition Vital arc | en |
| journal title | Computers and Industrial Engineering | fa |
| pages | 531-536 | |
| journal volume | 65 | |
| journal issue | 7 | |
| identifier link | https://profdoc.um.ac.ir/paper-abstract-1035400.html | |
| identifier articleid | 1035400 |