GRAPH MODEL FOR MINIMAL DISTANCE AND OPTIMAL CIRCULATION IN URBAN DESIGN
ABSTRACT: Among the important
aspects in urban design are minimal distance and optimal circulation of the traffic network
which include good
access to the
places of interests.
The main road
network is modeled in
graph where the
important places are
represented by vertices
and the main
roads between them are represented in edges. A graph is called
3-connected if for every pair of vertices, there are
three disjoint paths
connecting them. Given
the vertices and
their locations, this
paper focuses to make
a 3-connected graph
with minimal distance
connecting them. This
model is simulated in
a computer program
and applied in
a current road
network of Manado
City, North Sulawesi Indonesia to
see whether of not the road network in Manado is already optimal or not.
Author: Pingkan S. Pioh
Journal Code: jpbiologigg120005
