Rectilinear interdiction problem by locating a line barrier

Download
index.pdf
2013
Gharravi, Hossein Gharehmeshk
Show full item record
210
views
88
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.
Business logistics., Materials management., Integer programming., Polynomials.
http://etd.lib.metu.edu.tr/upload/12615380/index.pdf
https://hdl.handle.net/11511/22376
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Generalization of restricted planar location problems : unified meta-heuristics for single facility case
Farham, Mohammad Saleh; Süral, Haldun; İyigün, Cem; Department of Industrial Engineering (2013)
A planar single facility location problem, also known as the Fermat–Weber problem, is to find a facility location such that the total weighted distance to a set of given demand points is minimized. A variation to this problem is obtained if there is a restriction coming from congested regions. In this study, congested regions are considered as arbitrary shaped polygonal areas on the plane where location of a facility is forbidden and traveling is charged with an additional fixed cost. The traveling fixed cost ...
Multiobjective hub location problem
Barutçuoğlu, Aras; Köksalan, Murat; Department of Industrial Engineering (2009)
In this study, we propose a two-phase solution approach for approximating the efficient frontier of a bicriteria hub location problem. We develop an evolutionary algorithm to locate the hubs on the network as the first phase. In the second phase, we develop a bounding procedure based on dominance relations and using the determined bounds, we solve the allocation subproblem for each located hub set. The two-phase approach is tested on the Australian Post data set and it is observed that our approach approxim...
A lagrangean heuristic for the two-stage modular capacitated facility location problem
Sevinç, Selim; Meral, Fatma Sedef; Department of Industrial Engineering (2008)
In this study, a Lagrangean heuristic based on Lagrangean relaxation and subgradient optimization is proposed for the two-stage modular capacitated facility location problem. The objective is to minimize the cost of locating and operating plants and warehouses, plus the cost of transporting goods at both echelons to satisfy the demand of customers. The difference of our study from the two-stage capacitated facility location problem is the existence of multiple capacity levels as a candidate for each plant i...
Detection for The Starting of The Newly Applied Mass for Successive Weighing
Danacı, Mustafa; Kalınlı, Adem (1999-09-01)
In this study, new approaches are proposed over a range of conditions with unknown loading time to determine the initial conditions and identify the explicit model parameters of successive weighing system in the early part of the transient response. When a new mass is applied to the platform, the starting of the newly applied mass is detected by modelling error approach and then predicted automatically using the Non-Linear Regression (NLR) method and the detection process is repeated for successive continuo...
Detecting queue length on urban arterials using floating car data (FCD)
Altıntaşı, Oruç; Tüydeş Yaman, Hediye; Tuncay, Kağan; Department of Civil Engineering (2018)
Accurate estimation of queue lengths whether in the approach of a signalized intersection or near a bottleneck location along an uninterrupted urban arterial is essential for better traffic management. This requires reliable traffic data, which is traditionally obtained from loop detectors, video cameras, etc. More recently, Floating Car Data (FCD) is being increasingly used as an alternative traffic data source due to its lower cost and high coverage area. Commercially available FCD is obtained from GPS eq...
Citation Formats
H. G. Gharravi, “Rectilinear interdiction problem by locating a line barrier,” M.S. - Master of Science, Middle East Technical University, 2013.
METU IIS - Integrated Information Service open@metu.edu.tr