GENERALIZED SHORTEST PATH AND TRAFFIC EQUILIBRIUM IN COMPLEX TRANSPORTATION NETWORKS
From MaRDI portal
Publication:3499100
DOI10.1142/S021798490701350XzbMATH Open1137.90411OpenAlexW2013438381MaRDI QIDQ3499100FDOQ3499100
Publication date: 28 May 2008
Published in: Modern Physics Letters B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021798490701350x
Recommendations
- Effective usage of shortest paths promotes transportation efficiency on scale-free networks
- TRANSPORT ON COMPLEX NETWORKS: FLOW, JAMMING AND OPTIMIZATION
- Transport between multiple users in complex networks
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
- EFFECTS OF ROUTE GUIDANCE SYSTEMS ON SMALL-WORLD NETWORKS
Communication networks in operations research (90B18) Traffic problems in operations research (90B20)
Cites Work
Cited In (9)
- Effective usage of shortest paths promotes transportation efficiency on scale-free networks
- Title not available (Why is that?)
- Non-additive shortest path in the context of traffic assignment
- EFFECTS OF ROUTE GUIDANCE SYSTEMS ON SMALL-WORLD NETWORKS
- Integrating fluctuations into distribution of resources in transportation networks
- Minimizing the total travel time with limited unfairness in traffic networks
- The general traffic equilibrium problem in a stochastic network with travellers' risk aversion and inaccurate perceptions
- Optimal temporal path on spatial decaying networks
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
This page was built for publication: GENERALIZED SHORTEST PATH AND TRAFFIC EQUILIBRIUM IN COMPLEX TRANSPORTATION NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499100)
