1 Chapter 2 Basic Models for the Location Problem.

Slides:



Advertisements
Similar presentations
Treatments of Risks and Uncertainty in Projects The availability of partial or imperfect information about a problem leads to two new category of decision-making.
Advertisements

1 Chapter 2 Basic Models for the Location Problem.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
How Bad is Selfish Routing? By Tim Roughgarden Eva Tardos Presented by Alex Kogan.
Experimental Design, Response Surface Analysis, and Optimization
AN INTERACTIVE POSSIBILISTIC LINEAR PROGRAMMING APPROACH FOR MULTIPLE OBJECTIVE TRANSPORTATION PROBLEMS Dr. Celal Hakan Kagnicioglu, Assistant Anadolu.
S.S. Heragu Industrial Engineering Department University of Louisville
Acceptance Sampling Plans by Variables
A second order ordinary differential equation has the general form
Layout and DesignKapitel 4 / 1 (c) Prof. Richard F. Hartl QAP - different space requirements We assume departments, i.e. OE, being either rectangular shaped.
Chapter 6 Continuous Random Variables and Probability Distributions
CENTER OF GRAVITY, CENTER OF MASS AND CENTROID FOR A BODY
COMP322/S2000/L221 Relationship between part, camera, and robot (cont’d) the inverse perspective transformation which is dependent on the focal length.
Introduction to Educational Statistics
Ch 2.1: Linear Equations; Method of Integrating Factors
Chapter 5 Continuous Random Variables and Probability Distributions
Chap 6-1 Statistics for Business and Economics, 6e © 2007 Pearson Education, Inc. Chapter 6 Continuous Random Variables and Probability Distributions Statistics.
D Nagesh Kumar, IIScOptimization Methods: M3L1 1 Linear Programming Preliminaries.
Linear Programming Applications
COMPUTERIZED METHODS OF LAYOUT DESIGN
Grouped Data Calculation
Managerial Economics Managerial Economics = economic theory + mathematical eco + statistical analysis.
1 1.1 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra SYSTEMS OF LINEAR EQUATIONS.
Transportation Problem
Facility Location. Single-Facility Rectilinear Distance Location Problem Locating a new facility among n existing facilities Locating a new facility among.
1 7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to.
Probabilistic & Statistical Techniques Eng. Tamer Eshtawi First Semester Eng. Tamer Eshtawi First Semester
Chapter 4.1 Solving Systems of Linear Equations in two variables.
Yaomin Jin Design of Experiments Morris Method.
1 Chapter 2 Basic Models for the Location Problem.
Hub Location Problems Chapter 12
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Multiple Random Variables Two Discrete Random Variables –Joint pmf –Marginal pmf Two Continuous Random Variables –Joint Distribution (PDF) –Joint Density.
Linear Regression Analysis 5E Montgomery, Peck & Vining 1 Chapter 8 Indicator Variables.
Linear Equations in Two Variables A Linear Equation in Two Variables is any equation that can be written in the form where A and B are not both zero.
Problem y For the machine element shown, locate the z coordinate
Location decisions are strategic decisions. The reasons for location decisions Growth –Expand existing facilities –Add new facilities Production Cost.
ХНУРЭ,кафедра ПО ЭВМ, Тел , N.V. Bilous Факультет компьютерных наук Кафедра ПО ЭВМ, ХНУРЭ Discrete mathematics.
Facility Design-Week13 Facility Location Problem 1.
3.4 Applications of Minima and Maxima 1 Example: For a short time interval, the current i (in amperes) in a circuit containing an inductor is given by.
Algorithms for Comparing Molecule Conformations David Sehnal.
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
1 Facilities Design S.S. Heragu Industrial Engineering Department University of Louisville.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
Ch 2.1: Linear Equations; Method of Integrating Factors A linear first order ODE has the general form where f is linear in y. Examples include equations.
Stochastic Optimization
Resource Allocation in Hospital Networks Based on Green Cognitive Radios 王冉茵
Chapter # 10 Quantitative Facilities Planning Models
(i) Preliminaries D Nagesh Kumar, IISc Water Resources Planning and Management: M3L1 Linear Programming and Applications.
Example 1: The Absolute Value Function
Traffic Flow Characteristics. Dr. Attaullah Shah
Facility Location I Chapter 10
CWR 6536 Stochastic Subsurface Hydrology Optimal Estimation of Hydrologic Parameters.
S.S. Heragu Industrial Engineering Department University of Louisville
MATH 1046 Introduction to Systems of Linear Equations (Sections 2
College Algebra Chapter 6 Matrices and Determinants and Applications
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
S.S. Heragu Industrial Engineering Department University of Louisville
Chapter 2 Basic Models for the Location Problem
Chapter 2 Basic Models for the Location Problem
7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to record.
Chapter 2 Basic Models for the Location Problem
Chapter 5 Normal Probability Distributions.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Chapter 6 Network Flow Models.
Facilities Planning and Design Course code:
Numerical Computation and Optimization
Chapter 5 Continuous Random Variables and Probability Distributions
Chapter 5 Normal Probability Distributions.
QAP - different space requirements
Presentation transcript:

1 Chapter 2 Basic Models for the Location Problem

Techniques for Discrete Space Location Problems 11.3 Techniques for Discrete Space Location Problems Qualitative Analysis Quantitative Analysis Hybrid Analysis OutlineOutline

Techniques for Continuous Space Location Problems 11.4 Techniques for Continuous Space Location Problems Median Method Contour Line Method Gravity Method Weiszfeld Method Outline Cont...

Techniques For Continuous Space Location Problems

Model for Rectilinear Metric Problem Consider the following notation: f i = Traffic flow between new facility and existing facility i c i = Cost of transportation between new facility and existing facility i per unit x i, y i = Coordinate points of existing facility i

6 Model for Rectilinear Metric Problem (Cont) Where TC is the total distribution cost The median location model is then to minimize:

7 Model for Rectilinear Metric Problem (Cont) Since the c i f i product is known for each facility, it can be thought of as a weight w i corresponding to facility i.

8 Median Method: Step 1: List the existing facilities in non- decreasing order of the x coordinates. Step 2: Find the j th x coordinate in the list at which the cumulative weight equals or exceeds half the total weight for the first time, i.e.,

9 Median Method (Cont) Step 3: List the existing facilities in non- decreasing order of the y coordinates. Step 4: Find the k th y coordinate in the list (created in Step 3) at which the cumulative weight equals or exceeds half the total weight for the first time, i.e.,

10 Median Method (Cont) Step 4: Cont... The optimal location of the new facility is given by the j th x coordinate and the k th y coordinate identified in Steps 2 and 4, respectively.

11 NotesNotes 1. It can be shown that any other x or y coordinate will not be that of the optimal location’s coordinates 2. The algorithm determines the x and y coordinates of the facility’s optimal location separately 3. These coordinates could coincide with the x and y coordinates of two different existing facilities or possibly one existing facility

12 Example 5: Two high speed copiers are to be located in the fifth floor of an office complex which houses four departments of the Social Security Administration. Coordinates of the centroid of each department as well as the average number of trips made per day between each department and the copiers’ yet-to-be-determined location are known and given in Table 9 below. Assume that travel originates and ends at the centroid of each department. Determine the optimal location, i.e., x, y coordinates, for the copiers.

13 Table Centroid Coordinates and Average Number of Trips to Copiers

14 Table Dept.Coordinates Average number of #xy daily trips to copiers

15 Solution:Solution: Using the median method, we obtain the following solution: Step 1: Dept.x coordinates inWeightsCumulative #non-decreasing orderWeights

16 Solution:Solution: Step 2: Since the second x coordinate, namely 10, in the above list is where the cumulative weight equals half the total weight of 28/2 = 14, the optimal x coordinate is 10.

17 Solution:Solution: Step 3: Dept.y coordinates inWeightsCumulative #non-decreasing orderWeights

18 Solution:Solution: Step 4: Since the third y coordinates in the above list is where the cumulative weight exceeds half the total weight of 28/2 = 14, the optimal y coordinate is 6. Thus, the optimal coordinates of the new facility are (10, 6).

19 Equivalent Linear Model for the Rectilinear Distance, Single- Facility Location Problem Parameters f i = Traffic flow between new facility and existing facility i f i = Traffic flow between new facility and existing facility i c i = Unit transportation cost between new facility and existing facility i c i = Unit transportation cost between new facility and existing facility i x i, y i = Coordinate points of existing facility i x i, y i = Coordinate points of existing facility i Decision Variables x, y = Optimal coordinates of the new facility x, y = Optimal coordinates of the new facility TC = Total distribution cost TC = Total distribution cost

20 The median location model is then to Equivalent Linear Model for the Rectilinear Distance, Single- Facility Location Problem

21 Since the c i f i product is known for each facility, it can be thought of as a weight w i corresponding to facility i. The previous equation can now be rewritten as follows Equivalent Linear Model for the Rectilinear Distance, Single- Facility Location Problem

22 Equivalent Linear Model for the Rectilinear Distance, Single- Facility Location Problem

23 Equivalent Linear Model for the Rectilinear Distance, Single- Facility Location Problem

24 Equivalent Linear Model for the Rectilinear Distance, Single- Facility Location Problem