Abstract
Today artificial intelligence systems support efficient management in different fields of social activities. In particular, congestion control in modern networks seems to be impossible without proper mathematical models of traffic flow assignment. Thus, the network design problem can be referred to as Stackelberg game with independent lower-level drivers acting in a non-cooperative manner to minimize individual costs. In turn, upper-level decision-maker seeks to minimize overall travel time in the network by investing in its capacity. Hence, the decision-maker faces the challenge with a hierarchical structure which solution important due to its influence on the sustainable development of modern large cities. However, it is well-known that a bilevel programming problem is often strongly NP-hard, while the hierarchical optimization structure of a bilevel problem raises such difficulties as non-convexity and discontinuity. The present paper is devoted to the network design problem with affine cost functions. First of all, we obtain exact optimality conditions to the network design problem in a case of a single-commodity network with non-interfering routes. Secondly, we show that obtained conditions can be exploited as optimization strategies for solving the network design problem in the case of an arbitrary network with affine cost functions. These findings give fresh managerial insights to traffic engineers dealing with network design.
Similar content being viewed by others
Data Availability
The datasets analysed during the current study are available in the GitHub repository, https://github.com/bstabler/TransportationNetworks.
References
Abdulaal, M., LeBlanc, L.J.: Continuous equilibrium network design models. Transp. Res. B 13(1), 19–32 (1979)
Chiou, S.: Bilevel programming for the continuous transport network design problem. Transp. Res. B 39(4), 361–383 (2005)
Dempe, S., Kalashnikov, V., Prez-Valds, G.A., Kalashnykova, N.: Bilevel Programming Problems: Theory, Algorithms and Applications to Energy Networks. Springer, Berlin (2015)
Farahani, R.Z., Miandoabchi, E, Szeto, W.Y., Rashidi, H.: A review of urban transportation network design problems. Eur. J. Oper. Res. 229, 281–302 (2013)
Friesz, T.L., Cho, H.-J., Mehta, N.J., Tobin, R.L., Anandalingam, G.: A simulated annealing approach to the network design problem with variational inequality constraints. Transp. Sci. 26(1), 1–68 (1992)
Krylatov, A., Zakharov, V., Tuovinen, T.: Principles of Wardrop for traffic assignment in a road network. Springer Tracts Transport. Traffic 15, 17–43 (2020)
Krylatov, A., Zakharov, V., Tuovinen, T.: Topology optimization of road networks. Springer Tracts on Transport. Traffic 15, 121–140 (2020)
Li, C., Yang, H., Zhu, D., Meng, Q.: A global optimization method for continuous network design problems. Transp. Res. B 46(9), 1144–1158 (2012)
Marcotte, P., Marquis, G.: Efficient implementation of heuristics for the continuous network design problem. Ann. Oper. Res. 34(1), 163–176 (1992)
Marcotte, P.: Network optimization with continuous control parameters. Transp. Sci. 17(2), 181–197 (1983)
Meng, Q., Yang, H., Bell, M.G.H.: An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transport. Res. B 35, 83–105 (2001)
Migdalas, A.: Bilevel programming in traffic planning: models, methods and challenge. J. Glob. Optim. 7, 381–405 (1995)
Patriksson, M: The Traffic Assignment Problem: Models and Methods. VSP, Utrecht, The Netherlands (1994)
Smith, J.C., Song, Y.: A survey of network interdiction models and algorithms. Eur. J. Oper. Res. 283(3), 797–811 (2020)
Suh, S., Kim, T.: Solving nonlinear bilevel programming models of the equilibrium network design problem: a comparative review. Ann. Oper. Res. 34(1), 203–218 (1992)
Suwansirikul, C., Friesz, T.L., Tobin, R.L.: Equilibrium decomposed optimization: a heuristic for the continuous equilibrium network design problem. Transp. Sci. 21(4), 227–292 (1987)
Tobin, R.L., Friesz, T.L.: Sensitivity analysis for equilibrium network flow. Transp. Sci. 22(4), 231–293 (1988)
Tobin, R.L.: Sensitivity analysis for variational inequalities. J. Optim. Theory Appl. 48(1), 191–204 (1986)
Yang, H., Bell, M.G.H.: Models and algorithms for road network design: a review and some new developments. Transp. Rev. 18(3), 257–278 (1998)
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing interests
The authors have no competing interests to declare that are relevant to the content of this article.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The work was supported by a grant from the Russian Science Foundation (No. 22-71-10063 Development of intelligent tools for optimization multimodal flow assignment systems in congested networks of heterogeneous products).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Krylatov, A., Raevskaya, A. & Ageev, P. Optimization strategies for the bilevel network design problem with affine cost functions. Ann Math Artif Intell 91, 329–347 (2023). https://doi.org/10.1007/s10472-022-09828-9
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-022-09828-9
Keywords
- Bilevel optimization
- Network design problem
- Congestion games
- Affine cost functions
- Optimization strategies