Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances

Date

2020-03-01

Author

DOLU HASTÜRK, NAZLI
HASTÜRK, UMUR
Tural, Mustafa Kemal

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

268
views

0
downloads

We study a facility location problem where a single facility serves multiple customers each represented by a (possibly non-convex) region in the plane. The aim of the problem is to locate a single facility in the plane so that the maximum of the closest Euclidean distances between the facility and the customer regions is minimized. Assuming that each customer region is mixed-integer second order cone representable, we firstly give a mixed-integer second order cone programming formulation of the problem. Secondly, we consider a solution method based on the Minkowski sums of sets. Both of these solution methods are extended to the constrained case in which the facility is to be located on a (possibly non-convex) subset of the plane. Finally, these two methods are compared in terms of solution quality and time with extensive computational experiments.

Subject Keywords

Control and Optimization, Applied Mathematics, Computational Mathematics

URI

https://hdl.handle.net/11511/38619

Journal

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS

DOI

https://doi.org/10.1007/s10589-019-00163-0

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

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...
Solution approaches for single-source capacitated multi facility weber problem Damgacıoğlu, Haluk; İyigün, Cem; Department of Industrial Engineering (2014) Single Source Capacitated Multi Facility Location Problem (SSCMFLP) is a continuous location-allocation problem such that determining the locations of p facilities in the plane and allocations of n demand points to only one facility by considering the capacity restriction of each facility so as to minimize total transportation cost to satisfy n demand points from p facilities. In addition to Mixed Integer Non-Linear Programming formulation of the problem in the literature, we give a new formulation for the ...
Nonlocal operators with local boundary conditions in higher dimensions Aksoylu, Burak; Celiker, Fatih; Kilicer, Orsan (Springer Science and Business Media LLC, 2019-02-01) We present novel nonlocal governing operators in 2D/3D for wave propagation and diffusion. The operators are inspired by peridynamics. They agree with the original peridynamics operator in the bulk of the domain and simultaneously enforce local boundary conditions (BC). The main ingredients are periodic, antiperiodic, and mixed extensions of separable kernel functions together with even and odd parts of bivariate functions on rectangular/box domains. The operators are bounded and self-adjoint. We present al...
A Multi-level continuous minimax location problem with regional demand Faridyahyaei, Amin; Tural, Mustafa Kemal; Department of Industrial Engineering (2017) The minimax facility location problem seeks for the optimal locations of the facilities in the plane so that the maximum Euclidean distance between the demanding entities (given points in the plane) and their corresponding nearest facilities is minimized. In the solutions, remote entities (irrespective of their weights) tend to pull the facilities toward themselves which may result in larger distances for the other entities. In this thesis, we consider a multi-level minimax location problem which allows som...
Solution of magnetohydrodynamic flow problems using the boundary element method Tezer, Münevver (Elsevier BV, 2006-05-01) A boundary element solution is implemented for magnetohydrodynamic (MHD) flow problem in ducts with several geometrical cross-section with insulating walls when a uniform magnetic field is imposed perpendicular to the flow direction. The coupled velocity and induced magnetic field equations are first transformed into uncoupled inhomogeneous convection-diffusion type equations. After introducing particular solutions, only the homogeneous equations are solved by using boundary element method (BEM). The fundam...

Citation Formats

N. DOLU HASTÜRK, U. HASTÜRK, and M. K. Tural, “Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances,” COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, pp. 537–560, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38619.