A Heuristic Algorithm for Constrain Single-Source Problem with Constrained Customers

The Fermat-Weber location problem is to find a point in Rn that minimizes the sum of the weighted Euclidean distances from m given points in Rn. 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 Rn.