1 1 Slides by John Loucks St. Edwards University Modifications by A. Asef-Vaziri.

Slides:



Advertisements
Similar presentations
2 Casa 15m Perspectiva Lateral Izquierda.
Advertisements

Un percorso realizzato da Mario Malizia
1 A B C
Network Models Chapter 11
Artrelle Fragher & Robert walker. 1 you look for the median 1 you look for the median 2 then you look for the min and max 2 then you look for the min.
Fill in missing numbers or operations
AP STUDY SESSION 2.
1
Worksheets.
& dding ubtracting ractions.
Ozone Level ppb (parts per billion)
Multicriteria Decision-Making Models
Addition and Subtraction Equations
Multiplication X 1 1 x 1 = 1 2 x 1 = 2 3 x 1 = 3 4 x 1 = 4 5 x 1 = 5 6 x 1 = 6 7 x 1 = 7 8 x 1 = 8 9 x 1 = 9 10 x 1 = x 1 = x 1 = 12 X 2 1.
Division ÷ 1 1 ÷ 1 = 1 2 ÷ 1 = 2 3 ÷ 1 = 3 4 ÷ 1 = 4 5 ÷ 1 = 5 6 ÷ 1 = 6 7 ÷ 1 = 7 8 ÷ 1 = 8 9 ÷ 1 = 9 10 ÷ 1 = ÷ 1 = ÷ 1 = 12 ÷ 2 2 ÷ 2 =
Math Expressions How does it all work together…?.
David Burdett May 11, 2004 Package Binding for WS CDL.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
We need a common denominator to add these fractions.
/4/2010 Box and Whisker Plots Objective: Learn how to read and draw box and whisker plots Starter: Order these numbers.
CALENDAR.
1 1  1 =.
1  1 =.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Year 6 mental test 15 second questions Numbers and number system Numbers and the number system, Measures and Shape.
The 5S numbers game..
Year 6/7 mental test 5 second questions
Training Objective: students will be able to evaluate expressions using the order of operations.
Break Time Remaining 10:00.
Division- the bus stop method
PP Test Review Sections 6-1 to 6-6
Look at This PowerPoint for help on you times tables
Outline Minimum Spanning Tree Maximal Flow Algorithm LP formulation 1.
Chapter 10, Part B Distribution and Network Models
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
Adding Up In Chunks.
MaK_Full ahead loaded 1 Alarm Page Directory (F11)
Least Common Multiples and Greatest Common Factors
When you see… Find the zeros You think….
Before Between After.
Subtraction: Adding UP
1 Lab 17-1 ONLINE LESSON. 2 If viewing this lesson in Powerpoint Use down or up arrows to navigate.
: 3 00.
1 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit.
Number bonds to 10,
Let’s take a 15 minute break Please be back on time.
Static Equilibrium; Elasticity and Fracture
Fractions Simplify: 36/48 = 36/48 = ¾ 125/225 = 125/225 = 25/45 = 5/9
Converting a Fraction to %
Resistência dos Materiais, 5ª ed.
Clock will move after 1 minute
Partial Products. Category 1 1 x 3-digit problems.
& dding ubtracting ractions.
Physics for Scientists & Engineers, 3rd Edition
Select a time to count down from the clock above
Doubling and Halving. CATEGORY 1 Doubling and Halving with basic facts.
Copyright Tim Morris/St Stephen's School
1.step PMIT start + initial project data input Concept Concept.
1 Dr. Scott Schaefer Least Squares Curves, Rational Representations, Splines and Continuity.
0 x x2 0 0 x1 0 0 x3 0 1 x7 7 2 x0 0 9 x0 0.
Schutzvermerk nach DIN 34 beachten 05/04/15 Seite 1 Training EPAM and CANopen Basic Solution: Password * * Level 1 Level 2 * Level 3 Password2 IP-Adr.
1 1 BA 452 Lesson B.2 Transshipment and Shortest Route ReadingsReadings Chapter 6 Distribution and Network Models.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
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.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
St. Edward’s University
Presentation transcript:

1 1 Slides by John Loucks St. Edwards University Modifications by A. Asef-Vaziri

2 2 Shortest-Route Problem n The shortest-route problem is concerned with finding the shortest path in a network from one node (or set of nodes) to another node (or set of nodes). n If all arcs in the network have nonnegative values then a labeling algorithm can be used to find the shortest paths from a particular node to all other nodes in the network. n The criterion to be minimized in the shortest-route problem is not limited to distance even though the term "shortest" is used in describing the procedure. Other criteria include time and cost. (Neither time nor cost are necessarily linearly related to distance.)

3 3 n Linear Programming Formulation Using the notation: Using the notation: x ij = 1 if the arc from node i to node j x ij = 1 if the arc from node i to node j is on the shortest route is on the shortest route 0 otherwise 0 otherwise c ij = distance, time, or cost associated c ij = distance, time, or cost associated with the arc from node i to node j with the arc from node i to node j continued Shortest-Route Problem

4 4 n Linear Programming Formulation (continued) Shortest-Route Problem

5 5 Susan Winslow has an important business meeting Susan Winslow has an important business meeting in Paducah this evening. She has a number of alternate routes by which she can travel from the company headquarters in Lewisburg to Paducah. The network of alternate routes and their respective travel time, ticket cost, and transport mode appear on the next two slides. If Susan earns a wage of $15 per hour, what route If Susan earns a wage of $15 per hour, what route should she take to minimize the total travel cost? Example: Shortest Route

6 6 6 A B C D E F G H I J K L M Paducah Lewisburg n Network Representation

7 7 Example: Shortest Route Transport Time Time Ticket Total Transport Time Time Ticket Total Route Mode (hours) Cost Cost Cost 1-2Train 4 $60 $ 20 $ Train 4 $60 $ 20 $ Bus 2 $30 $ 10 $ Bus 2 $30 $ 10 $ Train 3 $50 $ 30 $ Train 3 $50 $ 30 $ Plane 1 $15 $115 $ Plane 1 $15 $115 $ Taxi 6 $90 $ 90 $ Taxi 6 $90 $ 90 $ Bus 3 $45 $ 15 $ Bus 3 $45 $ 15 $ Taxi 3 $50 $ 50 $ Taxi 3 $50 $ 50 $ Taxi 1 $15 $ 15 $ Taxi 1 $15 $ 15 $ Bus 4 $70 $ 20 $ Bus 4 $70 $ 20 $ Bus 6 $95 $ 25 $ Bus 6 $95 $ 25 $ Train 2 $35 $ 15 $ Train 2 $35 $ 15 $ Bus 4 $70 $ 20 $ Bus 4 $70 $ 20 $ Train 1 $20 $ 10 $ Train 1 $20 $ 10 $ 30

8 8 Example: Shortest Route n LP Formulation Objective Function Objective Function Min 80 x x x x x x 25 Min 80 x x x x x x x x x x x x x x x x x x x x x x x x x x x x 56 Node Flow-Conservation Constraints Node Flow-Conservation Constraints x 12 + x 13 + x 14 + x 15 + x 16 = 1 (origin) x 12 + x 13 + x 14 + x 15 + x 16 = 1 (origin) – x 12 + x 25 + x 26 – x 52 = 0 (node 2) – x 12 + x 25 + x 26 – x 52 = 0 (node 2) – x 13 + x 34 + x 35 + x 36 – x 43 – x 53 = 0 (node 3) – x 13 + x 34 + x 35 + x 36 – x 43 – x 53 = 0 (node 3) – x 14 – x 34 + x 43 + x 45 + x 46 – x 54 = 0 (node 4) – x 14 – x 34 + x 43 + x 45 + x 46 – x 54 = 0 (node 4) – x 15 – x 25 – x 35 – x 45 + x 52 + x 53 + x 54 + x 56 = 0 (node 5) – x 15 – x 25 – x 35 – x 45 + x 52 + x 53 + x 54 + x 56 = 0 (node 5) x 16 + x 26 + x 36 + x 46 + x 56 = 1 (destination) x 16 + x 26 + x 36 + x 46 + x 56 = 1 (destination)

9 9 Excel Solution