|
|
|
|
A Heuristic Algorithm for Constrain Single-Source Problem with Constrained Customers
|
|
|
|
|
|
|
|
نویسنده
|
Raisi Dehkordi Ahmadreza ,Farahani Masood ,Ahmadi Abuzar
|
|
منبع
|
journal of mathematical extension - 2012 - دوره : 6 - شماره : 3 - صفحه:67 -79
|
|
چکیده
|
The fermat-weber location problem is to find a point in rⁿ that minimizes the sum of the weighted euclidean distances from m given points in rⁿ. in this paper we consider the fermat-weber problem of one new facilitiy with respect to n unknown customers in order to minimizing the sum of transportation costs between this facility and the customers. we assumed that each customer is located in a nonempty convex closed bounded subset of rⁿ
|
|
کلیدواژه
|
Convex ,location ,allocation ,closed ,global convergence
|
|
آدرس
|
university of isfahan, Department of Mathematics, ایران, university of isfahan, Department of Mathematics, ایران, university of isfahan, Department of Mathematics, ایران
|
|
پست الکترونیکی
|
abozar ahmadi@sci.ui.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|