Show simple item record

FieldValueLanguage
dc.contributor.authorZhu, William
dc.contributor.authorHensher, David A.
dc.date.accessioned2018-11-20
dc.date.available2018-11-20
dc.date.issued1995-02-01
dc.identifier.urihttp://hdl.handle.net/2123/19094
dc.description.abstractExisting approaches to estimating origin-destination trip matrices (O-D) from traffic counts are often limited by the size of a network. These approaches concentrate on achieving a target O-D matrix obtained elsewhere (eg from previous data or a sample survey). With the inconsistency in flow sampling and bias target matrix estimation, incorrect results may be obtained. This paper recognises that specifying a target matrix in the objective function of some existing models may not resolve the problem of uniqueness for congested networks. As an alternative approach to overcoming the bias estimation often associated with the specification of a target trip matrix, the paper formulates a non-linear programming model which incorporates production and attraction information and inconsistency in the traffic counts, and a network model for extending sampled traffic counts to network population flows. Heuristics for solving the formulated models are presented, together with a case study.en_AU
dc.relation.ispartofseriesITS-WP-95-3en_AU
dc.titleESTIMATION OF AN ORIGIN-DESTINATION TRIP MATRIX FROM LINK TRAFFIC COUNTS FOR LARGE NETWORKSen_AU
dc.typeWorking Paperen_AU
dc.contributor.departmentITLSen_AU


Show simple item record

Associated file/s

Associated collections

Show simple item record

There are no previous versions of the item available.