Facility location problem: Difference between revisions
mNo edit summary |
No edit summary |
||
| Line 6: | Line 6: | ||
== Weber Problem == | == Weber Problem == | ||
The Weber Problem is a simple FLP. It is based on the premise of minimizing transportation costs from a point on a plane to various destinations, where each destination has a different associated cost per unit distance. Solving this problem is generally equivalent to finding the geometric minimum between three points with different weights. The formulation of the Weber problem is | The Weber Problem is a simple FLP. It is based on the premise of minimizing transportation costs from a point on a plane to various destinations, where each destination has a different associated cost per unit distance. Solving this problem is generally equivalent to finding the geometric minimum between three points with different weights. The formulation of the Weber problem is<sup>(1)</sup> | ||
<math>\underset{x,y}{min}\{W(x,y)=\sum_{t=1}^Nw_id_i(x,y)\}</math> | <math>\underset{x,y}{min}\{W(x,y)=\sum_{t=1}^Nw_id_i(x,y)\}</math> | ||
| Line 12: | Line 12: | ||
where | where | ||
<math>d_i=\sqrt{(x-a_i)^2+(y-b_i)^2 | <math>d_i(x,y)=\sqrt{(x-a_i)^2+(y-b_i)^2}</math> | ||
== References == | |||
# http://www.pitt.edu/~lol11/ie1079/notes/ie2079-weber-slides.pdf | |||
Revision as of 16:48, 10 November 2020
Authors: Liz Cantlebary, Lawrence Li (CHEME 6800 Fall 2020)
Stewards: Allen Yang, Fengqi You
The Facility Location Problem (FLP) is a classic optimization problem that determines the best location for a factory or warehouse to be placed based on geographical demands, facility costs, and transportation distances. However, FLP can be further broken down into capacitated and uncapacitated problems, depending on whether the facilities in question have a maximum capacity or not.
Weber Problem
The Weber Problem is a simple FLP. It is based on the premise of minimizing transportation costs from a point on a plane to various destinations, where each destination has a different associated cost per unit distance. Solving this problem is generally equivalent to finding the geometric minimum between three points with different weights. The formulation of the Weber problem is(1)
where
