B.1 Transportation Review Questions

Similar documents
ISE 204 OR II. Chapter 8 The Transportation and Assignment Problems. Asst. Prof. Dr. Deniz TÜRSEL ELİİYİ

Routing Optimization of Fourth Party Logistics with Reliability Constraints based on Messy GA

THE VALUE OF DISCRETE-EVENT SIMULATION IN COMPUTER-AIDED PROCESS OPERATIONS

A NATIONAL NETWORK OF LOCAL SHIPPING EXPERTS

LEVERAGING BIG DATA TO MANAGE LOGISTICS

Fruit & Vegetables by the Truckload

INBOUND SHIPMENT COORDINATION SENIOR DESIGN FINAL PRESENTATION DECEMBER 12, 2012

Mobile Billboards the Guerrilla Way. Custom Mobile Outdoor Advertising That Reaches Your Target Market

FREIGHT POLICY TRANSPORTATION INSTITUTE. Transport Economics, Logistics And Optimizing Wood Flows Eric Jessup

Central Minnesota. Regional Freight Profile

Modeling Using Linear Programming

Risk Assessment of Hazardous Materials Transportation Routes

Some network flow problems in urban road networks. Michael Zhang Civil and Environmental Engineering University of California Davis

Introduction to Logistics Systems Management

Topics in Supply Chain Management. Session 3. Fouad El Ouardighi BAR-ILAN UNIVERSITY. Department of Operations Management

Introduction to Transportation Systems

Chapter 9 Domestic U.S. and International Logistics

International trade and freight by 2050

Lecture 3 Mankiw chapters 4 and 5

Chapter 1 Introduction

Empty Containers Repositioning in South African Seaports

Supply Chain Location Decisions Chapter 11

Linear Programming. 1 Goals and Agenda. Management 560: Management Science. Tuesday, March 17, 2009

5 key strategies to control shipping costs

Federal Transportation Officer Training Program: Basic (Level 1)

Transport Terminals: New Perspectives

6 Managing freight transport

Fields in the (L6C) Screen

L.A.B. Equipment, Inc.

Techniques of Operations Research

Application of Transportation Linear Programming Algorithms to Cost Reduction in Nigeria Soft Drinks Industry

Best Practices for Transportation Management

a. Show the feasible region. b. What are the extreme points of the feasible region? c. Find the optimal solution using the graphical procedure.

Residential Swimming Pool Heating with Geothermal Heat Pump Systems

TRANSPORTATION PROBLEM AND VARIANTS

A Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests

2011 CFS Salary Guide

Chapter 08 Location Planning and Analysis

THOROUGHBRED DIRECT SCHEDULE OF ACCESSORIAL CHARGES

Chapter 21. Consumer Choice

FON Memberships ABOUT FAMILY OFFICE NETWORKS

CREATING A BLUEPRINT FOR CARGO-ORIENTED DEVELOPMENT

Transportation Problems

SUSTAINABILITY & WELLNESS Trends in Design

Making Better Fulfillment Decisions on the Fly in an Online Retail Environment

3. Transportation Problem (Part 1)

Executive Summary COMPARATIVE DISTRIBUTION WAREHOUSING COSTS IN 25 WESTERN AND MIDWEST U.S. CITIES. Location Consultants Princeton, NJ

LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS

A Log-Truck Scheduling Model Applied to a Belgian Forest Company. Jean-Sébastien Tancrez 1

Each location (farm, slaughterhouse or slaughtering company) is identified with a production

Summary Marketing Plan 1. Summary Marketing Plan

Container Shipping. Outlook and Issues for US East Coast Shippers and Ports. Tina Liu Country Manager, China. October 15, 2015 TPM Shenzhen

Cargo Training International

CROSS-DOCKING: SCHEDULING OF INCOMING AND OUTGOING SEMI TRAILERS

Container Sharing in Seaport Hinterland Transportation

INTEGER PROGRAMMING BASED SEARCH

Chapter Summary and Learning Objectives

Planning Optimized. Building a Sustainable Competitive Advantage WHITE PAPER

INTEGRATING VEHICLE ROUTING WITH CROSS DOCK IN SUPPLY CHAIN

OPTIMIZATION IN CITY LOGISTICS

Commerce 295 Midterm Answers

We want to offer added value in the areas where you need us the most.

Five Tips to Achieve a Lean Manufacturing Business

2016 ACI WORLDWIDE MASS TRANSIT PAYMENTS SURVEY

Optimizing Product Transportation At Frito Lay

Name: Class: Date: Unit 1. Thinking with Mathematical Models Investigation 1: Exploring Data Patterns. Practice Problems

Solving the Resource Allocation Problem in a Multimodal Container Terminal as a Network Flow Problem

DT1 : Apply basic concepts of probability. 1. What is the probability of getting matching numbers when rolling two dice?

Logistics. Lecture notes. Maria Grazia Scutellà. Dipartimento di Informatica Università di Pisa. September 2015

Global position system technology to monitoring auto transport in Latvia

Forecast and Capacity Planning for Nogales Ports of Entry

Perfectly competitive markets: Efficiency and distribution

Best Practices in Transportation Procurement Bringing the Paper Savings to Reality. Moderator: Speakers:

A Bayesian Approach to Operational Decisions in Transportation Businesses

Evaluation of traffic gases emissions: the case of the city of Tunis

Reaching Opportunity Youth Through Employee Volunteerism

Benchmarking Intermodal Transport in the U.S. and Europe

White Paper. Best Practices to Reduce International Freight Costs. A Guide for Global Logistics Managers

WHITE PAPER: SUPPLY CHAINS: WHERE TO FIND THE BIGGEST, FASTEST TRANSPORTATION SAVINGS September 1, 2006

Enhancing Pendulum Nusantara Model in Indonesian Maritime Logistics Network

The client. The challenge. CASE STUDY: From Supply Chain Insights to Value

ENGINE ELECTRICAL EQUIPMENT A Manufacturing Opportunity in Georgia

Presentation: H. Sarper An Introduction to Modeling

2013 PRSA Silver Anvil Awards

Port of Los Angeles. America s Port Harbor Transportation Club June 20, 2013 Kathryn McDermott

Mileage savings from optimization of coordinated trucking 1

Ecn Intermediate Microeconomic Theory University of California - Davis December 10, 2009 Instructor: John Parman. Final Exam

The Three C s of Urban Transportation Planning

Empty Repositioning Optimization

The Lodging Market Potential Index (L-MPI ) Ranking of Major Lodging Markets in the United States

A Mathematical Model for Interplanetary Logistics

the festival. Each performance takes 30 minutes allowing 12 performances on a stage. The stages and choirs have certain properties that have their inf

OPERATIONS RESEARCH TWO MARKS QUESTIONS AND ANSWERS

by MARK M. SWEENEY senior principal, McCallum Sweeney Consulting Physical Factors: Site and Infrastructure

MANAGEMENT TRAINING AND LEADERSHIP DEVELOPMENT PROGRAMS TOMORROW MOVES US. WHAT MOVES YOU? HOW TOMORROW MOVES

THE "OPERATIONS RESEARCH METHOD" Orientation. Problem Definition. Data Collection. Model Construction. Solution. Validation and Analysis

Supply Chain Systems II: Supply Chain Modules

Chinese Drywall Effects on Construction and Appliances

The Costs of Container Transport Flow Between Far East and Serbia Using Different Liner Shipping Services

Transcription:

Lesson Topics Network Models are nodes, arcs, and functions (costs, supplies, demands, etc.) associated with the arcs and nodes, as in transportation, assignment, transshipment, and shortest-route problems. Transportation (1) Problems are Resource Allocation Problems when outputs are fixed, and when outputs and inputs occur at different locations, so goods must be transported from origins to destinations. Transportation Problems with Modes of Transport re-interpret some of the different origins in a basic transportation problem to include not only location but modes of transportation (truck, rail, ). Assignment (1) Problems are Transportation Problems when the goods are workers that are transported to jobs, and each worker either does all of a job or none of it, so the fraction completed is binary. 1

Transportation Question. Consider Forbelt Corporation has a oneyear contract to supply motors for all refrigerators produced by the Ice Age Corporation. Ice Age manufactures the refrigerators at four locations around the country: Boston, Dallas, Los Angeles, and St. Paul. Plans call for the following number (in thousands) of refrigerators to be produced at each location: Boston 50 Dallas 70 Los Angeles 60 St. Paul 80 Forbelt s three plants are capable of producing the motors. The plants and production capacities (in thousands) are Denver 100 Atlanta 100 Chicago 150 Because of varying production and transportation costs, the profit that Forbelt earns on each lot of 1000 units depends on which plant produced the lot and which destination it was shipped to. The following table gives the accounting department estimates of the profit per unit (shipments will be made in lots of 1000 units): Shipped to Produced at Boston Dallas Los Angeles St. Paul Denver 7 11 8 13 Atlanta 20 17 12 10 Chicago 8 18 13 16 Consider the profit maximization problem of determining how many motors should be produced at each plant and how many motors should be shipped from each plant to each destination. a. Develop a network representation of the problem. b. Compute an optimum using a computer. What are optimal profits? 2

Answer to Question: a. 1 7 Boston 50 100 1 Denver 11 8 100 20 2 Atlanta 13 17 12 2 Dallas 70 8 10 18 3 Los Angeles 60 150 3 Chicago 13 16 4 St. Paul 80 b. There are alternative optimal solutions (you need only provide one). Solution #1 Solution # 2 Denver to St. Paul: 10 Denver to St. Paul: 10 Atlanta to Boston: 50 Atlanta to Boston: 50 Atlanta to Dallas: 50 Atlanta to Los Angeles: 50 Chicago to Dallas: 20 Chicago to Dallas: 70 Chicago to Los Angeles: 60 Chicago to Los Angeles: 10 Chicago to St. Paul: 70 Chicago to St. Paul: 70 Total Profit: $4240 If solution #1 is used, Forbelt should produce 10 motors at Denver, 100 motors at Atlanta, and 150 motors at Chicago. There will be idle capacity for 90 motors at Denver. If solution #2 is used, Forbelt should adopt the same production schedule but a modified shipping schedule. 3

Assignment Question. A professor has been contacted by four not-for-profit agencies that are willing to work with student consulting teams. The agencies need help with such things as budgeting, information systems, coordinating volunteers, and forecasting. Although each of the four student teams could work with any of the agencies, the professor feels that there is a difference in the amount of time it would take each group to solve each problem. The professor s estimate of the time, in days, is given in the table below. Formulate the problem of determining which team should work with which project. Compute an optimum using a computer. Projects Team Budgeting Information Volunteers Forecasting A 32 35 15 27 B 38 40 18 35 C 41 42 25 38 D 45 45 30 42 Tip: Your written answer should define the decision variables, formulate the objective and constraints, and solve for the optimum. --- You will not earn full credit if you just solve for the optimum; you must also define the decision variables, and formulate the objective and constraints. 4

Answer to Question: This is a standard assignment problem. The optimal assignment is: Team A works with the forecast, Team B works with volunteers, Team C works with budgeting, and Team D works with information. The total time is 131. 5

Assignment Question. A market research film s three clients each requested that the firm conduct a sample survey. Four available statisticians can be assigned to these three projects; however, all four statisticians are busy, and therefore each can handle only one client. The following data show the number of hours required for each statistician to complete each job; the differences in time are based on experience and ability of the statisticians. Client Statistician A B C 1 150 210 270 2 170 230 220 3 180 230 225 4 160 240 230 a. Formulate a linear programming model for this problem. Compute an optimum using a computer. b. Suppose that the time statistician 4 needs to complete the job for client A is increased from 160 to 165 hours. What effect will this change have on the solution? c. Suppose that the time statistician 4 needs to complete the job for client A is decreased to 140 hours. What effect will this change have on the solution? d. Suppose that the time statistician 3 needs to complete the job for client B increases to 250 hours. What effect will this change have on the solution? 6

Answer to Question: a. Min 150x 11 + 210x 12 + 270x 13 + 170x 21 + 230x 22 + 220x 23 + 180x 31 + 230x 32 + 225x 33 + 160x 41 + 240x 42 + 230x 43 s.t. x 11 + x 12 + x 13 1 x 21 + x 22 + x 23 1 x 31 + x 32 + x 33 1 x 41 + x 42 + x 43 1 x 11 + x 21 + x 31 + x 41 = 1 x 12 + x 22 + x 32 + x 42 = 1 x 13 +x 23 +x 33 +x 43 = 1 xij > for all i, j (The first four constraints are that the 4 statisticians each take at most one job; the last three constraints are that the 3 jobs are each filled by exactly one statistician.) Optimal Solution: x12 = 1, x23 = 1, x41 = 1 Total hours required: 590 Note: statistician 3 is not assigned. b. The solution will not change, but the total hours required will increase by 5. This is the extra time required for statistician 4 to complete the job for client A. c. The solution will not change, but the total time required will decrease by 20 hours. d. The solution will not change; statistician 3 will not be assigned. Note that this occurs because increasing the time for statistician 3 makes statistician 3 an even less attractive candidate for assignment. 7