Scipediacontent: Scipediacontent moved page Draft Content 620311281 to Lee et al 2005b

2021-02-01T19:36:09Z

Scipediacontent moved page Draft Content 620311281 to Lee et al 2005b

Scipediacontent: Created page with " == Abstract == 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 o..."

2021-02-01T19:36:05Z

Created page with " == Abstract == 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 o..."

New page

== Abstract ==

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:

* [https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/atr.5670390106 https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/atr.5670390106]

* [http://core.ac.uk/display/1670007 http://core.ac.uk/display/1670007],
: [https://discovery.ucl.ac.uk/1340/1/2004_33.pdf https://discovery.ucl.ac.uk/1340/1/2004_33.pdf],
: [http://discovery.ucl.ac.uk/1340/1/2004_33.pdf http://discovery.ucl.ac.uk/1340/1/2004_33.pdf],
: [http://onlinelibrary.wiley.com/doi/10.1002/atr.5670390106/abstract http://onlinelibrary.wiley.com/doi/10.1002/atr.5670390106/abstract],
: [https://trid.trb.org/view/756360 https://trid.trb.org/view/756360],
: [http://discovery.ucl.ac.uk/55745 http://discovery.ucl.ac.uk/55745],
: [https://core.ac.uk/display/1670007 https://core.ac.uk/display/1670007],
: [https://academic.microsoft.com/#/detail/1982566726 https://academic.microsoft.com/#/detail/1982566726]

* [https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fatr.5670390106 https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fatr.5670390106],
: [http://dx.doi.org/10.1002/atr.5670390106 http://dx.doi.org/10.1002/atr.5670390106] under the license http://doi.wiley.com/10.1002/tdm_license_1.1

* [https://discovery.ucl.ac.uk/id/eprint/1340 https://discovery.ucl.ac.uk/id/eprint/1340],
: [https://discovery.ucl.ac.uk/id/eprint/1340/1/2004_33.pdf https://discovery.ucl.ac.uk/id/eprint/1340/1/2004_33.pdf]

← Older revision	Revision as of 19:36, 1 February 2021
(No difference)

Lee et al 2005b - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 620311281 to Lee et al 2005b

Scipediacontent: Created page with " == Abstract == 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 o..."