An Iterative Solution Approach for a Bi-level Optimization Problem for Congestion Avoidance on Road Networks

  • Andreas Britzelmeier
  • Alberto De Marchi
  • Matthias GerdtsEmail author
Part of the Springer INdAM Series book series (SINDAMS, volume 29)


The paper introduces an iterative solution algorithm for a bi-level optimization problem arising in traffic control. The bi-level problem consists of a shortest path problem on the upper level, which aims at minimizing the total path cost of a set of cars in a road network. The cost coefficients in the shortest path problem represent the expected driving time on each edge, accounting for congestions, and depend on the solutions of a set of lower level optimal control problems, each one describing the behavior of a single minimum-time driven car. On the other hand, each lower level problem is built upon the path planned by the upper level. This leads to a strong coupling between upper level problem and lower level problem. This coupling is decomposed by an iterative procedure fixing either the costs or the paths in the upper level and the lower level, respectively. Numerical experiments illustrate the procedure and indicate that the iterative algorithm leads to suitable distribution of cars in the network.


Bi-level optimization Traffic control Time-optimal control Network optimization Iterative methods 


  1. 1.
    Bertolazzi, E., Frego, M.: Semi-analytical minimum time solution for the optimal control of a vehicle subject to limited acceleration. Optimal Control Appl. Methods 39(2), 774–791 (2018)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bressan, A., Čanić, S., Garavello, M., Herty, M., Piccoli, B.: Flows on networks: recent results and perspectives. EMS Surv. Math. Sci. 1(1), 47–111 (2014)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Cristiani, E., Priuli, F.S.: A destination-preserving model for simulating Wardrop equilibria in traffic flow on networks. Netw. Heterogen Media 10(4), 857–876 (2015)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Cristiani, E., Piccoli, B., Tosin, A.: How can macroscopic models reveal self-organization in traffic flow? In: 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), pp. 6989–6994, 12 (2012)Google Scholar
  5. 5.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Garavello, M., Piccoli, B.: Traffic Flow on Networks. AIMS Series on Applied Mathematics. American Institute of Mathematical Sciences, Springfield, MO (2006)Google Scholar
  7. 7.
    Lighthill, M., Whitham, J.: On kinematic waves. Proc. R. Soc. Lond. 229(A), 281–345 (1955)zbMATHGoogle Scholar
  8. 8.
    Palagachev, K.D., Gerdts, M.: Numerical approaches towards bi-level optimal control problems with scheduling tasks. In: Ghezzi, L., Hömberg, D., Landry, C. (eds.) Math for the Digital Factory. Mathematics in Industry, vol. 27, pp. 205–228. Springer, Cham (2017). CrossRefGoogle Scholar
  9. 9.
    Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc., Upper Saddle River, NJ (1982)zbMATHGoogle Scholar
  10. 10.
    Richards, P.I.: Shock waves on the highway. Oper. Res. 4(1), 42–51 (1956)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proc. Inst. Civ. Eng. Part II 1(3), 325–362 (1952)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Andreas Britzelmeier
    • 1
  • Alberto De Marchi
    • 1
  • Matthias Gerdts
    • 1
    Email author
  1. 1.Department of Aerospace EngineeringBundeswehr University MunichNeubibergGermany

Personalised recommendations