کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5082214 1477637 2008 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Branch and bound algorithm for a facility location problem with concave site dependent costs
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
Branch and bound algorithm for a facility location problem with concave site dependent costs
چکیده انگلیسی

The purpose of facility location models is to select a set of facilities (warehouses, plants, public facilities, antennas, etc.) to be implanted over a given area in order to satisfy the needs of all or part of the customers within this area. In this paper, the objective is to minimize the sum of the costs of investment, production and distribution while satisfying all customers' demands. We introduce a new type of facility location model, in which the global cost incurred for each established facility is a concave function of the quantity q delivered by this facility. We introduce some properties of an optimal solution and derive heuristic algorithms and a branch and bound method from these properties. Numerical examples illustrate this approach.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 112, Issue 1, March 2008, Pages 245-254
نویسندگان
,