Hot-Starting the Traffic Assignment Problem by Zone Aggregation and Disaggregation

ResearchSpace/Manakin Repository

Show simple item record

dc.contributor.advisor Raith, A en
dc.contributor.author Ruddell, Keith en
dc.date.accessioned 2013-09-27T01:59:37Z en
dc.date.issued 2013 en
dc.identifier.uri http://hdl.handle.net/2292/20813 en
dc.description Full text is available to authenticated members of The University of Auckland only. en
dc.description.abstract Given a traffic network subject to congestion and given demand for travel between origins and destinations within the network, a user equilibrium is a pattern of flow that satisfies this demand and where no user can reduce their travel time by taking a different path. This can be framed as a minimisation problem with non-linear objective — the Traffic Assignment Problem (TAP). Several algorithms exist for solving TAP that start with an initial feasible solution. It is standard practice to use for an initial feasible solution the so-called all-or-nothing flow allocation, where all flow simply follows the shortest path ignoring congestion. We develop the approach of solving TAP on a simplified aggregated network and then translating this optimal solution into a feasible solution on the full network. An obvious, and effective, simplification is to group neighbouring origin and destination nodes together ignoring local traffic between them. Projecting the resulting solution onto the full network we start closer to the optimum and so require fewer expensive iterations of the full-network problem to arrive at an acceptable solution. We present our new Centroid Aggregation algorithm in detail and discuss the problem of finding effective partitions of the zone set. We test the algorithm on some mid-sized instances of TAP and find that time savings of up to 70 percent are possible. Key words: Traffic Assignment Problem, Graph Theory, Networks, Network equilibrium, Graph abstraction, Algorithms. en
dc.publisher ResearchSpace@Auckland en
dc.relation.ispartof Masters Thesis - University of Auckland en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights Restricted Item. Available to authenticated members of The University of Auckland. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/3.0/nz/ en
dc.title Hot-Starting the Traffic Assignment Problem by Zone Aggregation and Disaggregation en
dc.type Thesis en
thesis.degree.grantor The University of Auckland en
thesis.degree.level Masters en
dc.rights.holder Copyright: The Author en
pubs.elements-id 406829 en
pubs.record-created-at-source-date 2013-09-27 en


Full text options

This item appears in the following Collection(s)

Show simple item record

http://creativecommons.org/licenses/by-nc-sa/3.0/nz/ Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc-sa/3.0/nz/

Share

Search ResearchSpace


Advanced Search

Browse