کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5127565 | 1489054 | 2017 | 27 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Transportation-location problem with unknown number of facilities
ترجمه فارسی عنوان
مشکل حمل و نقل محل با تعداد نامساعد امکانات
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
محل حمل و نقل، تخصیص محل ظرفیت مشکل وبر چند تابع ظرفیت پذیر، فضای مستمر، طراحی شبکه توزیع، مشکل محل تسهیلات
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
چکیده انگلیسی
The traditional transportation-location problem seeks to determine the location of m new capacitated facilities in continuous space and the level of interaction between these new facilities and existing facilities to minimize the total fixed and variable costs. This paper studies a variant of the transportation-location problem where the number of new facilities is also a decision variable. The problem has practical applications for designing large distribution networks. Several non-linear mixed integer formulations are presented in order to understand the intrinsic complexity of the problem. Given that the problem is NP-hard, a decomposition heuristic (DH) and a simulated annealing-based heuristic (SA) are developed based on the mathematical structure of the problem and compared via experimentation. It is found that both heuristics find the same solution for 40 internally generated problems. Three new benchmark problems are presented and an upper bound is provided.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 112, October 2017, Pages 212-220
Journal: Computers & Industrial Engineering - Volume 112, October 2017, Pages 212-220
نویسندگان
Héctor J. Carlo, VÃctor David, Gabriela S. Salvat-Dávila,