A BSSS algorithm for the single facility location problem in two regions with different norms
Year
: 2008
Abstract: Suppose the plane is divided by a straight line into two regions with different norms. We want to find the location of a
single new facility such that the sum of the distances from the existing facilities to this point is minimized. This is in fact a
non-convex optimization problem. The main difficulty is caused by finding the distances between points on different sides
of the boundary line. In this paper we present a closed form solution for finding these distances. We also show that the
optimal solution lies in the rectangular hull of the existing points. Based on these findings then, an efficient big square small
square (BSSS) procedure is proposed.
single new facility such that the sum of the distances from the existing facilities to this point is minimized. This is in fact a
non-convex optimization problem. The main difficulty is caused by finding the distances between points on different sides
of the boundary line. In this paper we present a closed form solution for finding these distances. We also show that the
optimal solution lies in the rectangular hull of the existing points. Based on these findings then, an efficient big square small
square (BSSS) procedure is proposed.
Keyword(s): Continuous location
Single facility
branch and bound
global optimization
Collections
:
-
Statistics
A BSSS algorithm for the single facility location problem in two regions with different norms
Show full item record
| contributor author | حسین تقی زاده کاخکی | en |
| contributor author | j. Brimberg | en |
| contributor author | G.O. Wesolowsky | en |
| contributor author | Hossein Taghizadeh Kakhki | fa |
| date accessioned | 2020-06-06T13:38:59Z | |
| date available | 2020-06-06T13:38:59Z | |
| date issued | 2008 | |
| identifier uri | http://libsearch.um.ac.ir:80/fum/handle/fum/3363486 | |
| description abstract | Suppose the plane is divided by a straight line into two regions with different norms. We want to find the location of a single new facility such that the sum of the distances from the existing facilities to this point is minimized. This is in fact a non-convex optimization problem. The main difficulty is caused by finding the distances between points on different sides of the boundary line. In this paper we present a closed form solution for finding these distances. We also show that the optimal solution lies in the rectangular hull of the existing points. Based on these findings then, an efficient big square small square (BSSS) procedure is proposed. | en |
| language | English | |
| title | A BSSS algorithm for the single facility location problem in two regions with different norms | en |
| type | Journal Paper | |
| contenttype | External Fulltext | |
| subject keywords | Continuous location Single facility branch and bound global optimization | en |
| journal title | European Journal of Operational Research | en |
| journal title | European Journal of Operational Research | fa |
| pages | 79-89 | |
| journal volume | 190 | |
| journal issue | 0 | |
| identifier link | https://profdoc.um.ac.ir/paper-abstract-1006774.html | |
| identifier articleid | 1006774 |