The equilibrium network design problem can be formulated as a mathematical program with variational inequality constraints. We know this problem is nonconvex; hence, it is difficult to solve for a globally optimal solution. In this paper we propose a simulated annealing algorithm for the equilibrium network design problem. We demonstrate the ability of this algorithm to determine a globally optimal solution for two different networks. One of these describes an actual city in the midwestern United States.
CITATION STYLE
Friesz, T. L., Cho, H. J., Mehta, N. J., Tobin, R. L., & Anandalingam, G. (1992). Simulated annealing approach to the network design problem with variational inequality constraints. Transportation Science, 26(1), 18–26. https://doi.org/10.1287/trsc.26.1.18
Mendeley helps you to discover research relevant for your work.