Genetic algorithm for multiuser discrete network design problem under demand uncertainty (Q1955077)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Genetic algorithm for multiuser discrete network design problem under demand uncertainty |
scientific article; zbMATH DE number 6173481
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Genetic algorithm for multiuser discrete network design problem under demand uncertainty |
scientific article; zbMATH DE number 6173481 |
Statements
Genetic algorithm for multiuser discrete network design problem under demand uncertainty (English)
0 references
11 June 2013
0 references
Summary: 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.
0 references
0 references