Facility location problem: Difference between revisions
Lawrenceli (talk | contribs) |
Lawrenceli (talk | contribs) No edit summary |
||
| Line 9: | Line 9: | ||
=== Weber Problem === | === Weber Problem === | ||
The Weber Problem is a simple FLP that consists of locating the geometric median between three points with different weights. The geometric median is a point between three given points in space such that the sum of the distances between the median and the other three points is minimized. It is based on the premise of minimizing transportation costs from one point to various destinations, where each destination has a different associated cost per unit distance. | The Weber Problem is a simple FLP that consists of locating the geometric median between three points with different weights. The geometric median is a point between three given points in space such that the sum of the distances between the median and the other three points is minimized. It is based on the premise of minimizing transportation costs from one point to various destinations, where each destination has a different associated cost per unit distance. | ||
'' | Given ''N'' points ''(a<sub>1</sub>, b<sub>1</sub>)...(a<sub>N</sub>, b<sub>N</sub>)'' with associated weights ''w<sub>1</sub>...w<sub>N</sub>'', the 2-dimensional Weber problem to find the geometric median ''(x,y)'' is formulated as:<sup>(1)</sup> | ||
<math>\underset{x,y}{min}\{W(x,y)=\sum_{i=1}^Nw_id_i(x,y,a_i,b_i)\}</math> | <math>\underset{x,y}{min}\{W(x,y)=\sum_{i=1}^Nw_id_i(x,y,a_i,b_i)\}</math> | ||
Revision as of 19:26, 14 November 2020
Authors: Liz Cantlebary, Lawrence Li (CHEME 6800 Fall 2020)
Stewards: Allen Yang, Fengqi You
Introduction
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. These problems generally aim to maximize the supplier's profit based on the given customer demand and location. FLP can be further broken down into capacitated and uncapacitated problems, depending on whether the facilities in question have a maximum capacity or not.
Theory and Formulation
Weber Problem
The Weber Problem is a simple FLP that consists of locating the geometric median between three points with different weights. The geometric median is a point between three given points in space such that the sum of the distances between the median and the other three points is minimized. It is based on the premise of minimizing transportation costs from one point to various destinations, where each destination has a different associated cost per unit distance.
Given N points (a1, b1)...(aN, bN) with associated weights w1...wN, the 2-dimensional Weber problem to find the geometric median (x,y) is formulated as:(1)
where
Uncapacitated and Capacitated FLPs
In an uncapacitated facility problem, the amount of product each facility can produce and transport is assumed to be unlimited, and the optimal solution results in customers being supplied by the lowest-cost, and usually the nearest, facility.
A capacitated facility problem applies constraints to the production and transportation capacity of each facility. As a result, customers may not be supplied by the most immediate facility, since this facility may not be able to satisfy the given customer demand.