.png){kind=icon}
.png){kind=icon}
Return
A planar single facility location and border crossing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2012.04.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this study, we tackle the problem of locating a facility in a region where a fixed line barrier divides the region into two. The resulting subregions communicate with each other through a number of passage points located on the line barrier. Our contribution is threefold. First, we formulate the problem as a Mixed Integer Nonlinear Programming (MINLP) model and provide an optimal solution methodology based on an Outer Approximation (OA) algorithm. Second, we discuss the minimax version of this problem for locating an emergency facility and use the OA algorithm to solve the problem. We then provide simple example problems and extensive computational results for both problems. Finally, we propose a one-infinity approximation approach for the latter problem which yields a linear model. Practical uses of the models have been discussed in the border crossing context. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Planar facility location
Barriers to travel
Passage points
Border crossing
Optimization
Mixed integer nonlinear programming
Outer approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W