Genetic Algorithm for Multiuser Discrete Network Design Problem under Demand Uncertainty

Discrete network design is an important part of urban transportation planning. The purpose of this paper is to present a bilevel model for discrete network design. The upper‐level model aims to minimize the total travel time under a stochastic demand to design a discrete network. In the lower‐level model, demands are assigned to the network through a multiuser traffic equilibrium assignment. Generally, discrete network could affect path selections of demands, while the results of the multiuser traffic equilibrium assignment need to reconstruct a new discrete network. An iterative approach including an improved genetic algorithm and Frank‐Wolfe algorithm is used to solve the bi‐level model. The numerical results on Nguyen Dupuis network show that the model and the related algorithms were effective for discrete network design.