L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location
-
Upload
stacey-reyes -
Category
Documents
-
view
31 -
download
2
description
Transcript of L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location
![Page 1: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/1.jpg)
LESSON ON NETWORKS: Finding the Shortest Route and
1-Center Location
ELENA I. PASCUALEisenhower 9th Grade Center
Aldine ISDHouston, Texas
Mentors:
Dr. HALIT USTERDirector of logistics and Networked Systems
Research LaboratoryDepartment of Industrial Engineering
Texas A & M, College Station
BURCU B. KESKIN (Ph. D. expected 2006)
![Page 2: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/2.jpg)
OOBJECTIVESBJECTIVES:: In this lesson, the students will:In this lesson, the students will:
1. become familiar with basic elements of a 1. become familiar with basic elements of a network;network;
2. integrate physics concepts and skills to 2. integrate physics concepts and skills to solve engineering problems;solve engineering problems;
3. find the shortest route and 1-center 3. find the shortest route and 1-center location using algorithms.location using algorithms.
4. design a network system to solve real life 4. design a network system to solve real life situation problems.situation problems.
![Page 3: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/3.jpg)
BBACKGROUNDACKGROUND SSCIENCECIENCE
Before presenting this lesson, the Before presenting this lesson, the students should have mastered their students should have mastered their skills on physics concepts of skills on physics concepts of speed, speed, distance, displacement, velocity, and distance, displacement, velocity, and acceleration.acceleration.
The students have demonstrated The students have demonstrated mastery on problem solving and mastery on problem solving and critical thinking.critical thinking.
![Page 4: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/4.jpg)
• Mayor White of Houston wants to improve the service efficiency of the Harris County
Fire Department. As such, he proposed that the location of the Harris County Fire
Department Headquarter must be relocated in such a way that the Fire Fighters must
be able to reach any of their assigned service areas, the easiest and the shortest time
possible.
• In order to solve the problem, and at the same time to please the mayor, Maj. Browne,
the newly assigned Head of the Fire Department , consulted Industrial Engr. Spencer to
decide where is the best location for them to move the Headquarter.
• Looking at the different service areas covered by Harris County, as shown in the
diagram, where should be the right location that Engr. Spencer would recommend to
Maj. Browne so as to solve the problem?
AACTIVITY No. 1CTIVITY No. 1
![Page 5: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/5.jpg)
1-CENTER LOCATION ON TREE NETWORK
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
4
14
1
6
8
2
![Page 6: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/6.jpg)
1-CENTER LOCATION ON TREE NETWORK1-CENTER LOCATION ON TREE NETWORKSTEPSSTEPS
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
41
41
6
8
2
![Page 7: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/7.jpg)
11--CCENTER ENTER LLOCATION ON OCATION ON TTREE REE NNETWORKETWORKSTEPSSTEPS
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
41
41
6
8
2
![Page 8: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/8.jpg)
11--CCENTER ENTER LLOCATION ON OCATION ON TTREE REE NNETWORKETWORKSTEPSSTEPS
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
41
41
6
8
2
![Page 9: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/9.jpg)
11--CCENTER ENTER LLOCATION ON OCATION ON TTREE REE NNETWORKETWORKSTEPSSTEPS
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
41
41
6
8
2
148
16
14
5
11
![Page 10: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/10.jpg)
11--CCENTER ENTER LLOCATION ON OCATION ON TTREE REE NNETWORKETWORKSTEPSSTEPS
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
41
41
6
8
2
148
16
14
5
11
![Page 11: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/11.jpg)
11--CCENTER ENTER LLOCATION ON OCATION ON TTREE REE NNETWORKETWORKSTEPSSTEPS
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
41
41
6
8
2
16
![Page 12: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/12.jpg)
11--CCENTER ENTER LLOCATION ON OCATION ON TTREE REE NNETWORKETWORKSTEPSSTEPS
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
41
41
6
8
2
16
![Page 13: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/13.jpg)
11--CCENTER ENTER LLOCATION ON OCATION ON TTREE REE NNETWORKETWORKSTEPSSTEPS
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
41
41
6
8
2
16
12
18
24
21
1916
![Page 14: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/14.jpg)
11--CCENTER ENTER LLOCATION ON OCATION ON TTREE REE NNETWORKETWORKSTEPSSTEPS
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
41
41
6
8
2
16
12
18
24
21
1916
![Page 15: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/15.jpg)
11--CCENTER ENTER LLOCATION ON OCATION ON TTREE REE NNETWORKETWORKSTEPSSTEPS
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
41
41
6
8
2
16
24
![Page 16: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/16.jpg)
11--CCENTER ENTER LLOCATION ON OCATION ON TTREE REE NNETWORKETWORKRESULTRESULT
I
KL
J
G
C
F
E
A
B
H
D
7 53
5
41
41
6
8
2
24
1-center
![Page 17: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/17.jpg)
The Physical Analogy ModelThe Physical Analogy Model1-Center Algorithm:1-Center Algorithm:
1. Pick a tip node, call it v.1. Pick a tip node, call it v.
2. Find the tip node farthest away from v, call 2. Find the tip node farthest away from v, call it v’.it v’.
3. Find the tip node farthest away from v’, call 3. Find the tip node farthest away from v’, call it v”.it v”.
4. Find the midpoint of the path v’-v”. This is 4. Find the midpoint of the path v’-v”. This is the optimum 1-center location.the optimum 1-center location.
![Page 18: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/18.jpg)
Activity NO.2Activity NO.2Speedy Delivery:Speedy Delivery: Finding the Shortest Finding the Shortest
RouteRouteMr. Pete Zahat, the driver of a Pizza delivery in the Greater Houston area , wants to find the quickest route from the pizzeria (A) to the largest customer (E) before the pizza becomes cold. What route from A to E do you think requires the least time for him to take in order to satisfy his customers by delivering them really “Hot Pizzas” ?
![Page 19: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/19.jpg)
Speedy Delivery:Speedy Delivery: Finding the Shortest Route Finding the Shortest Route
Activity No. 2Activity No. 2
Hint:• First, find the time it takes for him
to travel between each given distances denoted by the line segments, using the given speed for each specific location. Use the formula
v=d/t or t=d/v
• Label the time between each node in the graph, and then use Dijktra’s Algorithm to find the shortest route. Fill up Table B as you do the Algorithm.
![Page 20: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/20.jpg)
DIAGRAM:DIAGRAM:
B
D
C
G
A
F
E
D=3 km v=30km/h
D=4 km v=60 km/h
D=1.5km v=30km/h
D=3.5km v=30km/hD=3.75km
v=45km/h
D=2.75km v=55km/h
D=3.5km v=30km/hD=2km
v=30km/h
D=5km v=60km/h
D=4km v=60km/h
D= 5km v=60km/h
t= 6 min t= 4 min
t= 3 mint= 7 mint= 5 min
t=3 min
t= 7 mint= 4 mint= 5 min
t= 4 min
t= 5 min
![Page 21: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/21.jpg)
Dijkstra’s Algorithm:Dijkstra’s Algorithm:
1.1. Circle the starting node(vertex). Examine all arcs (edges) Circle the starting node(vertex). Examine all arcs (edges) that have that node as an endpoint. that have that node as an endpoint.
2. Examine all uncircled nodes that are adjacent to the circled 2. Examine all uncircled nodes that are adjacent to the circled nodes in the graph.nodes in the graph.
3. Using only circled nodes, find lengths of each path from 3. Using only circled nodes, find lengths of each path from starting point to those nodes in starting point to those nodes in step 2. step 2. Choose the node Choose the node and arc that yield the shortest path. Circle this node. Ties and arc that yield the shortest path. Circle this node. Ties are broken arbitrarily ( if two or more paths have the same are broken arbitrarily ( if two or more paths have the same total length, then you can choose either of them).total length, then you can choose either of them).
4. Repeat steps 2 and 3 until all nodes are circled. Using the 4. Repeat steps 2 and 3 until all nodes are circled. Using the labels and distances next to each node, you can back trace labels and distances next to each node, you can back trace the shortest path from each node to your starting point.the shortest path from each node to your starting point.
STEPS:
![Page 22: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/22.jpg)
STEPS:STEPS:
B
D
C
G
A
F
E
6 4
75
54
4
7
5
3
3
∞∞
∞∞
∞∞
0
![Page 23: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/23.jpg)
STEPS:STEPS:
B
D
C
G
A
F
E
6 4
75
54
4
7
5
3
3
∞ 4A∞
∞∞ 5A
∞∞
0
![Page 24: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/24.jpg)
STEPS:STEPS:
B
D
C
G
A
F
E
6 4
75
54
4
7
5
3
3
4A∞ 10B
∞∞ 5A
∞∞
0
![Page 25: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/25.jpg)
STEPS:STEPS:
B
D
C
G
A
F
E
6 4
75
54
4
7
5
3
3
4A10B 12F
∞ 8F
5A
∞ 12F∞
0
![Page 26: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/26.jpg)
STEPS:STEPS:
B
D
C
G
A
F
E
6 4
75
54
4
7
5
3
3
4A10B 13D
8F
5A
12F 12D∞ 13D
0
![Page 27: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/27.jpg)
STEPS:STEPS:
B
D
C
G
A
F
E
6 4
75
54
4
7
5
3
3
4A10B
8F
5A
12F 12D∞ 13D
0
![Page 28: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/28.jpg)
STEPS:STEPS:
B
D
C
G
A
F
E
6 4
75
54
4
7
5
3
3
4A10B
8F
5A
12D,F∞ 13D
0
![Page 29: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/29.jpg)
STEPS:STEPS:
B
D
C
G
A
F
E
6 4
75
54
4
7
5
3
3
4A10B
8F
5A
12D,F13D 16G
0
![Page 30: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/30.jpg)
STEPS:STEPS:
B
D
C
G
A
F
E
6 4
75
54
4
7
5
3
3
4A10B
8F
5A
12D,F13D
0
![Page 31: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/31.jpg)
RESULT:RESULT:
B
D
C
G
A
F
E
6 4
75
54
4
7
5
3
3
4A10B
8F
5A
12D,F13D
0
E
D F
A
![Page 32: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/32.jpg)
Dijkstra’s AlgorithmDijkstra’s AlgorithmCircled NodeCircled Node Adjacent Nodes Adjacent Nodes
(uncircled)(uncircled)Path (from A)Path (from A) Total TimeTotal Time
11stst A A 44
55
22ndnd B B FF
CCABFABF
ABCABC77
1010
33rdrd F F
GG
CCAFGAFG
AFCAFC
88
1212
1212
44thth D D ________________________
________________________
________________________
________________________
________________________
________________________
________________________
________________________
________________________
55thth C C NONENONE
66thth _____ _____ ________________ __________________ ________________________
77thth _____ _____ NONENONE
ABB
F AF
D AFD
![Page 33: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/33.jpg)
RRESEARCH ESEARCH PPROJECTROJECTSituation:Situation:
It has been an observation that many residents in It has been an observation that many residents in different neighborhoods in the Houston area are different neighborhoods in the Houston area are victims of theft and burglary. Most of these victims of theft and burglary. Most of these victims have a burglar alarm system installed in victims have a burglar alarm system installed in their houses. However, most of the time when the their houses. However, most of the time when the alarm goes off, when intruders or robbers breaks alarm goes off, when intruders or robbers breaks in, before the police could even arrive, the in, before the police could even arrive, the robbers are long gone with all the most expensive robbers are long gone with all the most expensive and valuable belongings they could get. and valuable belongings they could get.
![Page 34: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/34.jpg)
RRESEARCH ESEARCH PPROJECT cont…ROJECT cont…
Problem:Problem:
Design a network system in your area wherein Design a network system in your area wherein you could set the best possible location of a you could set the best possible location of a police station such that when their services are police station such that when their services are needed, they could reach the residents the needed, they could reach the residents the fastest and the earliest possible time.fastest and the earliest possible time.
Draw a model of your network system and Draw a model of your network system and explain your procedure on how to solve the explain your procedure on how to solve the problem.problem.
![Page 35: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/35.jpg)
AACKNOWLEDGEMENTCKNOWLEDGEMENT EE3 3 Organizing Committee led by Organizing Committee led by Dr. Jan RinehartDr. Jan Rinehart at Texas A & M at Texas A & M
University, College Station, TxUniversity, College Station, Tx
Dr. Bruce HerbertDr. Bruce Herbert, Facilitator, Facilitator EE33 Summer Institute for Secondary Science and Math Teachers, 2006 Summer Institute for Secondary Science and Math Teachers, 2006
Dr. Halit UsterDr. Halit Uster, Director of the , Director of the Logistics and Networked Systems Research Logistics and Networked Systems Research Laboratory,Laboratory, Department of Industrial and Systems Engineering, Texas A & M Department of Industrial and Systems Engineering, Texas A & M University, College Station, TX.University, College Station, TX.
Burcu B. KeskinBurcu B. Keskin (Ph.D. candidate) (Ph.D. candidate)
Other Members of the Logistics and Networked Systems Research LaboratoryOther Members of the Logistics and Networked Systems Research Laboratory Gopal EaswaranGopal Easwaran (Ph.D. candidate) (Ph.D. candidate) Panitan KewcharoenwongPanitan Kewcharoenwong (Ph.D. student) (Ph.D. student) Hui LinHui Lin (Ph. D. student) (Ph. D. student) Richard A. IveyRichard A. Ivey (USRG, Summer 2006) (USRG, Summer 2006)
Annette CoronadoAnnette Coronado (Team member, E (Team member, E3 3 Summer Institute 2006) Summer Institute 2006)
![Page 36: L ESSON ON N ETWORKS: Finding the Shortest Route and 1-Center Location](https://reader033.fdocuments.us/reader033/viewer/2022042608/5681339b550346895d9aac99/html5/thumbnails/36.jpg)
RREFERENCESEFERENCES Krajewski, Lee., Ritzman, Larry P. “Operations Management Krajewski, Lee., Ritzman, Larry P. “Operations Management
Strategy and Analysis”,6Strategy and Analysis”,6thth edition, 2002 edition, 2002 Jay Heiser, Barry Render, “Operations Management”, 8Jay Heiser, Barry Render, “Operations Management”, 8THTH
edition, 2006edition, 2006 http://ie.tamu.edu/http://ie.tamu.edu/ http://hsor.org/modules.cfm?name=Speedy_Deliveryhttp://hsor.org/modules.cfm?name=Speedy_Delivery http://www.nasaexplores.com/show_912_teacher_st.php?idhttp://www.nasaexplores.com/show_912_teacher_st.php?id
=040402133024=040402133024 http://www.sciencejoywagon.com/physicszone/lessonch/o1http://www.sciencejoywagon.com/physicszone/lessonch/o1
motion/linear/velocity/avg.htmmotion/linear/velocity/avg.htm
http://www.teachengineering.comhttp://www.teachengineering.com