A Heuristic Algorithm for Constrain Single-Source Problem with Constrained Customers
Year: 2012
Type: article
Abstract: The Fermat-Weber location problem is to find a point in R n that minimizes the sum of the weighted Euclidean distances from m given points in R n . 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 n .
Authors: S. A. Raisi Dehkordi, M. Farahani, A. Ahmadi
Institution: University of Isfahan
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W1721266102
