1 utdallas.edu/~metin SC Design Facility Location Models.

Slides:



Advertisements
Similar presentations
Facility Location Decisions
Advertisements

1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
Transportation Problem and Related Topics. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics There are 3 plants, 3 warehouses.
BA 452 Lesson B.3 Integer Programming 11ReadingsReadings Chapter 7 Integer Linear Programming.
Logistics Network Configuration
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Chapter 10, Part A Distribution and Network Models
Transportation, Assignment, and Transshipment Problems
Transportation, Transshipment and Assignment Models and Assignment Models.
6-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Transportation, Transshipment, and Assignment Problems Chapter 6.
Network Design in the Supply Chain
Aggregate Planning.
Operations Management Linear Programming Module B - Part 2
ISEN 601 Location Logistics Dr. Gary M. Gaukler Fall 2011.
Linear Programming Example 5 Transportation Problem.
ISEN 601 Location Logistics Dr. Gary M. Gaukler Fall 2011.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Transportation Problems Dr. Ron Tibben-Lembke. Transportation Problems Linear programming is good at solving problems with zillions of options, and finding.
Supply Chain Management Lecture 8. Outline Today –Chapter 5 Skipping sections –Locating to Split the Market (3e: p. 120, 4e: p. 112) –Gravity Location.
1 utdallas.edu/~metin SC Design Facility Location under Uncertainty Chapter 6.
Network Flows Based on the book: Introduction to Management Science. Hillier & Hillier. McGraw-Hill.
1 IES 371 Engineering Management Chapter 10: Location Week 11 August 17, 2005 Objectives  Identify the factors affecting location choices  Explain how.
OM 888 Supply Chain Modeling and Analysis
Chapter 5 Network Design in a Supply Chain
© 2004 Prentice-Hall, Inc. Chapter 5 Network Design in the Supply Chain Supply Chain Management (2nd Edition) 5-1.
Linear Programming Chapter 13 Supplement.
Kerimcan OzcanMNGT 379 Operations Research1 Transportation, Assignment, and Transshipment Problems Chapter 7.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Designing the Supply Chain Network
© 2007 Pearson Education Chapter 5 Network Design in the Supply Chain Supply Chain Management (3rd Edition) 5-1.
Design in the Supply Chain Spring, 2014 Supply Chain Management: Strategy, Planning, and Operation Chapter 5 Byung-Hyun Ha.
Supply Chain Management
Lecture 2 Chapter 10 continued…. Last Lecture Summary: Covered Sec and most part of Sec Basic concepts of Linear Programming Problem and.
OPSM 301 Operations Management Class 21: Logistic Drivers: Facilities and Transportation Koç University Zeynep Aksin
1 Minimum Cost Flows Goal: Minimize costs to meet all demands in a network subject to capacities (combines elements of both shortest path and max flow.
0 A Toy Production Problem  How many units to produce from each product type in order to maximize the profit? ProductMan-PowerMachineProfit Type A3 h1.
Chapter 7 Transportation, Assignment, and Transshipment Problems
CHAPTER EIGHT LOCATION PLANNING AND ANALYSIS Chapter 8 Location Planning and Analysis.
Location planning and analysis
Transportation Problems Dr. Ron Lembke. Transportation Problems Linear programming is good at solving problems with zillions of options, and finding the.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
© Anita Lee-Post Facility Location Part 1 by Anita Lee-Post.
Arben Asllani University of Tennessee at Chattanooga Prescriptive Analytics CHAPTER 7 Business Analytics with Shipment Models Business Analytics with Management.
Location decisions are strategic decisions. The reasons for location decisions Growth –Expand existing facilities –Add new facilities Production Cost.
8.  Network operation planning  Network design problems  Network design and operations models: extension  Data for network design  Strategic role.
Business Mathematics MTH-367 Lecture 13. Chapter 10 Linear Programming An Introduction Continued…
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
In some cases, the waste generated by the production of material at a facility must be disposed of at special waste disposal locations. We need to identify.
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
NETWORK CONFIGURATION (Merancang Jaringan Supply Chain) Dira Ernawati,ST.MT Jur.Teknik Industri – UPN “Veteran” Surabaya.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
3-1 Chapter 3: Network Planning CMB 8050 Matthew J. Liberatore.
Introduction to Integer Programming Integer programming models Thursday, April 4 Handouts: Lecture Notes.
Transportation and Distribution Planning Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Techologies.
References: Supply Chain Saves the World. Boston, MA: AMR Research (2006); Supply Chain Management Strategy, Planning and Operation; S. Chopra and P. Meindl;
Importance of Location 1.Accounting which prepares cost estimates for changing locations as well as operating at new locations. 2.Distribution which seeks.
Chapter 5 Network Design in the Supply Chain
SCM-655: Global Supply Operations Strategy Summer 2016
Chapter 5 Network Design in the Supply Chain
Transportation Problems
The Transportation Model
Chapter 5 Network Design in the Supply Chain
Facility Location Part 1
Chapter 5 Transportation, Assignment, and Transshipment Problems
Demand Allocation Example
OUTLINE Questions? Comments? Quiz Results Return Quiz Chapter 5.
IE 8580 Module 2: Transportation in the Supply Chain
Linear Programming.
Presentation transcript:

1 utdallas.edu/~metin SC Design Facility Location Models

2 utdallas.edu/~metin Analytical Models for SC Design –Public sector deals with fairness and equity: minimizes the distance to the furthest customer –Location of emergency response units u Demand allocation »Distance vs. Price vs. Quality: Recall Hotelling model u Demand pattern over a geography: Discrete vs. Continuous u Distances »Euclidean vs. Rectilinear »Triangular inequality u Objective functions –Private sector deals with total costs: minimizes the sum of the distances to the customers Customer 1 Customers 2-10 Public sector locates Private sector locates

3 utdallas.edu/~metin Network Optimization Models u Allocating demand to production facilities u Locating facilities u Determining capacity – some in aggregate planning module Key Costs: Fixed facility cost Transportation cost Production cost

4 utdallas.edu/~metin A transportation network Defined by data K, D and c D2D2 m demand points/markets D4D4 D3D3 D1D1 n supply points/plants K1K1 K2K2 K3K3 c 11 c 12 c 14 c 22 c 23 c 31 c 32 c 34

5 utdallas.edu/~metin Demand Allocation Model: Transportation Problem Which market is served by which plant? Which supply sources are used by a plant? Given m demand points, j=1..m with demands D j Given n supply points, i=1..n with capacity K i Each unit of shipment from supply point i to demand point j costs c ij Send supplies from supply points to demand points x ij = Quantity shipped from plant site i to customer j Objective Constraints Decision Variables

6 utdallas.edu/~metin A transportation network Defined by data K, D, c and f m demand points D4D4 D3D3 D2D2 D1D1 n supply points f 1,K 1 f 2,K 2 f 3,K 3 c 11 c 12 c 14 c 22 c 23 c 31 c 32 c 34 Which supply point operates? y 1 =yes or no y 2 =yes or no y 3 =yes or no

7 utdallas.edu/~metin Plant Location with Multiple Sourcing Which market is served by which plant? Which supply sources are used by a plant? None of the plants are open, a cost of f i is paid to open plant i At most k plants will be opened y i = 1 if plant is located at site i, 0 otherwise x ij = Quantity shipped from plant site i to customer j

8 utdallas.edu/~metin Plant Location with Single Sourcing Each customer/market has exactly one supplier Which market is served by which plant? Which supply sources are used by a plant? None of the plants are open, a cost of f i is paid to open plant i y i = 1 if plant is located at site i, 0 otherwise x ij = 1 if market j is supplied by factory i, 0 otherwise Can a plant satisfy the demand of two or more customers with this formulation?

9 utdallas.edu/~metin Network Optimization Models vs. Gravity Location Models u Both Network Optimization Models and Gravity Location Models determine the optimal location of a new facility or facilities. u In the Network Optimization Models, the new location must be one of the discrete set of potential locations. –That is why they are more amenable to be solved by a linear program. u In the Gravity Location Models, the new location can be anywhere on a continuous line or a rectangle (coordinate system); we do not need to make a list of potential locations in advance. u In the Gravity Location Models, the distance is modeled explicitly and generally as Euclidean distance. –That is why we end up with a nonlinear objective and cannot use a linear program. –We shall develop alternative methods.

10 utdallas.edu/~metin Gravity Methods for Location Ton Mile-Center Solution Given n delivery locations, i=1..n, a i, b i : Coordinates of delivery location i d i : Distance to delivery location i F i : Annual tonnage to delivery location i Locate a warehouse at (x,y)

11 utdallas.edu/~metin Gravity Methods for Location – A Variant Change the distance Given n delivery locations, i=1..n, a i, b i : Coordinates of delivery location i d i : Distance to delivery location i F i : Annual tonnage to delivery location i Locate a warehouse at (x,y)

12 utdallas.edu/~metin Case Study: Applichem Demand Allocation

13 utdallas.edu/~metin Demand Allocation with Duties Demand Mexico Canada Frankfurt Gary Sunchem Mexico30 Canada26 Latin America 160 Europe 200 U.S.A 264 Japan Venezuela 220 Capacity

14 utdallas.edu/~metin Ven Annual Cost = $72,916,400 Mex Can Fra Sun Mex Can LatAm Eur U.S.A Jap Gar Demand Allocation with Duties without Duties Without duties, Venezuela and Canada plants are closed and Frankfurt satisfies the excess Canada, Latin America and USA demand. There is consolidation without duties. Mex Can LatAm Mex Can Ven Fra Gar Sun Eur U.S.A Jap Annual Cost = 66,328,100

15 utdallas.edu/~metin Value of Adding 0.1 M Pounds Capacity (1982) Capacity should be evaluated as an option and priced accordingly. Shadow (dual) prices from LP tells you where to invest.

16 utdallas.edu/~metin Summary u Network optimization models u Gravity location models