Professional Documents
Culture Documents
Route
Route
Closest
Closest Facility
Facility
Service
Service Area
Area
Origin-Destination
Origin-Destination
• Uses Network Datasets (OD)
(OD) Cost
Cost Matrix
Matrix
Specialized layers
Network
• Network layer Layer
– References a network dataset
– Appears in table of contents Network
and Network Analyst toolbar Analysis
Layer
Network
Network Analyst
Analyst
toolbar
toolbar
Network
Network Analyst
Analyst toolbox
toolbox
Geoprocessing
Geoprocessing Tools
Tools
Network
Network Analyst
Analyst
Window
Window
Network Analyst in Geoprocessing
Command
Command line
line
Model
Model
Input Make OD Network
Network Cost Matrix Analyst
Dataset Layer Layer
Script
Script
Tool
Tool dialog
dialog
Demo
7:00
7:00 AM
AM
9:45
9:45 AM
AM
7:30
7:30 AM
AM
8:00
8:00 AM
AM 7:45
7:45 AM
AM
10:00
10:00 AM
AM
Route
Route solver
solver result
result Route
Route solver
solver result
result with
with time
time windows
windows
Closest Facility solver
Cutoff
Cutoff == 55
• Direction of travel
Accident
Fire
Incident
Incident to
to facility
facility Facility
Facility to
to incident
incident
Directions
• Polygon type
or
Generalized
Generalized Detailed
Detailed
• Multiple facilities options
Separate
Separate polygons
per
polygons
per facility
facility
or Not
Not overlapping
overlapping
polygons
polygons
or Merge
Merge polygons
by
polygons
by break
break
• Overlap type
or
Rings
Rings Disks
Disks
Service Area polygon trimming options
• Trim Polygons
– Minimizes polygons in sparse areas
– Specify trim distance
Untrimmed
Untrimmed Polygons
Polygons Trimmed
Trimmed Polygons
Polygons (9.2)
(9.2)
Service Area line options
2 0 8
2
44 lines
lines
2 6 8
Breaks:
Breaks: 22 66 88
66 lines
lines
• Overlap options
or
22 Facilities
Facilities Overlapping
Overlapping Not
Not overlapping
overlapping
Origin-Destination Cost Matrix solver
Victoria vehicle’s
vehicle’s “right
“right
Right side of vehicle
Elementary side”
side”
Hierarchy
• Minimizes impedance while favoring higher order roads
• Basic assumption:
– Higher order roads are “faster” (time),
not necessarily “shorter” (distance)
• Hierarchy classifies network edges into three ranks when the
network dataset is built
– Ranks: lower number = higher order road
Primary
Secondary
Local
Reasons to use hierarchy
New
New York
York
Los
Los Angeles
Angeles
Exact
Exact route
route == Hierarchical
Hierarchical
Non-hierarchical
Non-hierarchical 1 1
30 30
10 10
2 2
Case 1
Good
Good quality
quality Poor
Poor quality
quality
Case 2
Good
Good quality
quality Poor
Poor quality
quality
Creating coincident geometry
– Any vertex
0
0
0
Intersection
Intersection
0
0
0
0
0
1
Overpass
Overpass
0
1
0
0
Network attributes
Length
Drivetime
Length = 100
Drivetime = 10
Oneway
Oneway = false
Speed = 10 Length = 0
Speed Drivetime = 2
Oneway = false
Speed = 5
Distance
Distance == 1000
1000 mm
Drivetime
Drivetime == 55 min
min
Walktime
Walktime == 20
20 min
min
One-way
One-way directionality
directionality Restricted
Restricted turns
turns
F_endpoint T_endpoint
FT
FT directionality
directionality
F_endpoint T_endpoint
TF
TF directionality
directionality
Hierarchy attributes
1 = highway
2 = major road
3 = local street
Descriptor attributes
22 lanes
lanes 44 lanes
lanes Dirt
Dirt Road
Road Pavement
Pavement
Evaluators
Attribute Evaluator
Length Field – assign the [meters] field
• Network Dataset
• Web Editing
Multimodal example
rail
rail line
line
local
local street
street
exit
exit points
points
ramp
ramp
Yellow
Yellow bus
bus station
station
Yellow
Yellow bus
bus line
line rail
rail station
station
walking
walking path
path
Blue
Blue bus
bus station
station highway
highway
Blue
Blue bus
bus line
line