کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
473362 | 698787 | 2012 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A computational study of a nonlinear minsum facility location problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A computational study of a nonlinear minsum facility location problem A computational study of a nonlinear minsum facility location problem](/preview/png/473362.png)
چکیده انگلیسی
A discrete location problem with nonlinear objective is addressed. A set of p plants is to be open to serve a given set of clients. Together with the locations, the number p of facilities is also a decision variable. The objective is to minimize the total cost, represented as the transportation cost between clients and plants, plus an increasing nonlinear function of p.Two Lagrangean relaxations are considered to derive lower bounds. Dual information is also used to design a core heuristic.Computational results are given, showing that nearly optimal solutions are obtained in short running times.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 39, Issue 11, November 2012, Pages 2625–2633
Journal: Computers & Operations Research - Volume 39, Issue 11, November 2012, Pages 2625–2633
نویسندگان
Emilio Carrizosa, Anton Ushakov, Igor Vasilyev,