Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Frequently Asked Questions
Frequently Asked Questions
Communities & Collections
Communities & Collections
Rectilinear interdiction problem by locating a line barrier
Download
index.pdf
Date
2013
Author
Gharravi, Hossein Gharehmeshk
Metadata
Show full item record
Item Usage Stats
4
views
3
downloads
This study is an optimization approach to the rectilinear interdiction problem by locating a line barrier. Interdiction problems study the e ect of a limited disruption action on operations of a system. Network interdiction problems, where nodes and arcs of the network are susceptible to disruption actions, are extensively studied in the operations research literature. In this study, we consider a set of sink points on the plane that are being served by source points and our aim is to study the e ect of locating a line barrier on the plane (as a disruption action) such that the total shortest distance between sink and source points is maximized. We compute the shortest distances after disruption using visibility concept and utilizing properties of our problem. The amount of disruption is limited by imposing constraints on the length of the barrier and also the total number of disrupted points. The suggested solution approaches are based on mixed-integer programming and a polynomial-time algorithm.
Subject Keywords
Business logistics.
,
Materials management.
,
Integer programming.
,
Polynomials.
URI
http://etd.lib.metu.edu.tr/upload/12615380/index.pdf
https://hdl.handle.net/11511/22376
Collections
Graduate School of Natural and Applied Sciences, Thesis