A graph partitioning approach towards the automatic generation of transport analysis zones.

Author(s)
Guo, J.
Year
Abstract

In spatial analysis, it is often necessary to use aggregated data, either because the data is available only for predetermined spatial units, or to make the problem manageable. Zoning is a process where M input zones are grouped into N output zones so that various constraints are satisfied (for example, internal connectivity of the resulting zones, N is less than M). For the purpose of the zoning problem, the exact configuration of the boundaries of the input zones is not important. One possible abstraction is to represent the input zones as nodes of a graph, where each node in the graph represents a zone and each link represents the adjacency relation between zones. Using the graph representation as a convenient framework for solving the zoning problem, a zoning algorithm based on a modified graph partitioning problem (GPP) is proposed. (A)

Request publication

1 + 6 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
C 17304 (In: C 17291) /72 / ITRD E200129
Source

In: Papers of the Australasian Transport Research Forum ATRF, Sydney, September 1998, Volume 22, Part 2, p. 775-788, 17 ref.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.