Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research › peer-review
Parallel Decomposition of a Road Network. / Krylatov, Alexander; Zakharov, Victor; Tuovinen, Tero.
Optimization Models and Methods for Equilibrium Traffic Assignment. Cham : Springer Nature, 2020. p. 101-118 (Springer Tracts on Transportation and Traffic; Vol. 15).Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research › peer-review
}
TY - CHAP
T1 - Parallel Decomposition of a Road Network
AU - Krylatov, Alexander
AU - Zakharov, Victor
AU - Tuovinen, Tero
N1 - Krylatov A., Zakharov V., Tuovinen T. (2020) Parallel Decomposition of a Road Network. In: Optimization Models and Methods for Equilibrium Traffic Assignment. Springer Tracts on Transportation and Traffic, vol 15. Springer, Cham
PY - 2020/1/1
Y1 - 2020/1/1
N2 - In this chapter a new road network decomposition approach is proposed. Necessary statements are proved in the first section, and the formal description of the approach as well as a brief review on relevant references are presented. The offered approach is completely based on the very features of the equilibrium traffic assignment and, consequently, forms the methodological basis for direct solving algorithms. The implementation of the developed approach to a single-commodity network can be found in the second section. A new decomposition technique for route-flow assignment in a general topology network is presented in the third section. The fourth section is reserved for a decomposition technique for link-flow assignment in a general topology network. Moreover, capabilities for route-flows aggregation and link-flows disaggregation which appeared by virtue of the new approach are discussed.
AB - In this chapter a new road network decomposition approach is proposed. Necessary statements are proved in the first section, and the formal description of the approach as well as a brief review on relevant references are presented. The offered approach is completely based on the very features of the equilibrium traffic assignment and, consequently, forms the methodological basis for direct solving algorithms. The implementation of the developed approach to a single-commodity network can be found in the second section. A new decomposition technique for route-flow assignment in a general topology network is presented in the third section. The fourth section is reserved for a decomposition technique for link-flow assignment in a general topology network. Moreover, capabilities for route-flows aggregation and link-flows disaggregation which appeared by virtue of the new approach are discussed.
UR - http://www.scopus.com/inward/record.url?scp=85076737905&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/a880b879-3961-3d26-893d-1a371c00fc68/
U2 - 10.1007/978-3-030-34102-2_5
DO - 10.1007/978-3-030-34102-2_5
M3 - Chapter
AN - SCOPUS:85076737905
SN - 9783030341015
T3 - Springer Tracts on Transportation and Traffic
SP - 101
EP - 118
BT - Optimization Models and Methods for Equilibrium Traffic Assignment
PB - Springer Nature
CY - Cham
ER -
ID: 50385934