IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v391y2012i1p285-290.html
   My bibliography  Save this article

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

Author

Listed:
  • Gao, Liang
  • Si, Bingfeng
  • Yang, Xiaobao
  • Sun, Huijun
  • Gao, Ziyou

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).

Suggested Citation

  • Gao, Liang & Si, Bingfeng & Yang, Xiaobao & Sun, Huijun & Gao, Ziyou, 2012. "A matrix method for finding last common nodes in an origin-based traffic assignment problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 285-290.
    • Handle: RePEc:eee:phsmap:v:391:y:2012:i:1:p:285-290
    DOI: 10.1016/j.physa.2011.07.048
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437111005978
    Download Restriction: 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
    File URL: https://libkey.io/10.1016/j.physa.2011.07.048?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:391:y:2012:i:1:p:285-290. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.