The continuous network design problem (CNDP) is known to be difficult to solve due to the intrinsic properties of non-convexity and nonlinearity. Such kinds of CNDP can be formulated as a bi-level programme, in which the upper level represents the designer's decisions and the lower level the travellers' responses. Formulations of this kind can be classified as either Stackelberg approaches or Nash ones according to the relationship between the upper level and the lower level parts. This paper formulates the CNDP for road expansion based on Stackelberg game where leader and follower exist, and allows for variety of travellers' behaviour in choosing their routes. In order to solve the problem by the Stackelberg approach, we need a relation between link flows and design parameters. For this purpose, we use a logit route choice model, which provides this in an explicit closed-form function. This model is applied to two example road networks to test and briefly compare the results between the Stackelberg and Nash approaches to explore the differences between them.

Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1002/atr.5670390106 under the license http://doi.wiley.com/10.1002/tdm_license_1.1
Back to Top

Document information

Published on 01/01/2005

Volume 2005, 2005
DOI: 10.1002/atr.5670390106
Licence: Other

Document Score


Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?