Undesirable and semi-desirable facility location problems

Download

index.pdf

Date

2004

Author

Nadirler, Deniz

Metadata

Show full item record

Item Usage Stats

119
views

59
downloads

In this thesis, single undesirable and semi-desirable facility location problems are analyzed in a continuous planar region considering the interaction between the facility and the existing demand points. In both problems, the distance between the facility and the demand points is measured with the rectilinear metric. The aim in the first part where the location of a pure undesirable facility is considered, is to maximize the distance of the facility from the closest demand point. In the second part, where the location of a semi-desirable facility is considered, a conflicting objective measuring the service cost of the facility is added to the problem of the first part. For the solution of the first problem, a mixed integer programming model is used. In order to increase the solution efficiency of the model, new branch and bound strategies and bounding schemes are suggested. In addition, a geometrical method is presented which is based on upper and lower bounds. For the biobjective problem, a three-phase interactive geometrical branch and bound algorithm is suggested to find the most preferred efficient solution.

Subject Keywords

Mathematical analysis.

URI

http://etd.lib.metu.edu.tr/upload/12605244/index.pdf
https://hdl.handle.net/11511/14297

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Solution to multi-objective hub location problem using evolutionary algorithms-an application to ptt network Çamlar, Onur; Sepil, Canan; Department of Industrial Engineering (2005) In this study, we consider the hub location problem of PTT, first realized by Cetiner (2003), and propose the evaluation of multiple decision criteria while locating hubs. Since the mathematical model for the problem is too large to be solved, we utilize heuristic methods in the solution procedure. While doing this, we first test two algorithms, NSGA-II and SPEA2, on different hub location problems and use the algorithm with better performance while solving the PTT problem.
An interactive solution approach for a bi-objective semi-desirable location problem Karasakal, Esra (Springer Science and Business Media LLC, 2008-10-01) In this study, we consider a semi-desirable facility location problem in a continuous planar region considering the interaction between the facility and the existing demand points. A facility can be defined as semi-desirable if it has both undesirable and desirable effects to the people living in the vicinity. Our aim is to maximize the weighted distance of the facility from the closest demand point as well as to minimize the service cost of the facility. The distance between the facility and the demand poi...
Precision measurement of the structure of the CMS inner tracking system using nuclear interactions Sirunyan, A. M.; et. al. (IOP Publishing, 2018-10-01) The structure of the CMS inner tracking system has been studied using nuclear interactions of hadrons striking its material. Data from proton-proton collisions at a center-of-mass energy of 13 TeV recorded in 2015 at the LHC are used to reconstruct millions of secondary vertices from these nuclear interactions. Precise positions of the beam pipe and the inner tracking system elements, such as the pixel detector support tube, and barrel pixel detector inner shield and support rails, are determined using thes...
Optimal air defense strategies for naval task group Karasakal, Orhan; Özdemirel, Nur Evin; Department of Industrial Engineering (2004) We develop solution methods for the air defense problem of a naval task group in this dissertation. We consider two interdependent problems. The first problem is the optimal allocation of a set of defensive missile systems of a naval task group to a set of attacking air targets. We call this problem the Missile Allocation Problem (MAP). The second problem called the Sector Allocation Problem (SAP) is the determination of a robust air defense formation for a naval task group by locating ships in predefined s...
Optimal Control of Diffusion Convection Reaction Equations Using Upwind Symmetric Interior Penalty Galerkin SIPG Method Karasözen, Bülent; Yücel, Hamdullah (2012-05-01) We discuss the numerical solution of linear quadratic optimal control problem with distributed and Robin boundary controls governed by diffusion convection reaction equations. The discretization is based on the upwind symmetric interior penalty Galerkin (SIPG) methods which lead to the same discrete scheme for the optimize-then-discretize and the discretize-then-optimize.

Citation Formats

D. Nadirler, “Undesirable and semi-desirable facility location problems,” M.S. - Master of Science, Middle East Technical University, 2004.