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

S. A. Raisi Dehkordi, M. Farahani, A. Ahmadi

Abstract


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.

 


Keywords


Convex, location, allocation, closed, global convergence

Full Text: PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.