×

Robust bi-level optimization models in transportation science. (English) Zbl 1153.90360

Summary: Mathematical programmes with equilibrium constraints (MPECs) constitute important modelling tools for network flow problems, as they place ‘what-if’ analyses in a proper mathematical framework. We consider a class of stochastic MPEC traffic models that explicitly incorporate possible uncertainties in travel costs and demands. In stochastic programming terminology, we consider ‘here-and-now’ models where decisions must be made before observing the uncertain parameter values and the responses of the network users; the objective is to minimize the expectation of the upper-level objective function. Such a model could, for example, be used to derive a fixed toll pricing scheme that provides the best revenue for a given network over a time period, where variations in traffic conditions and demand elasticities are described by distributions of parameters in the travel time and demand functions.We present new results on the stability of globally optimal solutions to perturbations in the probability distribution, establishing the robustness of the model. We also discuss penalization and discretization algorithms, the latter enabling the use of standard MPEC algorithms, and provide many future research avenues.

MSC:

90B20 Traffic problems in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] TRANSPORT RES B 34 pp 533– (2000)
[2] MATH OPERAT RES 31 pp 739– (2006)
[3] TRANSPORT RES B 39 pp 119– (2005)
[4] TRANSPORT RES A 40 pp 602– (2006)
[5] STRUCT MULTIDISC OPTIM 25 pp 174– (2003)
[6] STRUCT MULTIDISC OPTIM 25 pp 189– (2003)
[7] J OPTIM THEORY APPL 121 pp 65– (2004)
[8] Z ANGEW MATH MECH 83 pp 479– (2003)
[9] SIAM J OPTIM 17 pp 259– (2006)
[10] STRUCT MULTIDISC OPTIM 22 pp 364– (2001)
[11] MATH PROGRAM 84 pp 313– (1999)
[12] J OPERAT RES SOC 49 pp 237– (1998) · Zbl 1111.90313 · doi:10.1057/palgrave.jors.2600523
[13] LE MATEMATICHE 49 pp 249– (1994)
[14] MATH PROGRAM 34 pp 142– (1986)
[15] IEEEACM TRANS NETW 13 pp 221– (2005)
[16] TRANSPORT SCI 36 pp 271– (2002)
[17] OPERAT RES LETT 25 pp 159– (1999)
[18] PHIL TRANS R SOC A 366 pp 1973– (2008)
[19] MATH OPERAT RES 5 pp 43– (1980)
[20] MATH OPERAT RES 21 pp 513– (1996)
[21] J OPTIM THEORY APPL 128 pp 223– (2006)
[22] TRANSPORT RES A 41 pp 644– (2007)
[23] TRANSPORT RES REC 1964 pp 81– (2006)
[24] SIAM J OPTIM 40 pp 521– (1994)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.