A Heuristic Algorithm for Constrain Single-Source Problem with Constrained Customers
The Fermat-Weber location problem is to find a point in R n that minimizes the sum of the weighted Euclidean distances from mgiven points inRn. In this paper we consider the Fermat-Weber problemof one new facilitiy with respect ton unknown customers in order tominimizing the sum of transportation costs between this facility andthecustomers. We assumed that each customer is located in a nonemptyconvex closed bounded subset ofRn.
Convex , location , allocation , closed , global convergence
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.