MODULE 3

Transport Networks and Maps

✓ Maps have always occupied a central role in planning

✓ Digital maps provide an unlimited range of map views

and printed products that enrich everyone’s
understanding of existing and planned development,
locations for new facilities, and accessibility provided
by transport

2
✓ GIS have made a powerful contribution to planning by
making it possible to collect, create, and manage vital
data needed for many forms of planning

✓ The increasing spatial resolution of available data is

enlarging the quantity and quality of planning
applications

3
 Representation of Transportation
Networks
• The relationship between the links and the nodes, referred to as the
network topology, can be specified by a link-node incidence matrix.
• A transport network may be formally represented as a set of links
and a set of nodes.
• A link connects two nodes and a node connects two or more links.
• Links may be either directed, in which case they specify the
direction of movement, or undirected.
• Two links are said to be parallel if they connect the same pair of
nodes in the same direction.
• A loop is a link with the same node at either end 4
• Links may have various characteristics.
• link length (in metres or perhaps in average number of vehicles);
• link cost (sometimes travel time but more generally a linear combination of time and
• distance); and
• Link capacity (maximum flow).
• A link may be regarded as a conduit for flow whose units of measurement will
depend on the application

5
• A movement in a transportation network corresponds to a flow with a
distinct origin and destination.
• Origins and destinations may correspond to specific buildings, like a house
or an office, or to zones, depending on the level of aggregation.
• From the perspective of a transportation network, an origin or destination is
represented by a kind of node, referred to as a centroid
• Each centroid is connected to one or more internal nodes by a kind of link
referred to as a centroid connector (or just a connector)
6
Sample Network

7
 Path, Tree and Cycle
• A path, is a sequence of distinct nodes connected in one direction by links;
• a cycle, is a path connected to itself at the ends;
• a tree, is a network where every node is visited once and only once; and
• a cutset, is a minimal collection of links whose removal from the network
would cut the network in two with no links between the two resulting sub-
networks

8
Example for Path, Tree and Cycle

9
 Types of Transportation Network
• linear network,
• characterizing perhaps an expressway, an arterial road or a railway line.
• There may be many origins and destinations but no choice of path.
• the grid network,
• representing perhaps an urban area consisting of blocks as is common in the USA and
Japan.
• There may be many origins and destinations as well as many alternative routes
• Junctions
• may be represented in different ways, depending on the context
10
Example junction

11
Representation of junction

12
 Representation of Trips
• Trips can be made by either an individual mode, like a car or a bicycle, or a
community mode, like a bus or a tram.
• Trips can also be made by different kinds of infrastructure, like road, rail,
canal or air.
• Mode and infrastructure choice can be combined in the same transportation
network.
• Each mode and kind of infrastructure has its own characteristics, which have
to be captured in sufficient detail.
13
 NETWORK DATA
• The core of a network dataset is a vector layer of polylines representing the paths of travel,
either precise geographic routes or schematic diagrams, known as edges.
• In addition, information is needed on the network topology, representing the connections
between the lines, thus enabling the transport from one line to another to be modeled.
Typically, these connection points, or nodes, are included as an additional dataset.[7]
• Both the edges and nodes are attributed with properties related to the movement or flow:
• Capacity, measurements of any limitation on the volume of flow allowed, such as the number
of lanes in a road, telecommunications bandwidth, or pipe diameter.
• Impedance, measurements of any resistance to flow or to the speed of flow, such as a speed
limit or a forbidden turn direction at a street intersection
• Cost accumulated through individual travel along the edge or through the node, commonly
elapsed time, in keeping with the principle of friction of distance.
• Flow volume, measurements of the actual movement taking place. This may be specific time-
encoded measurements collected using sensor networks such as traffic counters, or general
trends over a period of time, such as Annual average daily traffic (AADT).
 Incidence Matrices
• An incidence matrix is a table of binary or ternary variables stating
the presence or absence of a relationship between network elements
and other variables.
• The incidence matrix specifies the network topology.
• A useful matrix for network processing is the node-link incidence
matrix with elements:

15
• The node link matrix has the form

16
• The link-path incidence matrix has elements: akpij = 1 if path p from origin
i to destination j uses link k, and 0 otherwise.
• Or else akp = 1 if path p uses link k, and 0 otherwise.
• The link path incidence matrix has the form:

17
• The origin-destination-path matrix has the elements: bijp = 1 if path p
connects origin i with destination j, and 0 otherwise.
• And has the following form

18
 A Road Network with Dummy Links
These dummy
links connect the centroid
to the road layer based on
nearest neighbour road.
A dummy link has infinite
capacity and has a cost of
zero.

19
Road Network Mapping Procedure

20
 1. EXISTING MAPS (SCANNED)
➢ Scanned map having latitude and longitude – used
for georeferencing

21
 2. GEO-REFERENCING
• Set the map projection in relevant co-ordinate system.
• Data frame properties - Coordinate system – Geographic co-ordinate system – WGS
1984
• Set map unit as decimal degree (Data frame properties - General)

22
GEO-REFERENCING
(Contd.)

Scanned maps having latitude and

longitude (GCP)

23
 GEO-REFERENCING (Contd.)
• After identifying the GCP from
the scanned maps, select the
“Georeferencing” from the
toolbar.

• Then select “Add Control

Point” for selection of control
points from the source layer and
input X and Y into the dialog.

24
GEO-REFERENCING (Contd.)

25
 GEO-REFERENCING (Contd.)
1

View link table shows the total RMS error of georeferencing

26
3. DIGITIZATION OF ROAD NETWORK

Road network
27
 DIGITIZATION OF ROAD NETWORK(Contd.)
• Create a new shapefile (Road_Kazhakootam) having Feature type
‘Polyline’.

28
 DIGITIZATION OF ROAD NETWORK (Contd.)

Select start editing from ‘Editor’ toolbar Digitized road network and its attribute table
29
DIGITIZATION OF ROAD NETWORK (Contd.)

Digitized road network(Kazhakkootam) and its attribute table

30
 4. OVERLAY OF MAPS
• Overlay land use map and road
network of the study area.
• Database attachment

31
Attribute table 32
5. FINAL MAP

33
 Route Building
• Routes and Route Systems in a network indicate paths taken by trucks, rail,
cars, buses, or individuals traveling from place to place.
• GIS includes tools to create, display, edit, and manipulate routes, and unique
display technology for mapping routes in a clear and compelling fashion.
• A set of related routes can be organised into a single route system layer, and
include route attributes, stop locations, and vehicle schedules

34
A typical bus route network

35
 Route building
• Each route in a route system is defines as a series of one or more line features.
• The route system is one map layer, and the line features are stored in another layer in the
map. Some examples like
• A designated highway route composed of a series of highway line features
• A truck route based on a series of streets between delivery points
• A bus route defined by the series of streets over which the bus travels
• A subway route operating over elevated, surface, and underground rail line features

• In each of these cases, selected features from a regular line layer (highway, street, railroads)
are used to define a route
36
• When defining a route system, each line feature that is a part of a route is
referred as a segment.
• Every point is made up of a series of segments.
• Several routes in a route system may operate on the same segment.
• A route can be continuous, with all of its segments connected to each other.
• Route system can contain information about stops that are along a route.

37
 Route Stops
• When we create a route system, we can indicate whether to include route stops or not.
• Stops can be place anywhere along the route, and can be used for many different
applications.
• The stops on a bus route layer mark the locations where riders can board and disembark.
• Stops on a vehicle route mark the locations where the pickups or deliveries occur.
• Physical stops are of inventory places where route stops can occur.
• They are most often used for transit or rail routes and indicate the locations of stations,
junctions, or signs along the routes.
• Each physical stop is attributed to one side of a segment.
• Transit stops can be represented either by a point or by a node.
• Nodes are assigned to intersections where two or more lines meet, whereas points can be
positioned along the line

38
 NETWORK
DEVELOPMENT
 ROAD NETWORK
• OPEN GEO REFERENCED MAP
• CREATE A NEW SHAPE FILE
 OPEN ATTRIBUTE TABLE

ADD ATTRIBUTE
• ROAD NETWORK CAN DRAW USING POLYLINE
• NODE CAN BE DRAWN USING POINTS- AS A NEW LAYER IN THE
SAME SHAPEFILE –ADD ATTRIBUTE IN SAME WAY AS BEFORE

LAYAER PROPERTIES CAN BE

CHANGED
 FINDING THE ROUTE
• FOR EXAMPLE - biggest and
shortest between origin and
destination point
• By using network analysis tool

https://youtu.be/3tEH8PPQ_rM
Network development using CUBE

INPUTS
• LINK ATTRIBUTE TABLE
• NODE NUMBER AND ITS
X,Y CORODINATES
NEW LINK OR NODE
ATTRIBUTE CAN BE
ADDED

ADD ATTRIBUTE
NAME
 Shortest Path Algorithm
• The shortest-path algorithm calculates the shortest path from a start node to
each node of a connected graph.
• Developed in 1956 by Edsger W. Dijsktra, it is the basis for all the apps that
show you a shortest route from one place to another.
Shortest Path Problem