ENGM 732 Network Flow Programming

Slides:



Advertisements
Similar presentations
Transportation Assignment and Transshipments Problems
Advertisements

03 February Infinity Logistics Version - 01 To ensure that we continue to meet the needs of our customers & partners in the increasingly competitive.
Outline LP formulation of minimal cost flow problem
Transportation Problem and Related Topics. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics There are 3 plants, 3 warehouses.
Production and Operations Management Systems
Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.
Linear Programming Models & Case Studies
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Transportation, Transshipment and Assignment Models and Assignment Models.
ITGD4207 Operations Research
Chapter 8: Scheduling Resources and Costs
MANAGING PROJECT RESOURCES. Resource Allocation Problem  A shortcoming of most scheduling procedures is that they do not address the issues of resource.
Project Management 6e..
Introduction to Operations Research
Domestic Water Carriers. Significance of the Industry Transport roughly 14% of total national freight 26.5% of total domestic ton-miles Employ close to.
Waterways 1 Water Transportation History. Water Transportation Propulsion History Human (oars, poles) - - 7,000-10,000 BC Wind (sails) - - 3,000 BC Steamboat.
Lecture 5 Set Packing Problems Set Partitioning Problems
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Paris, June Wagon management information flow on Slovenian Railways wagon ordering wagon maintenance.
17.3 Transportation.
Transportation and Assignment Problems
Minimum Spanning Network: Brute Force Solution
© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-1 Operations Management Simulation Module F.
Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.
MNG221 - Management Science
CE 515 Railroad Engineering Armstrong Chapter 8: Railroad Operation – Moving From Here to There “Transportation exists to conquer space and time -”
1 Chapter 7 Dynamic Job Shops Advantages/Disadvantages Planning, Control and Scheduling Open Queuing Network Model.
Optimization II. © The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Optimization Extensions Multiperiod Models –Operations.
The Port of Baltimore Glossary Activity Produced by.
1 The Supply Chain Supplier Inventory Distributor Inventory Manufacturer Customer Market research data scheduling information Engineering and design data.
1 The Supply Chain Supplier Inventory Distributor Inventory Manufacturer Customer Market research data scheduling information Engineering and design data.
MIT ICAT ICATMIT M I T I n t e r n a t i o n a l C e n t e r f o r A i r T r a n s p o r t a t i o n Virtual Hubs: A Case Study Michelle Karow
Infinity Logistics FZE R 6, Office # 38 PO Box , Sharjah SAIF Zone United Arab Emirates Tel
ENGM 732 Network Flow Programming Network Flow Models.
Scheduling Resources and Costs CHAPTER EIGHT Student Version Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
13.10 – How series and Parallel Circuits Differ. Loads in Series Current  A series circuit with one load will have a different total resistance than.
. 1 Transportation and Assignment Problems. . 2 Applications Physical analog of nodes Physical analog of arcs Flow Communication systems phone exchanges,
Network Optimization Problems
Hub Location Problems Chapter 12
Instructional Guide Transportation: Across the United States.
1 Dr. Ali Amiri TCOM 5143 Lecture 8 Capacity Assignment in Centralized Networks.
DISTRIBUTION AND NETWORK MODELS (1/2)
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Location decisions are strategic decisions. The reasons for location decisions Growth –Expand existing facilities –Add new facilities Production Cost.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.3 The student will be able to formulate the dual problem. The student.
Traveling Salesman Problem (TSP)
Spring 2015 Mathematics in Management Science Maths for Management Sciences.
1 By: Prof. Y. Peter Chiu POM Chap-8: Scheduling ~ Homework Problems ~
Transportation Problems The EBKK company has three plants producing child push chairs that are to be shipped to four distribution centers. Plans 1, 2,
1 TCOM 5143 Lecture 10 Centralized Networks: Time Delay and Cost Tradeoffs.
® VP Network Operations Jordan M. Small MTESC Reengineering MTAC Briefing.
Port Logistic Solutions Group Project Spring ‘06.
Prof.V.M.MOHAMED ALI.  Shipping containers are defined as containers that facilitate the transport and carriage of goods without the need to unload and/or.
Scheduling Resources and Costs
LP Examples Wastewater & Water Quality
The Handbook of Logistics and Distribution Management
Constraint-Based Routing
Transportation Management
The assignment problem
TRANSPORT TECHNOLOGY Ground transportation by road is one of the most important today as well as for freight and people, due to the great development of.
Decisions on what to build: Thoughts from one who has worked on both sides Sarena D. Burch Sr. VP – Fuel Procurement and Asset Mgmt SCANA Corporation.
GEOP 4355 Intermodal transportation
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
International Trade and Shipping
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
How did ways of travel change?
The Port of Baltimore Glossary Activity Produced by.
Where We Are Now. Where We Are Now The Resource Problem Resources and Priorities Project network times are a schedule until resources have been assigned.
Presentation transcript:

ENGM 732 Network Flow Programming Hwk 1

Solutions 1-1 Eight tankers are scheduled to arrive and depart from a port at the times given in the table below. Set up a minimum cost flow model that will find the smallest number of docks required to service the tankers within the arrival and departure times and the schedule of the tankers at the docks. Tanker Arrival Date Departure Date 1 3 2 5 4 7 9 6 10 8

Tanker – try an assignment [1] T1 [Fixed] (flow, cost) T2 D1 [1] [-1] How can we adjust for minimal number of docks and how can we adjust for days in dock? T3 [1] D2 [-1] D3 [-1] T8 [1]

Tanker – try a rethink on days [1] D0 D1 [0,-M,1] [Fixed, Slack, Cost] (flow, cost) D2 [1] D2 [0,-M,1] Assumptions Load / unload takes 1 day Tanker 1 arrives day 0 and must leave by day 3. D3 [1] D3 [0,-M,1] D4 D4 [2] [0,-M,1] D6 [1] D10 [0,-M,1] D7 [2]

Tanker – try a rethink on days [1] D0 D1 [0,-M,1] [Fixed, Slack, Cost] (flow, cost) D2 [1] D2 [0,-M,1] Assumptions Load / unload takes 1 day Tanker 1 arrives day 0 and must leave by day 3. Tanker 2 arrives day 2 and must leave by day 5. D3 [1] D3 [0,-M,1] D4 D4 [2] [0,-M,1] D6 [1] D10 [0,-M,1] D7 [2]

Tanker – try a rethink on days [1] D0 D1 [0,-M,1] [Fixed, Slack, Cost] (flow) D2 [1] D2 [0,-M,1] Assumptions Load / unload takes 1 day Tanker 1 arrives day 0 and must leave by day 3. Tanker 2 arrives day 2 and must leave by day 5. 2 tankers arrive day 4 and 2 tankers arrive day 7 D3 [1] D3 [0,-M,1] D4 D4 [2] [0,-M,1] D6 [1] D10 [0,-M,1] D7 [2]

Solutions 1-2 Over the next three months, 20,000 boxcars of Wyoming coal must be transported from Butte to distribution points at St. Louis, Houston and New Orleans. The three cities have contracted for 4000, 10,000, and 6000 boxcars, respectively. Because of different rail carriers’ practices, three different routes are possible. Direct transport to St. Louis, Houston and New Orleans at a cost of $1200, $1400 and $1500 per boxcar, respectively, Transport first to Wichita at a cost of $600 per boxcar; then a decoupling-coupling charge of $30 per car, finally a charge of $600, $400 and $400 per car for final transport to St. Louis, Houston and New Orleans. Transport first to St. Louis at a cost of $1200 per car; then by river barge to New Orleans at $250 per car (equivalent); finally by boat across the Gulf of Mexico to the port of Houston at a cost of $150 per car (equivalent). Various government regulations stipulate that no more than 20% of the 20,000 cars may be sent to Wichita. Because of other commitments, the direct rail lines from Butte to Houston and New Orleans are limited to 1000 and 3000 cars per month, respectively. Formulate a network flow model to minimize the total costs of transporting the 20,000 cars of coal.