Distribution Manager Supply Chain Man. (SCM), “Logistics” Transport Plans (Production Plans) Facility Location f.ex. warehouses Network Models: Minimal.

Slides:

Advertisements

Similar presentations

Thursday, March 14 Introduction to Network Flows

Advertisements

ITS THE FINAL LECTURE! (SING IT, YOU KNOW YOU WANT TO) Operations Research.

Graph. -traffic modeling MAXIMUM FLOW -shortest (fastest) route SHORTEST PATH -efficient distribution, logistics, pickup/delivery HAMILTONIAN PATH/CYCLE,

Outline LP formulation of minimal cost flow problem

BU BU Decision Models Networks 1 Networks Models Summer 2013.

Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.

Chapter 11 To accompany Quantitative Analysis for Management, Eleventh Edition, Global Edition by Render, Stair, and Hanna Power Point slides created by.

Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.

Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.

Table of Contents Chapter 6 (Network Optimization Problems)

Computational Methods for Management and Economics Carla Gomes Module 9a Network Models Terminology (Slides adapted from J.Orlin’s)

Math443/543 Mathematical Modeling and Optimization

Models Physical: Scale, Analog Symbolic: Drawings Computer Programs Mathematical: Analytical (Deduction) Experimental (Induction)

Chapter 7 Network Flow Models.

McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., NETWORKS.

Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.

© 2008 Prentice-Hall, Inc. Chapter 12 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides.

Transportation, Assignment, Network Models

To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 12-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 12.

1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.

NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.

Transportation Model (Powerco) Send electric power from power plants to cities where power is needed at minimum cost Transportation between supply and.

Computational Methods for Management and Economics Carla Gomes Module 9d Network Models Maximum Flow Problem (Slides adapted from J.Orlin’s and Hillier’s)

Models Physical: Scale, Analog Symbolic: Drawings Computer Programs Mathematical: Analytical (Deduction) Experimental (Induction)

Table 1. Shipping costs, Supply, and Demand for Powerco Example

Networks and the Shortest Path Problem.  Physical Networks  Road Networks  Railway Networks  Airline traffic Networks  Electrical networks, e.g.,

How to Build Network? ISAT 625 Network Problems Build highways to connect cities Build highways to connect cities Build network to connect computers.

Network Optimization Models

Network Models (2) Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.

Introduction to Operations Research

Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.

Spreadsheet Modeling & Decision Analysis:

1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.

“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.

. 1 Transportation and Assignment Problems. . 2 Applications Physical analog of nodes Physical analog of arcs Flow Communication systems phone exchanges,

Network-Based Optimization Models Charles E. Noon, Ph.D. The University of Tennessee.

Network Optimization Problems

1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.

1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.

Lecture 18: MGTSC 352 Distribution Planning

Production Manager 1 Strategic Planning Forecasting

Network Flow Problems Example of Network Flow problems:

Chapter 8 Network Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,

Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.

1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.

ENGM 631 Minimum Spanning Tree. Prototype Example Seervada Park Trams route smallest total distance Phone lines minimum spanning tree Tram limitations.

Vehicle Routing Problem

Transportation II Lecture 16 ESD.260 Fall 2003 Caplice.

Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.

1 1 Slide © 2005 Thomson/South-Western Chapter 9 Network Models n Shortest-Route Problem n Minimal Spanning Tree Problem n Maximal Flow Problem.

Network Models Chapter 12

St. Edward’s University

Network Flow Problems – Shortest Path Problem

ENGM 535 Optimization Networks

Network Models Chapter 12

Chapter 12 Network Models 12-1

1.3 Modeling with exponentially many constr.

Routing and Logistics with TransCAD

Business Statistics with Quantitative Analysis

Transportation, Assignment and Network Models

Lecture 19: MGTSC 352 Distribution Planning

Introduction Basic formulations Applications

Network Models 7-1.

1.3 Modeling with exponentially many constr.

Spreadsheet Modeling & Decision Analysis

Prepared by Lee Revere and John Large

Networks Kruskal’s Algorithm

Network Models Chapter 12

Chapter 6 Network Flow Models.

Network Flow Problems – Maximal Flow Problems

Presentation transcript:

Distribution Manager Supply Chain Man. (SCM), “Logistics” Transport Plans (Production Plans) Facility Location f.ex. warehouses Network Models: Minimal Spanning Shortest Route, Longest (CPM) Maximal Flow Vehicle Routing Problem

Transport Transport Model: m plants send to n markets, distances, demand and supply known Transport.xls chapter 5 in W&A Interpreting “Reduced Costs” Production Plan with Transport Model

Set Covering Minimum distance to service Fire Stations, Ambulances Taxi Locations? Kilroy-dæmið Example: LocatingHubs.xls in ch 6 in W&A: Airline Company, “hub” system

Facility Location Positioning w.r.t. Distances etc Multi Criteria: GP, AHP method Gravity Method (GIS) Addition to the Transport Model See LocatingServiceCenters.xls and FixedCostTransportation.xls in ch 6 in W&A

Facility Location & MPL MPL from Maximal Software Applications in Iceland: Milk Processing Industry (slides on web) Locating ESSO Oil Depots Garbage Processing (slides on web) Ambulance Locations in Reykjavik (MSc Thesis Margrét Marís Leifsdóttir)

Network Models Minimal Spanning Shortest Route Longest Route, Project Plans (CPM) Maximal Flow Minimal Cost Vehicle Routing

Network Basics Nodes & arcs Directed arcs Paths, cycles Tree, spanning tree Flow, arc capacity Sources, sinks Transshipment nodes (netto = 0)

Network Example

Minimal Spanning Telecomm cables, computer networks Road System (light traffic) Electrical Lines Pipelines

Shortest Route Distribution of goods See ShortestPath.xls in ch 5 in W&A MachineReplacement See Equipment Replacement in ch 5 in W&A Ex 55 page 276 in W&A

Max Flow “Maximal Flow” Production System Logistics Finding the Bottlenecks Road Systems (heavy traffic) Telephone System Traffic Hot Water Pipelines

Minimal Cost “Min Cost Net Flow” Distribution System (plants, warehouses, markets) Cash Flow See Redbrand.xls in ch 5 in W&A

VRP VRP, “Vehicle Routing Problem” Cargo Capacity Time Windows Savings Method (Clarke & Wright) See VRP example Shortrec, AGR hf

TSP TSP, “Travelling Salesman Problem” Finding the shortest ringroute Stop once each place Job sequencing, min setup times MPL solution