Decomposition of Path Choice Entropy in General Transport Networks

Takashi Akamatsu
Additional contact information
Takashi Akamatsu: Department of Knowledge-Based Information Engineering, Toyohashi University of Technology, Toyohashi, Aichi 441, Japan

Transportation Science, 1997, vol. 31, issue 4, 349-362

Abstract: This paper shows that the LOGIT type stochastic assignment/stochastic user equilibrium assignment can be represented as an optimization problem with only link variables. The conventional entropy function defined by path flows in the objective can be decomposed into a function consisting only of link flows. The idea of the decomposed formulation is derived from a consideration of the most likely link flow patterns over a network. Then the equivalence of the decomposed formulation to LOGIT assignment is proved by using the Markov properties that underlie Dial's algorithm. Through the analyses, some useful properties of the entropy function and its conjugate dual function (expected minimum cost function) have been derived. Finally, it is discussed that the derived results have a potential impact on the development of efficient algorithms for the stochastic user equilibrium assignment.

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.31.4.349 (application/pdf)

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:inm:ortrsc:v:31:y:1997:i:4:p:349-362

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().