https://optimization.mccormick.northwestern.edu/api.php?action=feedcontributions&user=Aaronlitoff&feedformat=atomoptimization - User contributions [en]2022-05-24T15:36:08ZUser contributionsMediaWiki 1.21.3https://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T04:59:18Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of fixed costs, variable costs, and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Minisum and Minimax Location Problems===<br />
<br />
Facility location problems are often formulated in one of two ways, minisum and minimax.<br />
<br />
A minisum FLP looks to place a new facility in the location that minimizes the sum of the weighted distances between the new facility and the already existing facilities. The minisum location problem is as follows: <br><br />
<br> min <math>f(x) = \sum_{i=1}^{m} w_{i}d(X,P_{i})</math> <br><br />
<br />
where <br><br />
<math>X</math> is the location of the new facility <br><br />
<math>P</math> are the locations of existing facilities <br><br />
<math>w_{i}</math> is the weight associated with traveling between the new facility and facility i <br><br />
<math>d</math> is the distance between the new facility and facility i <br><br />
<br />
The minimax FLP, by contrast, looks for the optimal location to place a facility with the goal of minimizing the maximum distance between the newly placed facility and all existing facilities.<br />
<br />
<br />
===Capacitated vs. Uncapacitated Facility Location Problems===<br />
<br />
An additional variation on the facility location problem is whether a problem is capacitated or uncapacitated. In a capacitated model the capacity of each facility is known and accounted for. This means that even if a facility is located at the least cost source for a demand node it may not be able to fully serve the demand at that node because its production is limited by its own capacity. [6]<br />
<br />
For a uncapacitated model however, the assumption is made that each facility can produce and ship unlimited quantities of the commodity under consideration. A concern when designing a manufacturing and transportation system, for example, is the rate of capacity that each factory can produce or can ship its product.<br />
<br />
===Continous vs. Discrete Facility Location Problems===<br />
<br />
Finally, in a continuous FLP the selection for the new facility can be any location within the space, whereas for a discrete FLP there are given set of choices for the facility's location.<br />
<br />
The example that follows in the next section falls into the category of a discrete, uncapacitated facility location problem because there are a given set of four possible locations and it is assumed that each store has no limit on the amount it can sell.<br />
<br />
==A Real World Example==<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.8|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[8] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5] The figure at the right demonstrates an example of how the facility location problem may be used in industry to determine the locations for natural gas transmission equipment. Another case study that has been analyzed in the literature was the determination of quantity and location of distribution centers of steel facilities in Latin America [9].<br />
<br />
<br />
[[File:Optimalbrazil.gif|thumb|none|upright=1.2|This figure gives the result after optimization for the location of steel production facilities in Brazil.[9]]]<br />
<br />
==Conclusion==<br />
Facility location problems seek to optimize the placement of facilities such that the demands of consumers can be met at the lowest cost and/or shortest distance. <br />
The minisum formulation minimizes the sum of the weighted distances between facilities while the maxisum formulation minimizes the overall maximum distance between facilities.<br />
The study of these problems has numerous applications in the fields of mathematics, economics, physics, and engineering. <br />
<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Sliva F., Serra, D. (2007) A capacitated facility location problem with constrained backlogging probabilities. International Journal of Production Research, 45 (21), pp.5117-5134.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html<br />
<br />
[8] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.<br />
<br />
[9] Conceição, S., Pedrosa, L., Neto, A., Vinagre, M., & Wolff, E. (2012). The facility location problem in the steel industry: A case study in Latin America. Production Planning & Control, 23(1), 26-46.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T04:57:56Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of fixed costs, variable costs, and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Minisum and Minimax Location Problems===<br />
<br />
Facility location problems are often formulated in one of two ways, minisum and minimax.<br />
<br />
A minisum FLP looks to place a new facility in the location that minimizes the sum of the weighted distances between the new facility and the already existing facilities. The minisum location problem is as follows: <br><br />
<br> min <math>f(x) = \sum_{i=1}^{m} w_{i}d(X,P_{i})</math> <br><br />
<br />
where <br><br />
<math>X</math> is the location of the new facility <br><br />
<math>P</math> are the locations of existing facilities <br><br />
<math>w_{i}</math> is the weight associated with traveling between the new facility and facility i <br><br />
<math>d</math> is the distance between the new facility and facility i <br><br />
<br />
The minimax FLP, by contrast, looks for the optimal location to place a facility with the goal of minimizing the maximum distance between the newly placed facility and all existing facilities.<br />
<br />
<br />
===Capacitated vs. Uncapacitated Facility Location Problems===<br />
<br />
An additional variation on the facility location problem is whether a problem is capacitated or uncapacitated. In a capacitated model the capacity of each facility is known and accounted for. This means that a even if a facility is located at the least cost source for a demand node it may not be able to fully serve the demand at that node because its production is limited by its own capacity. [6]<br />
<br />
For a uncapacitated model however, the assumption is made that each facility can produce and ship unlimited quantities of the commodity under consideration. A concern when designing a manufacturing and transportation system, for example, is the rate of capacity that each factory can produce or can ship its product.<br />
<br />
===Continous vs. Discrete Facility Location Problems===<br />
<br />
Finally, in a continuous FLP the selection for the new facility can be any location within the space, whereas for a discrete FLP there are given set of choices for the facility's location.<br />
<br />
The example that follows in the next section falls into the category of a discrete, uncapacitated facility location problem because there are a given set of four possible locations and it is assumed that each store has no limit on the amount it can sell.<br />
<br />
==A Real World Example==<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.8|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[8] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5] The figure at the right demonstrates an example of how the facility location problem may be used in industry to determine the locations for natural gas transmission equipment. Another case study that has been analyzed in the literature was the determination of quantity and location of distribution centers of steel facilities in Latin America [9].<br />
<br />
<br />
[[File:Optimalbrazil.gif|thumb|none|upright=1.2|This figure gives the result after optimization for the location of steel production facilities in Brazil.[9]]]<br />
<br />
==Conclusion==<br />
Facility location problems seek to optimize the placement of facilities such that the demands of consumers can be met at the lowest cost and/or shortest distance. <br />
The minisum formulation minimizes the sum of the weighted distances between facilities while the maxisum formulation minimizes the overall maximum distance between facilities.<br />
The study of these problems has numerous applications in the fields of mathematics, economics, physics, and engineering. <br />
<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Sliva F., Serra, D. (2007) A capacitated facility location problem with constrained backlogging probabilities. International Journal of Production Research, 45 (21), pp.5117-5134.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html<br />
<br />
[8] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.<br />
<br />
[9] Conceição, S., Pedrosa, L., Neto, A., Vinagre, M., & Wolff, E. (2012). The facility location problem in the steel industry: A case study in Latin America. Production Planning & Control, 23(1), 26-46.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T04:55:43Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Minisum and Minimax Location Problems===<br />
<br />
Facility location problems are often formulated in one of two ways, minisum and minimax.<br />
<br />
A minisum FLP looks to place a new facility in the location that minimizes the sum of the weighted distances between the new facility and the already existing facilities. The minisum location problem is as follows: <br><br />
<br> min <math>f(x) = \sum_{i=1}^{m} w_{i}d(X,P_{i})</math> <br><br />
<br />
where <br><br />
<math>X</math> is the location of the new facility <br><br />
<math>P</math> are the locations of existing facilities <br><br />
<math>w_{i}</math> is the weight associated with traveling between the new facility and facility i <br><br />
<math>d</math> is the distance between the new facility and facility i <br><br />
<br />
The minimax FLP, by contrast, looks for the optimal location to place a facility with the goal of minimizing the maximum distance between the newly placed facility and all existing facilities.<br />
<br />
<br />
===Capacitated vs. Uncapacitated Facility Location Problems===<br />
<br />
An additional variation on the facility location problem is whether a problem is capacitated or uncapacitated. In a capacitated model the capacity of each facility is known and accounted for. This means that a even if a facility is located at the least cost source for a demand node it may not be able to fully serve the demand at that node because its production is limited by its own capacity. [6]<br />
<br />
For a uncapacitated model however, the assumption is made that each facility can produce and ship unlimited quantities of the commodity under consideration. A concern when designing a manufacturing and transportation system, for example, is the rate of capacity that each factory can produce or can ship its product.<br />
<br />
===Continous vs. Discrete Facility Location Problems===<br />
<br />
Finally, in a continuous FLP the selection for the new facility can be any location within the space, whereas for a discrete FLP there are given set of choices for the facility's location.<br />
<br />
The example that follows in the next section falls into the category of a discrete, uncapacitated facility location problem because there are a given set of four possible locations and it is assumed that each store has no limit on the amount it can sell.<br />
<br />
==A Real World Example==<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.8|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[8] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5] The figure at the right demonstrates an example of how the facility location problem may be used in industry to determine the locations for natural gas transmission equipment. Another case study that has been analyzed in the literature was the determination of quantity and location of distribution centers of steel facilities in Latin America [9].<br />
<br />
<br />
[[File:Optimalbrazil.gif|thumb|none|upright=1.2|This figure gives the result after optimization for the location of steel production facilities in Brazil.[9]]]<br />
<br />
==Conclusion==<br />
Facility location problems seek to optimize the placement of facilities such that the demands of consumers can be met at the lowest cost and/or shortest distance. <br />
The minisum formulation minimizes the sum of the weighted distances between facilities while the maxisum formulation minimizes the overall maximum distance between facilities.<br />
The study of these problems has numerous applications in the fields of mathematics, economics, physics, and engineering. <br />
<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Sliva F., Serra, D. (2007) A capacitated facility location problem with constrained backlogging probabilities. International Journal of Production Research, 45 (21), pp.5117-5134.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html<br />
<br />
[8] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.<br />
<br />
[9] Conceição, S., Pedrosa, L., Neto, A., Vinagre, M., & Wolff, E. (2012). The facility location problem in the steel industry: A case study in Latin America. Production Planning & Control, 23(1), 26-46.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T04:55:10Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Minisum and Minimax Location Problems===<br />
<br />
Facility location problems are often formulated in one of two ways, minisum and minimax.<br />
<br />
A minisum FLP looks to place a new facility in the location that minimizes the sum of the weighted distances between the new facility and the already existing facilities. The minisum location problem is as follows: <br><br />
<br> min <math>f(x) = \sum_{i=1}^{m} w_{i}d(X,P_{i})</math> <br><br />
<br />
where <br><br />
<math>X</math> is the location of the new facility <br><br />
<math>P</math> are the locations of existing facilities <br><br />
<math>w_{i}</math> is the weight associated with traveling between the new facility and facility i <br><br />
<math>d</math> is the distance between the new facility and facility i <br><br />
<br />
The minimax FLP, by contrast, looks for the optimal location to place a facility with the goal of minimizing the maximum distance between the newly placed facility and all existing facilities.<br />
<br />
<br />
===Capacitated vs. Uncapacitated Facility Location Problems===<br />
<br />
An additional variation on the facility location problem is whether a problem is capacitated or uncapacitated. In a capacitated model the capacity of each facility is known and accounted for. This means that a even if a facility is located at the least cost source for a demand node it may not be able to fully serve the demand at that node because its production is limited by its own capacity. [6]<br />
<br />
For a uncapacitated model however, the assumption is made that each facility can produce and ship unlimited quantities of the commodity under consideration. A concern when designing a manufacturing and transportation system, for example, is the rate of capacity that each factory can produce or can ship its product.<br />
<br />
===Continous vs. Discrete Facility Location Problems===<br />
<br />
Finally, in a continuous FLP the selection for the new facility can be any location within the space, whereas for a discrete FLP there are given set of choices for the facility's location.<br />
<br />
The example that follows in the next section falls into the category of a discrete, uncapacitated facility location problem because there are a given set of four possible locations and it is assumed that each store has no limit on the amount it can sell.<br />
<br />
==A Real World Example==<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.7|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[8] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5] The figure at the right demonstrates an example of how the facility location problem may be used in industry to determine the locations for natural gas transmission equipment. Another case study that has been analyzed in the literature was the determination of quantity and location of distribution centers of steel facilities in Latin America [9].<br />
<br />
<br />
[[File:Optimalbrazil.gif|thumb|none|upright=1.4|This figure gives the result after optimization for the location of steel production facilities in Brazil.[9]]]<br />
<br />
==Conclusion==<br />
Facility location problems seek to optimize the placement of facilities such that the demands of consumers can be met at the lowest cost and/or shortest distance. <br />
The minisum formulation minimizes the sum of the weighted distances between facilities while the maxisum formulation minimizes the overall maximum distance between facilities.<br />
The study of these problems has numerous applications in the fields of mathematics, economics, physics, and engineering. <br />
<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Sliva F., Serra, D. (2007) A capacitated facility location problem with constrained backlogging probabilities. International Journal of Production Research, 45 (21), pp.5117-5134.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html<br />
<br />
[8] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.<br />
<br />
[9] Conceição, S., Pedrosa, L., Neto, A., Vinagre, M., & Wolff, E. (2012). The facility location problem in the steel industry: A case study in Latin America. Production Planning & Control, 23(1), 26-46.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T04:46:32Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Minisum and Minimax Location Problems===<br />
<br />
Facility location problems are often formulated in one of two ways, minisum and minimax.<br />
<br />
A minisum FLP looks to place a new facility in the location that minimizes the sum of the weighted distances between the new facility and the already existing facilities. The minisum location problem is as follows: <br><br />
<br> min <math>f(x) = \sum_{i=1}^{m} w_{i}d(X,P_{i})</math> <br><br />
<br />
where <br><br />
<math>X</math> is the location of the new facility <br><br />
<math>P</math> are the locations of existing facilities <br><br />
<math>w_{i}</math> is the weight associated with traveling between the new facility and facility i <br><br />
<math>d</math> is the distance between the new facility and facility i <br><br />
<br />
The minimax FLP, by contrast, looks for the optimal location to place a facility with the goal of minimizing the maximum distance between the newly placed facility and all existing facilities.<br />
<br />
<br />
===Capacitated vs. Uncapacitated Facility Location Problems===<br />
<br />
An additional variation on the facility location problem is whether a problem is capacitated or uncapacitated. In a capacitated model the capacity of each facility is known and accounted for. This means that a even if a facility is located at the least cost source for a demand node it may not be able to fully serve the demand at that node because its production is limited by its own capacity. [6]<br />
<br />
For a uncapacitated model however, the assumption is made that each facility can produce and ship unlimited quantities of the commodity under consideration. A concern when designing a manufacturing and transportation system, for example, is the rate of capacity that each factory can produce or can ship its product.<br />
<br />
===Continous vs. Discrete Facility Location Problems===<br />
<br />
Finally, in a continuous FLP the selection for the new facility can be any location within the space, whereas for a discrete FLP there are given set of choices for the facility's location.<br />
<br />
The example that follows in the next section falls into the category of a discrete, uncapacitated facility location problem because there are a given set of four possible locations and it is assumed that each store has no limit on the amount it can sell.<br />
<br />
==A Real World Example==<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.7|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[8] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5] The figure at the right demonstrates an example of how the facility location problem may be used in industry to determine the locations for natural gas transmission equipment. Another case study that has been analyzed in the literature was the determination of quantity and location of distribution centers of steel facilities in Latin America [9].<br />
<br />
<br />
[[File:Optimalbrazil.gif|thumb|none|upright=1.7|This figure gives the result after optimization for the location of steel production facilities in Brazil.[9]]]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Sliva F., Serra, D. (2007) A capacitated facility location problem with constrained backlogging probabilities. International Journal of Production Research, 45 (21), pp.5117-5134.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html<br />
<br />
[8] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.<br />
<br />
[9] Conceição, S., Pedrosa, L., Neto, A., Vinagre, M., & Wolff, E. (2012). The facility location problem in the steel industry: A case study in Latin America. Production Planning & Control, 23(1), 26-46.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T04:45:44Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Minisum and Minimax Location Problems===<br />
<br />
Facility location problems are often formulated in one of two ways, minisum and minimax.<br />
<br />
A minisum FLP looks to place a new facility in the location that minimizes the sum of the weighted distances between the new facility and the already existing facilities. The minisum location problem is as follows: <br><br />
<br> min <math>f(x) = \sum_{i=1}^{m} w_{i}d(X,P_{i})</math> <br><br />
<br />
where <br><br />
<math>X</math> is the location of the new facility <br><br />
<math>P</math> are the locations of existing facilities <br><br />
<math>w_{i}</math> is the weight associated with traveling between the new facility and facility i <br><br />
<math>d</math> is the distance between the new facility and facility i <br><br />
<br />
The minimax FLP, by contrast, looks for the optimal location to place a facility with the goal of minimizing the maximum distance between the newly placed facility and all existing facilities.<br />
<br />
<br />
===Capacitated vs. Uncapacitated Facility Location Problems===<br />
<br />
An additional variation on the facility location problem is whether a problem is capacitated or uncapacitated. In a capacitated model the capacity of each facility is known and accounted for. This means that a even if a facility is located at the least cost source for a demand node it may not be able to fully serve the demand at that node because its production is limited by its own capacity. [6]<br />
<br />
For a uncapacitated model however, the assumption is made that each facility can produce and ship unlimited quantities of the commodity under consideration. A concern when designing a manufacturing and transportation system, for example, is the rate of capacity that each factory can produce or can ship its product.<br />
<br />
===Continous vs. Discrete Facility Location Problems===<br />
<br />
Finally, in a continuous FLP the selection for the new facility can be any location within the space, whereas for a discrete FLP there are given set of choices for the facility's location.<br />
<br />
The example that follows in the next section falls into the category of a discrete, uncapacitated facility location problem because there are a given set of four possible locations and it is assumed that each store has no limit on the amount it can sell.<br />
<br />
==A Real World Example==<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } \textrm{Apple} i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.7|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[8] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5] The figure at the right demonstrates an example of how the facility location problem may be used in industry to determine the locations for natural gas transmission equipment. Another case study that has been analyzed in the literature was the determination of quantity and location of distribution centers of steel facilities in Latin America [9].<br />
<br />
<br />
[[File:Optimalbrazil.gif|thumb|left|upright=0.7|This figure gives the result after optimization for the location of steel production facilities in Brazil.[9]]]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Sliva F., Serra, D. (2007) A capacitated facility location problem with constrained backlogging probabilities. International Journal of Production Research, 45 (21), pp.5117-5134.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html<br />
<br />
[8] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.<br />
<br />
[9] Conceição, S., Pedrosa, L., Neto, A., Vinagre, M., & Wolff, E. (2012). The facility location problem in the steel industry: A case study in Latin America. Production Planning & Control, 23(1), 26-46.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/File:Optimalbrazil.gifFile:Optimalbrazil.gif2015-06-08T04:44:30Z<p>Aaronlitoff: </p>
<hr />
<div></div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T04:35:18Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Minisum and Minimax Location Problems===<br />
<br />
Facility location problems are often formulated in one of two ways, minisum and minimax.<br />
<br />
A minisum FLP looks to place a new facility in the location that minimizes the sum of the weighted distances between the new facility and the already existing facilities. The minisum location problem is as follows: <br><br />
<br> min <math>f(x) = \sum_{i=1}^{m} w_{i}d(X,P_{i})</math> <br><br />
<br />
where <br><br />
<math>X</math> is the location of the new facility <br><br />
<math>P</math> are the locations of existing facilities <br><br />
<math>w_{i}</math> is the weight associated with traveling between the new facility and facility i <br><br />
<math>d</math> is the distance between the new facility and facility i <br><br />
<br />
The minimax FLP, by contrast, looks for the optimal location to place a facility with the goal of minimizing the maximum distance between the newly placed facility and all existing facilities.<br />
<br />
<br />
===Capacitated vs. Uncapacitated Facility Location Problems===<br />
<br />
An additional variation on the facility location problem is whether a problem is capacitated or uncapacitated. In a capacitated model the capacity of each facility is known and accounted for. This means that a even if a facility is located at the least cost source for a demand node it may not be able to fully serve the demand at that node because its production is limited by its own capacity. [6]<br />
<br />
For a uncapacitated model however, the assumption is made that each facility can produce and ship unlimited quantities of the commodity under consideration. A concern when designing a manufacturing and transportation system, for example, is the rate of capacity that each factory can produce or can ship its product.<br />
<br />
===Continous vs. Discrete Facility Location Problems===<br />
<br />
Finally, in a continuous FLP the selection for the new facility can be any location within the space, whereas for a discrete FLP there are given set of choices for the facility's location.<br />
<br />
The example that follows in the next section falls into the category of a discrete, uncapacitated facility location problem because there are a given set of four possible locations and it is assumed that each store has no limit on the amount it can sell.<br />
<br />
==A Real World Example==<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } \textrm{Apple} i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.7|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[8] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Sliva F., Serra, D. (2007) A capacitated facility location problem with constrained backlogging probabilities. International Journal of Production Research, 45 (21), pp.5117-5134.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html<br />
<br />
[8] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T04:33:25Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Minisum and Minimax Location Problems===<br />
<br />
Facility location problems are often formulated in one of two ways, minisum and minimax.<br />
<br />
A minisum FLP looks to place a new facility in the location that minimizes the sum of the weighted distances between the new facility and the already existing facilities. The minisum location problem is as follows: <br><br />
<br> min <math>f(x) = \sum_{i=1}^{m} w_{i}d(X,P_{i})</math> <br><br />
<br />
where <br><br />
<math>X</math> is the location of the new facility <br><br />
<math>P</math> are the locations of existing facilities <br><br />
<math>w_{i}</math> is the weight associated with traveling between the new facility and facility i <br><br />
<math>d</math> is the distance between the new facility and facility i <br><br />
<br />
The minimax FLP, by contrast, looks for the optimal location to place a facility with the goal of minimizing the maximum distance between the newly placed facility and all existing facilities.<br />
<br />
<br />
===Capacitated vs. Uncapacitated Facility Location Problems===<br />
<br />
An additional variation on the facility location problem is whether a problem is capacitated or uncapacitated. In a capacitated model the capacity of each facility is known and accounted for. This means that a even if a facility is located at the least cost source for a demand node it may not be able to fully serve the demand at that node because its production is limited by its own capacity. [6]<br />
<br />
For a uncapacitated model however, the assumption is made that each facility can produce and ship unlimited quantities of the commodity under consideration. A concern when designing a manufacturing and transportation system, for example, is the rate of capacity that each factory can produce or can ship its product.<br />
<br />
===Continous vs. Discrete Facility Location Problems===<br />
<br />
Finally, in a continuous FLP the selection for the new facility can be any location within the space, whereas for a discrete FLP there are given set of choices for the facility's location.<br />
<br />
The example that follows in the next section falls into the category of a discrete, uncapacitated facility location problem because there are a given set of four possible locations and it is assumed that each store has no limit on the amount it can sell.<br />
<br />
==A Real World Example==<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } \textrm{Apple} i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.7|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[8] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Francisco F., Daniel S. (2007) A capacitated facility location problem with constrained backlogging probabilities. International Journal of Production Research, 45 (21), pp.5117-5134.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html<br />
<br />
[8] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T04:30:35Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Minisum and Minimax Location Problems===<br />
<br />
Facility location problems are often formulated in one of two ways, minisum and minimax.<br />
<br />
A minisum FLP looks to place a new facility in the location that minimizes the sum of the weighted distances between the new facility and the already existing facilities. The minisum location problem is as follows: <br><br />
<br> min <math>f(x) = \sum_{i=1}^{m} w_{i}d(X,P_{i})</math> <br><br />
<br />
where <br><br />
<math>X</math> is the location of the new facility <br><br />
<math>P</math> are the locations of existing facilities <br><br />
<math>w_{i}</math> is the weight associated with traveling between the new facility and facility i <br><br />
<math>d</math> is the distance between the new facility and facility i <br><br />
<br />
The minimax FLP, by contrast, looks for the optimal location to place a facility with the goal of minimizing the maximum distance between the newly placed facility and all existing facilities.<br />
<br />
<br />
===Capacitated vs. Uncapacitated Facility Location Problems===<br />
<br />
An additional variation on the facility location problem is whether a problem is capacitated or uncapacitated. In a capacitated model the capacity of each facility is known and accounted for. This means that a even if a facility is located at the least cost source for a demand node it may not be able to fully serve the demand at that node because its production is limited by its own capacity. [7]<br />
<br />
For a uncapacitated model however, the assumption is made that each facility can produce and ship unlimited quantities of the commodity under consideration. A concern when designing a manufacturing and transportation system, for example, is the rate of capacity that each factory can produce or can ship its product.<br />
<br />
===Continous vs. Discrete Facility Location Problems===<br />
<br />
Finally, in a continuous FLP the selection for the new facility can be any location within the space, whereas for a discrete FLP there are given set of choices for the facility's location.<br />
<br />
The example that follows in the next section falls into the category of a discrete, uncapacitated facility location problem because there are a given set of four possible locations and it is assumed that each store has no limit on the amount it can sell.<br />
<br />
==A Real World Example==<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } \textrm{Apple} i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.7|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[8]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.<br />
<br />
[7] Francisco F., Daniel S. (2007) A capacitated facility location problem with constrained backlogging probabilities. International Journal of Production Research, 45 (21), pp.5117-5134.<br />
<br />
[8] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T04:17:15Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Minisum and Minimax Location Problems===<br />
<br />
Facility location problems are often formulated in one of two ways, minisum and minimax.<br />
<br />
A minisum FLP looks to place a new facility in the location that minimizes the sum of the weighted distances between the new facility and the already existing facilities. The minisum location problem is as follows: <br><br />
<br> min <math>f(x) = \sum_{i=1}^{m} w_{i}d(X,P_{i})</math> <br><br />
<br />
where <br><br />
<math>X</math> is the location of the new facility <br><br />
<math>P</math> are the locations of existing facilities <br><br />
<math>w_{i}</math> is the weight associated with traveling between the new facility and facility i <br><br />
<math>d</math> is the distance between the new facility and facility i <br><br />
<br />
The minimax FLP, by contrast, looks for the optimal location to place a facility with the goal of minimizing the maximum distance between the newly placed facility and all existing facilities.<br />
<br />
<br />
===Capacitated vs. Uncapacitated Facility Location Problems===<br />
<br />
An additional variation on the facility location problem is whether a problem is capacitated or uncapacitated. In a capacitated model the capacity of each facility is known and accounted for. This means that a even if a facility is located at the least cost source for a demand node it may not be able to fully serve the demand at that node because it is limited by its own capacity.[]<br />
<br />
For a uncapacitated model however, the assumption is made that each facility can produce and ship unlimited quantities of the commodity under consideration<br />
<br />
A concern when designing a manufacturing system is the rate of capacity that each system can produce.<br />
<br />
http://econ.upf.edu/docs/papers/downloads/642.pdf<br />
===Continous vs. Discrete Facility Location Problems===<br />
<br />
Finally, in a continuous FLP the selection for the new facility can be any location within the space, whereas for a discrete FLP there are given set of choices for the facility's location.<br />
<br />
The example that follows in the next section falls into the category of a discrete, uncapacitated facility location problem because there are a given set of four possible locations and it is assumed that each store has no limit on the amount it can sell.<br />
<br />
==A Real World Example==<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } \textrm{Apple} i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.7|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T04:04:15Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Minisum and Minimax Location Problems===<br />
<br />
Facility location problems are often formulated in one of two ways, minisum and minimax.<br />
<br />
A minisum FLP looks to place a new facility in the location that minimizes the sum of the weighted distances between the new facility and the already existing facilities. The minisum location problem is as follows: <br><br />
<br> min <math>f(x) = \sum_{i=1}^{m} w_{i}d(X,P_{i})</math> <br><br />
<br />
where <br><br />
<math>X</math> is the location of the new facility <br><br />
<math>P</math> are the locations of existing facilities <br><br />
<math>w_{i}</math> is the weight associated with traveling between the new facility and facility i <br><br />
<math>d</math> is the distance between the new facility and facility i <br><br />
<br />
The minimax FLP, by contrast, looks for the optimal location to place a facility with the goal of minimizing the maximum distance between the newly placed facility and all existing facilities. The Minimax location problem is as follows: <br><br />
<br> <math>x=</math><br />
<br />
===Capacitated vs. Uncapacitated Facility Location Problems===<br />
<br />
An additional variation on the facility location problem is wether a problem is capacitated or uncapacitated. In an capacitate model ___ is known. For a uncapacitated model however, <br />
<br />
===Continous vs. Discrete Facility Location Problems===<br />
<br />
Finally, in a continuous FLP the selection for the new facility can be any location within the space, whereas for a dis<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
The example that follows in the next section falls into the category of a uncapacitated facility location problem because __ is known.<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } \textrm{Apple} i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.7|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:37:20Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } \textrm{Apple} i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.7|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage, and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas pipeline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:36:19Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } \textrm{Apple} i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.7|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas piepline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.<br />
<br />
[7] United States Environmental Protection Agency. (2015, May 28). Petroleum and Natural Gas Systems. http://www.epa.gov/ghgreporting/ghgdata/reported/petroleum.html</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:24:10Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.6|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } \textrm{Apple} i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=1.0]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.7|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas piepline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:22:33Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
==Introduction==<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } \textrm{Apple} i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=0.9]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.4|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas piepline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:22:14Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the basic formulation of the facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of S to D such that all customers will be serviced by a facility and such that the sum of facility costs and variable costs and transportation costs (modeled by distance) are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } \textrm{Apple} i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> <br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=0.9]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.4|This map illustrates facility locations for natural gas processing, natural gas transmission, underground natural gas storage, LNG storage and LNG import and export. The locations selected depend heavily on minimizing the distance to the nearest natural gas piepline shown in grey.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:15:18Z<p>Aaronlitoff: /* Conclusion */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=0.9]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.4|EPA of facility locations for oil and gas.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah blah<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:13:56Z<p>Aaronlitoff: /* Applications in Industry */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=0.9]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=1.4|EPA of facility locations for oil and gas.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
==Conclusion==<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:13:27Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=0.9]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=0.9|EPA of facility locations for oil and gas.[7]]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:12:07Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit. <br><br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=0.9]]<br />
<br><br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=0.9]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:11:15Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|none|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|none|upright=0.9]]<br />
<br><br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=0.9]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:09:27Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|left|upright=0.9]]<br />
<br><br />
<br />
==Applications in Industry==<br />
<br />
[[File:OilandGasFacilities.png|thumb|left|upright=0.9]]<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/File:OilandGasFacilities.pngFile:OilandGasFacilities.png2015-06-08T03:07:33Z<p>Aaronlitoff: </p>
<hr />
<div></div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:05:27Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|left|upright=0.9]]<br />
<br><br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:04:48Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables. <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|left|upright=0.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:03:59Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> In total, the model can be given as: <br><br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:03:28Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
<br> In total, the model can be given as: <br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:02:51Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
In total, the model can be given as: <br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:01:59Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math>. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
In total, the model can be given as: <br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables <br><br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T03:00:25Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} =</math><br />
<br />
<br />
<br />
[[File:x21.png|350px|]]. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> and the total capital needed is: <math>8y_{1}+7y_{2}+5y_{3}+9y_{4}</math><br><br />
<br />
In total, the model can be given as: <br> max <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math><br><br />
subject to <math>8y_{1}+7y_{2}+5y_{3}+9y_{4} \leq 16</math> <br><br />
where <math>y_{1}, y_{2}, y_{3}, y_{4}</math> are binary variables <br><br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
<math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math><br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:53:37Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} =</math><br />
<br />
<br />
<br />
[[File:x21.png|350px|]]. <br> Then the total expected benefit is: <math>10y_{1}+9y_{2}+6y_{3}+12y_{4}</math> <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
<math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math><br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:49:50Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} =\begin{Bmatrix} 1 \textup{ if Apple store } i \textup{ should be built} \\ 0 \textup{ if not}\end{Bmatrix}</math><br />
<br />
<br />
<br />
[[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
<math>y_{i} = \begin{Bmatrix}<br />
1 \textrm{ if Apple store } i \textrm{ should be built }\\ <br />
<br />
0 \textrm{ if not}\end{Bmatrix}</math><br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:48:39Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} =\begin{Bmatrix} 1 \textup{ if Apple store } i \textup{ should be built} \\ 0 \textup{ if not}\end{Bmatrix}</math><br />
<br />
<br />
<br />
[[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
<math>y_{i} = \begin{Bmatrix}<br />
11\\ <br />
<br />
11\end{Bmatrix}</math><br />
<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:48:09Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} =\begin{Bmatrix} 1 \textup{ if Apple store } i \textup{ should be built} \\ 0 \textup{ if not}\end{Bmatrix}</math><br />
<br />
<br />
<br />
[[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
<math>y_{i} = \begin{Bmatrix}<br />
11\\ <br />
<br />
11\end{Bmatrix}</math><br />
<br />
<br />
<br />
<math>\textrm{testing}</math><br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:47:25Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} =\begin{Bmatrix} 1 \textup{ if Apple store } i \textup{ should be built} \\ 0 \textup{ if not}\end{Bmatrix}</math><br />
<br />
<br />
<br />
[[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
<math>y_{i} = \begin{Bmatrix}<br />
11\\ <br />
<br />
11\end{Bmatrix}</math><br />
<br />
<br />
<br />
<math>\textup{test}</math><br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:46:55Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} =\begin{Bmatrix} 1 \textup{ if Apple store } i \textup{ should be built} \\ 0 \textup{ if not}\end{Bmatrix}</math><br />
<br />
<br />
<br />
[[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
<math>y_{i} = \begin{Bmatrix}<br />
11\\ <br />
<br />
11\end{Bmatrix}</math><br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:46:07Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} =\begin{Bmatrix} 1 \textup{ if Apple store } i \textup{ should be built} \\ 0 \textup{ if not}\end{Bmatrix}</math><br />
<br />
<br />
<br />
[[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
<br />
<math>y_{i} = \begin{Bmatrix} 1 \textup{ if Apple store } i \textup{ should be built} \\ 0 \textup{ if not}<br />
\end{Bmatrix}</math><br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:44:56Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that <math>y_{i} =\begin{Bmatrix} 1 \textup{ if Apple store } i \textup{ should be built} \\ 0 \textup{ if not}\end{Bmatrix}</math><br />
<br />
<br />
<br />
[[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:41:44Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables <math>i=1,2,3,4 </math> such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:39:54Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=3.7|]]<br />
<br />
<br> Define decision variables i=1,2,3,4 such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:39:41Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|top|upright=2.7|]]<br />
<br />
<br> Define decision variables i=1,2,3,4 such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:39:11Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
<br />
<br />
[[File:AppleModel.png|thumb|left|bottom|upright=0.7|]]<br />
<br />
<br> Define decision variables i=1,2,3,4 such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:38:35Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
[[Image:AppleModel.png|left|frame|]]<br />
<br />
[[File:AppleModel.png|thumb|left|baseline|Size|]]<br />
<br />
<br> Define decision variables i=1,2,3,4 such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:35:48Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
[[Image:AppleModel.png|left|frame|]]<br />
<br />
<br />
<br> Define decision variables i=1,2,3,4 such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:33:12Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
[[File:AppleModel.png|left|upright=0.6|]]<br />
<br />
<br> Define decision variables i=1,2,3,4 such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:32:54Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
[[File:AppleModel.png|left|upright=2.6|]]<br />
<br />
<br> Define decision variables i=1,2,3,4 such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:32:23Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
[[File:AppleModel.png|thumb|left|upright=2.6|]] <br> <br><br><br><br><br />
<br />
<br> Define decision variables i=1,2,3,4 such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:32:04Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
[[File:AppleModel.png|thumb|left|upright=2.6|]] <br> <br><br />
<br />
<br> Define decision variables i=1,2,3,4 such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:31:37Z<p>Aaronlitoff: /* A Real World Example */</p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one, and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
[[File:AppleModel.png|thumb|left|upright=2.6|]] <br> <br><br />
<br />
Define decision variables i=1,2,3,4 such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoffhttps://optimization.mccormick.northwestern.edu/index.php/Facility_location_problemsFacility location problems2015-06-08T02:29:36Z<p>Aaronlitoff: </p>
<hr />
<div>Author: Aaron Litoff <br/><br />
Stewards: Dajun Yue and Fengqi You<br />
<br />
[[File:weber.jpg|thumb|right|upright=1.2|German economist Alfred Weber (1868-1958).]]<br />
<br />
<br />
Facility location problems deal with selecting the placement of a facility (often from a list of integer possibilities) to best meet the demanded constraints. The problem often consists of selecting a factory location that minimizes total weighted distances from suppliers and customers, where weights are representative of the difficulty of transporting materials. The solution to this problem gives the highest profit choice that most efficiently serves the needs of all consumers.<br />
<br />
==Background and History==<br />
<br />
The Fermat-Weber problem was one of the first facility location problems every proposed, and was done so as early as the 17th century. This "geometric median of three points" can be thought of as a version of the facility location problem where the assumption is made that transportation costs per distance are the same for all destinations. It was put forth by the French mathematician Pierre de Fermat to the Italian physicist Evangelista Torricelli as follows:<br />
<br />
"''Given three points in a plane, find a fourth point such that the sum of its distances to the three given points is as small as possible.''" [1]<br />
<br />
In 1909 Alfred Weber used a three point version to model possible industrial locations in order to minimize transportation costs from two sources of materials to a single customer or market. [2] This formulation is one the simplest continuous facility location models.<br />
<br />
<br />
[[File:FermatPoints_700.gif|frame|none|alt=Alt text|The Fermat Point, or Torricelli Point, is the solution that minimizes distances from A, B, and C (the three corners of the black triangle).[3]]]<br />
<br />
<br><br />
<br />
The Fermat-Weber problem is defined as: <br><br />
Given finitely many distinct points <math>A_{1}, A_{2}, ..., A_{m}</math> and positive multipliers <math>w_{1}, w_{2}, ..., w_{m}</math> find a point <math>P \in \mathbb{R}^{n}</math> that minimizes<br />
<br />
<math>f(P)= \sum_{i=1}^{m} w_{i} \left \| P-A_{i} \right \|</math><br />
<br />
where <math>\left \| X \right \| </math> denotes the Euclidean norm of <math>X \in \mathbb{R}^{n}</math> i.e. <math>\left \| (x_{1},..,x_{n}) \right \| = \sqrt{x_{1}^{2}+...+x_{n}^2}</math><br />
<br />
The simplest version of this problem with all w=1 and n=2 gives the minimum distance in a flat plane.<br />
<br />
<br />
A modern day engineering interpretation of Fermat's formulation could be as follows:<br><br />
"''Find the best location for a refining plant between three cities in such a way that the sum of the connections between the plant and the cities in minimal.''"<br />
<br />
Although this problem was first solved geometrically by Torricelli in 1645 it did not have a direct numerical solution until Kuhn and Kuenne's iterative method was published over 300 years later in 1962! [4]<br />
<br />
==Description and Formulation==<br />
<br />
<br />
In the uncapacitated facility location problem, the number of possible locations is now finite as we have discrete choices of where to build. These choices are governed by binary decision variables y. <br />
<br />
The problem is often defined as a set of customers D, a set of facilities F, a fixed cost for opening each facility, and a variable cost for each facility. We are looking for the subset S of facilities that we should open and an assignment of D to S customers that will be serviced by each facility such that the sum of facility costs and variable costs are minimized. [5] <br />
<br />
These problems have been studied extensively in the literature and are often solved using an approximation algorithm. The approximation algorithm looks for a feasible solution where: <br><br />
<br />
<br>A: The algorithm will stop after a given number of steps (e.g. number of customers and facilities)<br />
<br>B: There is an approximation ratio such that the calculated solution is within some small amount of the optimal solution<br />
[5]<br />
<br />
<br />
In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.<br />
<br />
===Capacitated and Uncapacitated Facility Location Problem===<br />
<br />
A description here<br />
<br />
<br />
<br />
Another concern when designing and operating a manufacturing system is the<br />
capacity the system tolerates: given the processing facilities, what is the maximum rate<br />
of order receipt that can be accepted so that all the orders can be satisfied? The<br />
Capacitated Facility Location Problem (CFLP) is a variant of the FLP, which includes<br />
capacities for the facilities. With the inclusion of the capacities, an open facility that is<br />
the least cost source for a demand node may not be able to serve any of the demand at<br />
that node. <br />
<br />
<br />
<br />
<br />
==A Real World Example==<br />
<br />
<br />
<br />
Suppose you are a manager at Apple and you are identifying locations to sell computers and iPhones in a new location in Chicago. You would start by identifying potential sites in a variety of neighborhoods throughout the city and finding the demand for Apple products in each neighborhood. Then to construct your model you could create a table of neighborhoods, the cost of building a new Apple store in each one and the expected profit. Your goal now is to select which facilities should be built in order to maximize profit.<br />
<br />
For example: <br />
<br />
[[File:AppleModel.png|thumb|center|upright=2.6|]] <br> <br><br />
<br />
Define decision variables i=1,2,3,4 such that [[File:x21.png|350px|]]. <br> Then the total expected benefit is: [[File:x22.png|250px|]] <br> and the total capital needed is: [[File:x23.png|200px|]]<br><br />
<br />
In total, the model can be given as: <br> [[File:x24.png|350px|]]<br><br />
<br />
<br />
Additional constrains are that the total available capital is $16M, and the number of new stores should not be more than two. Solving this model using an MILP solver in GAMS gives us the maximum when y2=y4=1. This indicates that the Logan Square and Hyde Park Apple stores should both be built in order to maximize profit.<br />
<br />
Note that in another formulation of this problem you could minimize distance for customers to travel to the store regardless of profit.<br />
<br />
<br />
[[File:ChicagoApple.png|thumb|right|upright=2.8]]<br />
<br />
==Applications in Industry==<br />
<br />
Facility location problems have applications in a wide variety of fields and projects. As examined it can be used to find the optimal location for a store, plant, warehouse, etc. but these formulation methods can also be used is less obvious ways. Applications range from public policy (e.g. locating police officers in a city), telecommunications (e.g. cell towers in a network), and even particle physics (e.g. separation distance between repulsive charges).[6] All of these problems have in common that discrete locations must be chosen and the objective is to meet the demand of consumers or users in the most efficient way. [5]<br />
<br />
<br />
==Conclusion==<br />
<br />
==References==<br />
<br />
<br />
[1] Dorrie, H. (1965) 100 great problems of elementary mathematics: their history and solution. New York, NY: Dover Publications.<br />
<br />
[2] Drezner, Z & Hamacher. H. W. (2004). Facility location: applications and theory. New York, NY: Springer.<br />
<br />
[3] Weisstein, E. W. Fermat Points. Mathworld-- A wolfram web resource. http://mathworld.wolfram.com/FermatPoints.html<br />
<br />
[4] Kuhn, H. W. and Kuenne, R. E. (1962). An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. Journal of Regional Science, 4.<br />
<br />
[5] Vygen, J. (2005). Approximation algorithms for facility location problems. Bonn, Germany: Research Institute for Discrete Mathematics.<br />
<br />
[6] Korupolu, M. R. & Plaxton, G. C. & Rajaraman, R. (2000). Analysis of a local search heuristic for facility location problems.</div>Aaronlitoff