Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 686272, 17 pages
Research Article

Genetic Algorithm for Multiuser Discrete Network Design Problem under Demand Uncertainty

1Institute of Transportation Engineering, Tsinghua University, Beijing 100084, China
2Academy of Military Transportation, Tianjin 300161, China
3Transport Planning and Research Institute, Ministry of Transport, Beijing 100028, China
4China Academy of Urban Planning and Design, Beijing 100044, China

Received 6 September 2012; Accepted 29 October 2012

Academic Editor: Baozhen Yao

Copyright © 2012 Wu Juan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.