A matrix method for finding last common nodes in an origin-based traffic assignment problem

Liang Gao, Bingfeng Si, Xiaobao Yang, Huijun Sun and Ziyou Gao

Physica A: Statistical Mechanics and its Applications, 2012, vol. 391, issue 1, 285-290

Abstract: Many algorithms have been presented to solve the traffic assignment problem. Recently, Bar-Gera introduced the concept of “last common node” into an origin-based algorithm to solve the traffic assignment problem. However, how to find the last common nodes has not been investigated in detail. In this paper, we present a matrix method for finding the last common nodes in an origin-based traffic assignment problem. In an acyclic network, the power of binary adjacency matrix (Ak) will record the number of directed simple routes of length k. Taking this feature into consideration, Sp, the total number of the simple routes related to an origin node p in the subnetwork Gp, is counted by Sp=∑kApk=(I−Ap)−1. Then, every common node for OD pair pq is picked out by comparing (Sp)pr×(Sp)rq and (Sp)pq, and the last common node for OD pair pq is filtered out according to the topological order l(r). Our method is implemented to find out all LCNs for all n∗(n−1) OD pairs, then tested on three kinds of model networks and four urban transportation networks. We find that the overall computing time T and the size of network n, has a relation like T∼O(n3), which is better than the theoretical estimation O(n4).

Keywords: Traffic assignment problem; Common node; Matrix method; Origin-based algorithm; Complex network (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437111005978
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:391:y:2012:i:1:p:285-290

DOI: 10.1016/j.physa.2011.07.048

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().