Chapter 2 Basic Models for the Location Problem

Slides:



Advertisements
Similar presentations
Optimization with Constraints
Advertisements

1 Chapter 2 Basic Models for the Location Problem.
10-1 Chapter 10 Facilities Layout and Location McGraw-Hill/Irwin Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved.
Chapter 5 The Simplex Method The most popular method for solving Linear Programming Problems We shall present it as an Algorithm.
S I E M E N S C O R P O R A T E R E S E A R C H 1 1 A Seeded Image Segmentation Framework Unifying Graph Cuts and Random Walker Which Yields A New Algorithm.
S.S. Heragu Industrial Engineering Department University of Louisville
Chapter Ten Facilities Layout and Location.
The Distance Formula & Equations of Circles
ISEN 601 Location Logistics Dr. Gary M. Gaukler Fall 2011.
Layout and DesignKapitel 4 / 1 (c) Prof. Richard F. Hartl QAP - different space requirements We assume departments, i.e. OE, being either rectangular shaped.
COMPUTERIZED METHODS OF LAYOUT DESIGN
1 Chapter 2 Basic Models for the Location Problem.
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
Facility Location. Single-Facility Rectilinear Distance Location Problem Locating a new facility among n existing facilities Locating a new facility among.
Facility Layout 6 MULTIPLE, Other algorithms, Department Shapes.
1 Chapter 2 Basic Models for the Location Problem.
Mathematical Models for Facility Location Prof Arun Kanda Department of Mech Engg Indian Institute of Technology, Delhi.
Chapter 3 Acceleration Lecture 1
Method of Hooke and Jeeves
Mechanical Engineering Department 1 سورة النحل (78)
Problem y For the machine element shown, locate the z coordinate
Facility Design-Week13 Facility Location Problem 1.
1 1 Location Problems John H. Vande Vate Spring 2006.
Lecture 16 - Approximation Methods CVEN 302 July 15, 2002.
1 Facilities Design S.S. Heragu Industrial Engineering Department University of Louisville.
Visualizing and Exploring Data 1. Outline 1.Introduction 2.Summarizing Data: Some Simple Examples 3.Tools for Displaying Single Variable 4.Tools for Displaying.
Chapter # 10 Quantitative Facilities Planning Models
Facility Location. Meaning facilities location problem is an important strategic level decision making for an organisation. One of the key features of.
Clustering (1) Chapter 7. Outline Introduction Clustering Strategies The Curse of Dimensionality Hierarchical k-means.
1 Chapter 5 DIFFERENCE EQUATIONS. 2 WHAT IS A DIFFERENCE EQUATION? A Difference Equation is a relation between the values y k of a function defined on.
Clustering Approaches Ka-Lok Ng Department of Bioinformatics Asia University.
Nearest-Neighbor Searching Under Uncertainty Wuzhou Zhang Joint work with Pankaj K. Agarwal, Alon Efrat, and Swaminathan Sankararaman. To appear in PODS.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Mixture Densities Maximum Likelihood Estimates.
Facility Location I Chapter 10
1 A* search Outline In this topic, we will look at the A* search algorithm: –It solves the single-source shortest path problem –Restricted to physical.
S.S. Heragu Industrial Engineering Department University of Louisville
Chapter 7. Classification and Prediction
Clustering Usman Roshan.
Neural Networks Winter-Spring 2014
Chapter 5 The Simplex Method
EXAMPLE 1 Write a cubic function
Chapter Three Part I Output Primitives CS 380.
Haim Kaplan and Uri Zwick
Accomplished by: Usmanova g.
Data Clustering Michael J. Watts
S.S. Heragu Industrial Engineering Department University of Louisville
Location Where to put facilities? Transportation costs
Chapter 2 Basic Models for the Location Problem
ISEN 601 Location Logistics
Chapter 2 Basic Models for the Location Problem
Optimization Problems
By Viput Subharngkasen
Location Where to put facilities? Transportation costs
CHAPTER 7-1 CORRELATION PROBABILITY.
(modeling of decision processes)
Quadratic Equations and Functions
5.2 Least-Squares Fit to a Straight Line
Numerical Computation and Optimization
LECTURE 21: CLUSTERING Objectives: Mixture Densities Maximum Likelihood Estimates Application to Gaussian Mixture Models k-Means Clustering Fuzzy k-Means.
Chapter 9 – Modeling Breaking Strength with Dichotomous Data
Feature Selection Methods
Limits: A Numerical and Graphical Approach
Facilities Planning and Design Course code:
Lecture 8. Learning (V): Perceptron Learning
* Henry’s Law air(1)/water(2) VLE
Differentiation Techniques: The Power and Sum-Difference Rules
Measures of Regression Prediction Interval
Numerical Analysis Lecture 24.
Clustering Usman Roshan CS 675.
QAP - different space requirements
Presentation transcript:

Chapter 2 Basic Models for the Location Problem

Outline 11.3 Techniques for Discrete Space Location Problems 11.3.1 Qualitative Analysis 11.3.2 Quantitative Analysis 11.3.3 Hybrid Analysis

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

11.4.4 Weiszfeld Method

Weiszfeld Method: The objective function for the single facility location problem with Euclidean distance can be written as: As before, substituting wi=cifi and taking the derivative of TC with respect to x and y yields

Weiszfeld Method:

Weiszfeld Method:

Weiszfeld Method:

Weiszfeld Method:

Weiszfeld Method: Step 0: Set iteration counter k = 1;

Weiszfeld Method: Step 1: Set Step 2: If xk+1 = xk and yk+1 = yk, Stop. Otherwise, set k = k + 1 and go to Step 1

Example 8: Consider Example 6. Assuming the distance metric to be used is Euclidean, determine the optimal location of the new facility using the Weiszfeld method. Data for this problem is shown in Table 11.

Table 11.17 Coordinates and weights for 4 departments

Table 11.17: Departments # xi yi wi 1 10 2 6 2 10 10 20 3 8 6 8 1 10 2 6 2 10 10 20 3 8 6 8 4 12 5 4

Solution: Using the gravity method, the initial seed can be shown to be (9.8, 7.4). With this as the starting solution, we can apply Step 1 of the Weiszfeld method repeatedly until we find that two consecutive x, y values are equal.

Summary: Methods for Single-Facility, Continuous Space Location Problems Rectilinear Squared Euclidean Euclidean Method Median Gravity Weiszfeld