Standard

Methods for Traffic Flow Assignment in Road Networks. / Krylatov, Alexander; Zakharov, Victor; Tuovinen, Tero.

Optimization Models and Methods for Equilibrium Traffic Assignment. Cham : Springer Nature, 2020. p. 73-100 (Springer Tracts on Transportation and Traffic; Vol. 15).

Research output: Chapter in Book/Report/Conference proceedingChapterResearchpeer-review

Harvard

Krylatov, A, Zakharov, V & Tuovinen, T 2020, Methods for Traffic Flow Assignment in Road Networks. in Optimization Models and Methods for Equilibrium Traffic Assignment. Springer Tracts on Transportation and Traffic, vol. 15, Springer Nature, Cham, pp. 73-100. https://doi.org/10.1007/978-3-030-34102-2_4

APA

Krylatov, A., Zakharov, V., & Tuovinen, T. (2020). Methods for Traffic Flow Assignment in Road Networks. In Optimization Models and Methods for Equilibrium Traffic Assignment (pp. 73-100). (Springer Tracts on Transportation and Traffic; Vol. 15). Springer Nature. https://doi.org/10.1007/978-3-030-34102-2_4

Vancouver

Krylatov A, Zakharov V, Tuovinen T. Methods for Traffic Flow Assignment in Road Networks. In Optimization Models and Methods for Equilibrium Traffic Assignment. Cham: Springer Nature. 2020. p. 73-100. (Springer Tracts on Transportation and Traffic). https://doi.org/10.1007/978-3-030-34102-2_4

Author

Krylatov, Alexander ; Zakharov, Victor ; Tuovinen, Tero. / Methods for Traffic Flow Assignment in Road Networks. Optimization Models and Methods for Equilibrium Traffic Assignment. Cham : Springer Nature, 2020. pp. 73-100 (Springer Tracts on Transportation and Traffic).

BibTeX

@inbook{febb47ea80384ad887e5db2e59f628cf,
title = "Methods for Traffic Flow Assignment in Road Networks",
abstract = "In this chapter is devoted to approaches for solving traffic flow assignment problems. The most popular gradient descent method for solving traffic assignment problems is discussed in the first section. New projection algorithms based on the obtained, explicitly fixed-point operators for the route-flow assignment problem and link-route assignment problem are presented in the third and fourth sections respectively. Obtained operators is proved to be contractive that leads to the linear convergence of provided algorithms. Moreover, under some fairly natural conditions the algorithms converge quadratically. The technique for representing a linear route-flow assignment problem in the form of a system of linear equations is presented in the fourth section. A simple example demonstrates the evident usability of the developed technique for its implementation and further extensions.",
author = "Alexander Krylatov and Victor Zakharov and Tero Tuovinen",
note = "Krylatov A., Zakharov V., Tuovinen T. (2020) Methods for Traffic Flow Assignment in Road Networks. In: Optimization Models and Methods for Equilibrium Traffic Assignment. Springer Tracts on Transportation and Traffic, vol 15. Springer, Cham",
year = "2020",
month = jan,
day = "1",
doi = "10.1007/978-3-030-34102-2_4",
language = "English",
isbn = "9783030341015",
series = "Springer Tracts on Transportation and Traffic",
publisher = "Springer Nature",
pages = "73--100",
booktitle = "Optimization Models and Methods for Equilibrium Traffic Assignment",
address = "Germany",

}

RIS

TY - CHAP

T1 - Methods for Traffic Flow Assignment in Road Networks

AU - Krylatov, Alexander

AU - Zakharov, Victor

AU - Tuovinen, Tero

N1 - Krylatov A., Zakharov V., Tuovinen T. (2020) Methods for Traffic Flow Assignment in Road Networks. 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 is devoted to approaches for solving traffic flow assignment problems. The most popular gradient descent method for solving traffic assignment problems is discussed in the first section. New projection algorithms based on the obtained, explicitly fixed-point operators for the route-flow assignment problem and link-route assignment problem are presented in the third and fourth sections respectively. Obtained operators is proved to be contractive that leads to the linear convergence of provided algorithms. Moreover, under some fairly natural conditions the algorithms converge quadratically. The technique for representing a linear route-flow assignment problem in the form of a system of linear equations is presented in the fourth section. A simple example demonstrates the evident usability of the developed technique for its implementation and further extensions.

AB - In this chapter is devoted to approaches for solving traffic flow assignment problems. The most popular gradient descent method for solving traffic assignment problems is discussed in the first section. New projection algorithms based on the obtained, explicitly fixed-point operators for the route-flow assignment problem and link-route assignment problem are presented in the third and fourth sections respectively. Obtained operators is proved to be contractive that leads to the linear convergence of provided algorithms. Moreover, under some fairly natural conditions the algorithms converge quadratically. The technique for representing a linear route-flow assignment problem in the form of a system of linear equations is presented in the fourth section. A simple example demonstrates the evident usability of the developed technique for its implementation and further extensions.

UR - http://www.scopus.com/inward/record.url?scp=85076788787&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/006f4359-60ef-3a8b-8981-72c3b3c42f38/

U2 - 10.1007/978-3-030-34102-2_4

DO - 10.1007/978-3-030-34102-2_4

M3 - Chapter

AN - SCOPUS:85076788787

SN - 9783030341015

T3 - Springer Tracts on Transportation and Traffic

SP - 73

EP - 100

BT - Optimization Models and Methods for Equilibrium Traffic Assignment

PB - Springer Nature

CY - Cham

ER -

ID: 50385293