کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10347172 | 699096 | 2012 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A planar single facility location and border crossing problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A planar single facility location and border crossing problem A planar single facility location and border crossing problem](/preview/png/10347172.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 39, Issue 12, December 2012, Pages 3156-3165
Journal: Computers & Operations Research - Volume 39, Issue 12, December 2012, Pages 3156-3165
نویسندگان
Mustafa S. Canbolat, George O. Wesolowsky,