Abstract

In the previous studies of transportation network design, it was assumed that the network is managed by a central administrative authority with the objective of improving the performance of the whole network. In fact, a transportation network may comprise of multiple local administrative regions, which might be independently and separately managed by multiple local transportation administrative authorities with mutual competitive objectives. In this paper, we put forward competitive and cooperative network design schemes for multiple regions based on the bi-level programming model, and explore the behaviors of local regions under both Nash and Stackelberg games. Meanwhile, the simulated annealing algorithm is employed to solve the problems in question. The result of numerical example indicates that the cooperation among local regions in continuous network design can enhance overall system performance in terms of total travel cost minimization. Furthermore, it is observed that the Stackelberg game gives inferior result in reducing overall network travel cost, compared with the Nash game.

Paper Details