Decomposition of Path Choice Entropy in General Transport Networks

DOI10.1287/TRSC.31.4.349MaRDI QIDQ4233779zbMATH OpenOpenAlexFDO

Authors Takashi Akamatsu

Publication date 15 September 1999

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.31.4.349

zbMATH Keywords

general transport networkspath choice entropystochastic user equilibrium assignment

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Recommendations

• The combined distribution and stochastic assignment problem
• A convergent and efficient decomposition method for the traffic assignment problem
• scientific article; zbMATH DE number 1488060
• scientific article; zbMATH DE number 1867319
• Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms

Cited in

(9)

• Markovian traffic equilibrium
• A distributed computing method integrating improved gradient projection for solving stochastic traffic equilibrium problem
• An integrated behavioral model of land use and transport system: A hyper-network equilibrium approach
• On the uniqueness of user equilibrium flow with speed limit
• Sparse randomized shortest paths routing with Tsallis divergence regularization
• Characteristic functions of directed graphs and applications to stochastic equilibrium problems
• Randomized Shortest-Path Problems: Two Related Models
• Equilibrium routing under uncertainty
• Bounding the inefficiency of the C-logit stochastic user equilibrium assignment

This page was built for publication: Decomposition of Path Choice Entropy in General Transport Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4233779)