Incorporating fast charging stations accessibility into an urban traffic assignment model based on the Frank – Wolfe algorithm

Authors

  • Du Sizhuo Belarusian National Technical University, 65 Niezaliezhnasci Avenue, Minsk 220013, Belarus
  • Denis S. Sarazhinsky Belarusian National Technical University, 65 Niezaliezhnasci Avenue, Minsk 220013, Belarus
  • Denis V. Kapski Belarusian National Technical University, 65 Niezaliezhnasci Avenue, Minsk 220013, Belarus , Academy of Public Administration under the President of the Republic of Belarus, 17 Maskowskaja Street, Minsk 220007, Belarus

Keywords:

electric vehicle, fast charging station, traffic assignment, Wardrop equilibrium, Frank – Wolfe algorithm

Abstract

The growing use of electric vehicles necessitates the adaptation of transport models to account for the specifics of their operation. The aim of this work is to modify the classic traffic assignment model based on the Frank – Wolfe algorithm, widely used in transportation planning, to accurately reflect electric vehicle charging processes in urban environments. The novelty of the research lies in the development of an approach that, unlike existing approaches, comprehensively addresses three key features: the requirement for an electric vehicle needing to charge to route through exactly one charging station; the possibility of routing along paths with cycles to access charging stations and subsequently reach the destination, considering urban road network constraints; the behavioural aspect of a user’s decision to forgo charging if the total time costs (including travel to the station and queuing) exceed a certain threshold. The paper also proposes a time-cost function that accounts for the specifics of the charging process, including queues and the number of charging spots. The results demonstrate that the classic traffic assignment model based on the Frank – Wolfe algorithm can indeed be modified to incorporate these features. It is noted that the proposed model may exhibit multiple equilibrium flow distributions, dependent on initial conditions. The practical significance of the work lies in its potential for more accurate modelling of traffic flows and the load on urban charging infrastructure.

Author Biographies

  • Du Sizhuo, Belarusian National Technical University, 65 Niezaliezhnasci Avenue, Minsk 220013, Belarus

    postgraduate student at the department of transport systems and technologies, automotive and tractor faculty

  • Denis S. Sarazhinsky, Belarusian National Technical University, 65 Niezaliezhnasci Avenue, Minsk 220013, Belarus

    PhD (physics and mathematics), docent; associate professor at the department of transport systems and technologies, automotive and tractor faculty

  • Denis V. Kapski, Belarusian National Technical University, 65 Niezaliezhnasci Avenue, Minsk 220013, Belarus, Academy of Public Administration under the President of the Republic of Belarus, 17 Maskowskaja Street, Minsk 220007, Belarus

    doctor of science (engineering), full professor; professor at the department of transport systems and technologies, automotive and tractor faculty, Belarusian National Technical University, and professor at the department of information resources management, Institute of Managerial Personnel, Academy of Public Administration under the President of the Republic of Belarus

References

  1. Fukushima M. A modified Frank – Wolfe algorithm for solving the traffic assignment problem. Transportation Research. Part B, Methodological. 1984;18(2):169–177. DOI: 10.1016/0191-2615(84)90029-8.
  2. Dafermos SC, Sparrow FT. The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards. Section B, Mathematical Sciences. 1969;73B(2):91–118. DOI: 10.6028/JRES.073B.010.
  3. Li F, Wang S. Determining route traffic flows for traffic assignment problem with Frank – Wolfe algorithm. In: Institute of Electrical and Electronics Engineers. Proceedings of the 2005 IEEE intelligent vehicles symposium; 2005 June 6–8; Las Vegas, USA. [S. l.]: Institute of Electrical and Electronics Engineers; 2005. p. 669–673. DOI: 10.1109/IVS.2005.1505180.
  4. Wardrop JG. Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers. 1952;1(3):325–362. DOI: 10.1680/ipeds.1952.11259.
  5. Shvetsov VI. Mathematical modeling of traffic flows. Automation and Remote Control. 2003;64(11):1651–1689. DOI: 10.1023/A:1027348026919.
  6. Pokutta S. The Frank – Wolfe algorithm: a short introduction. Jahresbericht der Deutschen Mathematiker-Vereinigung. 2024;126(1):3–35. DOI: 10.1365/s13291-023-00275-x.
  7. Bolte J, Combettes CW, Pauwels E. The iterates of the Frank – Wolfe algorithm may not converge [Internet]. Toulouse: Toulouse School of Economics; 2022 [cited 2025 May 7]. 15 p. (TSE working papers; number 1311). Available from: https://www.tse-fr.eu/sites/default/files/TSE/documents/doc/wp/2022/wp_tse_1311.pdf.
  8. Frank M, Wolfe P. An algorithm for quadratic programming. Naval Research Logistics Quarterly. 1956;3(1–2):95–110. DOI: 10.1002/nav.3800030109.
  9. Froger A, Jabali O, Mendoza JE, Laporte G. The electric vehicle routing problem with capacitated charging stations. Transportation Science. 2022;56(2):460–482. DOI: 10.1287/trsc.2021.1111.
  10. Graf L, Harks T, Palkar P. Dynamic traffic assignment for electric vehicles. Transportation Research. Part B, Methodological. 2025;195:103207. DOI: 10.1016/j.trb.2025.103207.
  11. Liu B, Pantelidis TP, Tam S, Chow JYJ. An electric vehicle charging station access equilibrium model with M/D/C queueing. International Journal of Sustainable Transportation. 2023;17(3):228–244. DOI: 10.1080/15568318.2022.2029633.
  12. Ferro G, Minciardi R, Parodi L, Robba M. Optimal planning of charging stations and electric vehicles traffic assignment: a bi-level approach. IFAC – Papers Online. 2020;53(2):13275–13280. DOI: 10.1016/j.ifacol.2020.12.157.
  13. Gross D, Shortle JF, Thompson JM, Harris CM. Fundamentals of queueing theory. 4th edition. Hoboken: John Wiley & Sons; 2008. XIII, 509 p. (Wiley series in probability and statistics). DOI: 10.1002/9781118625651.
  14. Grassmann W. The convexity of the mean queue size of the M/M/c queue with respect to the traffic intensity. Journal of Applied Probability. 1983;20(4):916–919. DOI: 10.2307/3213605.
  15. Sheffi Y. Urban transportation networks: equilibrium analysis with mathematical programming methods. Englewood Cliffs: Prentice-Hall; 1985. XVI, 399 p.

Downloads

Additional Files

Published

2026-06-03

Issue

No. 1 (2026): Journal of the Belarusian State University. Mathematics and Informatics

Section

Discrete Mathematics and Mathematical Cybernetics

License

Copyright (c) 2026 Journal of the Belarusian State University. Mathematics and Informatics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

The authors who are published in this journal agree to the following:

  1. The authors retain copyright on the work and provide the journal with the right of first publication of the work on condition of license Creative Commons Attribution-NonCommercial. 4.0 International (CC BY-NC 4.0).
  2. The authors retain the right to enter into certain contractual agreements relating to the non-exclusive distribution of the published version of the work (e.g. post it on the institutional repository, publication in the book), with the reference to its original publication in this journal.
  3. The authors have the right to post their work on the Internet (e.g. on the institutional store or personal website) prior to and during the review process, conducted by the journal, as this may lead to a productive discussion and a large number of references to this work. (See The Effect of Open Access.)

How to Cite

[1]
Sizhuo, D. et al. 2026. Incorporating fast charging stations accessibility into an urban traffic assignment model based on the Frank – Wolfe algorithm. Journal of the Belarusian State University. Mathematics and Informatics. 1 (Jun. 2026), 81–93.