Bilevel programming applied to optimising urban transportation

Citation
J. Clegg et al., Bilevel programming applied to optimising urban transportation, TRANSP R B, 35(1), 2001, pp. 41-70
Citations number
41
Categorie Soggetti
Politucal Science & public Administration","Civil Engineering
Journal title
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
ISSN journal
01912615 → ACNP
Volume
35
Issue
1
Year of publication
2001
Pages
41 - 70
Database
ISI
SICI code
0191-2615(200101)35:1<41:BPATOU>2.0.ZU;2-T
Abstract
This paper outlines a multi-modal, elastic, equilibrium transportation mode l in which signal green-times and prices charged to traverse a route (publi c transport fares, parking charges or road-use charges) are explicitly incl uded. An algorithm is specified which, for a fairly general objective funct ion, continually moves current traffic flows, green-times and prices within the model toward locally optimal values while taking account of users' res ponses. The directions of movement of current traffic flows, green-times an d prices are determined by solving linear approximations to the actual prob lem. The results of applying a simplified form of the algorithm to a small network model with five routes and two signal-controlled junctions are give n. It is proved that under realistic conditions the sequence of (traffic flows , green-times, prices) triples generated by the algorithm does indeed appro ach those triples which possess a reasonable local optimality property. How ever the optimal control problem discussed here is non-convex and just a Ka rush-Kuhn-Tucker point is the "answer" sought. (C) 2000 Elsevier Science Lt d. All rights reserved.