A Logistics Problem The Dispatch Manager for ABC Logistics needs to send a fleet of 7 small trucks and 4 large trucks from a depot to pick up items at.

Slides:



Advertisements
Similar presentations
OPERATIONS RESEARCH LINEAR PROGRAMMING (SOLVED) BY BY APARNA APARNA ASHA.V ASHA.V SARITHA SARITHA JINTO JINTO.
Advertisements

Chapter 3: Linear Programming Modeling Applications © 2007 Pearson Education.
Pertemuan 2 – Menyelesaikan Formulasi Model Dengan Metode Grafik Riset Operasiomal- dewiyani 1.
Question:- A company assembles four products (1, 2, 3, 4) from delivered components. The profit per unit for each product (1, 2, 3, 4) is £10, £15, £22.
Transshipment Problem
B-1 Operations Management Linear Programming Module B - New Formulations.
Time 1 day = 24 hours 1 hour = 60 minutes 1 minute = 60 seconds 1 year
The 2 Period Travelling Salesman Problem Applied to Milk Collection in Ireland By Professor H P Williams,London School of Economics Dr Martin Butler, University.
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India LINEAR PROGRAMMING GRAPHIC METHOD 2 CHAPTER.
Linear functions. Mathematical Function? Relationship between two variables or quantities Represented by a table, graph, or equation Satisfies vertical.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
B-1 Operations Management Linear Programming Module B - Harder Formulations.
Vehicle Routing & Scheduling: Part 2 Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
24 Hour Clock Grade 6 Math.
Unit 1 Linear programming. Define: LINEAR PROGRAMMING – is a method for finding a minimum or maximum value of some quantity, given a set of constraints.
CAPS RoutePro CAPS Logistics Overview RoutePro Dispatcher Features.
Two Discrete Optimization Problems Problem: The Transportation Problem.
1 Chapter 8 Linear programming is used to allocate resources, plan production, schedule workers, plan investment portfolios and formulate marketing (and.
Classifying optimization problems By the independent variables: –Integer optimization --- integer variables –Continuous optimization – real variables By.
Routing and Scheduling in Transportation. Vehicle Routing Problem Determining the best routes or schedules for pickup/delivery of passengers or goods.
Arben Asllani University of Tennessee at Chattanooga Prescriptive Analytics CHAPTER 6 Business Analytics with Integer Programming Business Analytics with.
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
Chapter Seven Telling Time. 1.hour – a unit used to measure time 1 hour = 60 minutes 1 day = 24 hours.
LESSON 2 – SOLVING LINEAR SYSTEMS GRAPHICALLY SYSTEMS OF LINEAR EQUATIONS.
11/20/2015 6:37 AM1 1 LINEAR PROGRAMMING Section 3.4, ©2008.
1 Linear Programming (LP) 線性規劃 - George Dantzig, 1947.
5.5 The Trapezoidal Rule. I. Trapezoidal Rule A.) Area of a Trapezoid -
1 1 Solutions to Exam #1 John H. Vande Vate Fall, 2002.
Business Mathematics MTH-367 Lecture 13. Chapter 10 Linear Programming An Introduction Continued…
Let us consider one producer P and four customers, which are supplied each day with one item of product each. Customers can be supplied only by trucks.
1 A Logistics Problem The Dispatch Manager for ABC Logistics needs to send a fleet of 8 small trucks and 4 large trucks from a depot to pick up items at.
LINEAR PROGRAMMING.
1 Lecture 7 Linearization of a Quadratic Assignment Problem Indicator Variables.
Linear Programming.  Linear Programming provides methods for allocating limited resources among competing activities in an optimal way.  Linear → All.
Vehicle Routing Problems
Managerial Economics Linear Programming Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr.
Chapter 3 Linear Programming Applications
 Graphs are the best way to visually represent relationships between two variables.  Y-AXIS (VERTICAL)  for our purposes this will always be distance.
7.2 – SOLVING LINEAR SYSTEMS GRAPHICALLY SYSTEMS OF LINEAR EQUATIONS.
Alex’s Furniture Warehouse Linear Programming for a Furniture Company.
What is a “no-show”? Contact Us!
Step By Step Instructions: Your Rental Experience at IPFW
MATH143 Lec 7 Quantitative Methods
Linear Programming Models: Graphical and Computer Methods
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
Optimization with Linear Programming
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Managerial Economics Linear Programming
Time 12/24 hour time, time intervals Distance, speed and time
Local Container Truck Routing Problem with its Operational Flexibility Kyungsoo Jeong, Ph.D. Candidate University of California, Irvine Local container.
Linear Programming Dr. T. T. Kachwala.
Goal programming.
Introduction To Linear Programming
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
Why network models? Visualize a mathematical model
Chapter 7: Lesson 7.6 Linear Programming
TransCAD Vehicle Routing 2018/11/29.
Quantifying the Impact of Deployment Practices on Interplant Freight Volatility Kurn Ma Manish Kumar.
Using GIS to Create Demand Response Service Schedule Zones and Times
Algebra: Graphs, Functions, and Linear Systems
Section Direct Variation
Optimization with Linear Programming
Section 2: Linear Regression.
Planning the transportation of elderly to a daycare center
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Module B Linear Programming.
Day 9 UNIT 1 Motion Graphs x t Lyzinski Physics.
10.8 Linear Programming.
Chapter 1. Formulations.
ESGI SI: European Study Group Mathematics With Industry Workshop 2017
Presentation transcript:

A Logistics Problem The Dispatch Manager for ABC Logistics needs to send a fleet of 7 small trucks and 4 large trucks from a depot to pick up items at five plants located near Kyoto and deliver those items to a central warehouse (each truck can go to only one plant). The number of (identical) items to be picked up at each plant as well as the distances in kilometers from the depot to each plant and from each plant to the warehouse are given in the following table: Plant 1 Plant 2 Plant 3 Plant 4 Plant 5 Depot (kms) 20 45 76 124 88 Warehouse (kms) 69 106 95 57 39 Number of Items 125 134 98 126 222 Each small truck can hold up to 35 items and each large truck can hold up to 122 items.

A Logistics Problem Draw a graph to represent this problem. Indicate the meaning of the vertices and edges. Include all of the data in your diagram. Use the following variables to formulate a model with objective function and constraints to determine how to use the fleet of trucks to pick up the items at the plants and deliver those items to the warehouse so that total distance traveled by all the trucks from the depot to the warehouse is as small as possible. Is your model a linear program? Why or why not? Sj = the number of small trucks to send from the Depot to Plant j (j = 1, …, 5) Lj = the number of large trucks to send from the Depot to Plant j (j = 1, …, 5)

A Scheduling Problem An ambulance service must schedule its drivers on a daily basis. The driver’s schedules vary and may be 4 hours (part-time) or 8 hours (full-time). Starting times of these drivers may be anytime but, for practical purposes, are limited to midnight, 4 A.M., 8A.M., Noon, or 4 P.M. Part-time drivers can also start at 8 P.M. but full-time drivers cannot. The demand for these vehicles depends on the day of the week and is given in the following table for Monday.

A Scheduling Problem The company estimates that each vehicle staffed with a part-time driver costs $75/hour, whereas one with full-time driver cost $60/hour. Formulate a mathematical model with variables, objective function and constraint to decide the number of full-time and part-time drivers to schedule at each starting time so as to satisfy the demand with least cost. Clearly define all the decision variables used.