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

Authors

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

DOI:

https://doi.org/10.30495/jme.v6i0.158

Keywords:

Convex, location, allocation, closed, global convergence

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.

 

Downloads

Published

2013-09-14

Issue

Section

Vol. 6, No. 3, (2012)