Descent methods of calculating locally optimal signal controls and prices in multi-modal and dynamic transportation networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Standard

Descent methods of calculating locally optimal signal controls and prices in multi-modal and dynamic transportation networks. / Smith, M; Xiang, Y K; Yarrow, R.

TRANSPORTATION NETWORKS: RECENT METHODOLOGICAL ADVANCES. ed. / MGH Bell. AMSTERDAM : ELSEVIER SCIENCE BV, 1998. p. 934.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harvard

Smith, M, Xiang, YK & Yarrow, R 1998, Descent methods of calculating locally optimal signal controls and prices in multi-modal and dynamic transportation networks. in MGH Bell (ed.), TRANSPORTATION NETWORKS: RECENT METHODOLOGICAL ADVANCES. ELSEVIER SCIENCE BV, AMSTERDAM, pp. 934, 4th EURO Transportation Meeting on Transportation Networks, NEWCASTLE, 9/09/96.

APA

Smith, M., Xiang, Y. K., & Yarrow, R. (1998). Descent methods of calculating locally optimal signal controls and prices in multi-modal and dynamic transportation networks. In MGH. Bell (Ed.), TRANSPORTATION NETWORKS: RECENT METHODOLOGICAL ADVANCES (pp. 934). AMSTERDAM: ELSEVIER SCIENCE BV.

Vancouver

Smith M, Xiang YK, Yarrow R. Descent methods of calculating locally optimal signal controls and prices in multi-modal and dynamic transportation networks. In Bell MGH, editor, TRANSPORTATION NETWORKS: RECENT METHODOLOGICAL ADVANCES. AMSTERDAM: ELSEVIER SCIENCE BV. 1998. p. 934

Author

Smith, M ; Xiang, Y K ; Yarrow, R. / Descent methods of calculating locally optimal signal controls and prices in multi-modal and dynamic transportation networks. TRANSPORTATION NETWORKS: RECENT METHODOLOGICAL ADVANCES. editor / MGH Bell. AMSTERDAM : ELSEVIER SCIENCE BV, 1998. pp. 934

Bibtex - Download

@inproceedings{c44357aebf7e475dba2fdc4730b22d5e,
title = "Descent methods of calculating locally optimal signal controls and prices in multi-modal and dynamic transportation networks",
abstract = "A bilevel descent method of optimising signals and prices for a multi-modal network while taking account of travellers' choices (equilibrium) is specified within a framework which may, when developed, be efficient or large networks. Similar trilevel methods for the corresponding dynamic problem are also presented. Fairly complete proofs of convergence of the method to a local optimum are given for the steady state case but there remains a gap when we seek to prove convergence in a dynamic context; however if the method converges (in a dynamic context) to the set of equilibria then (under natural conditions) it must also converge to the set of local optima.",
keywords = "HEURISTIC ALGORITHMS, SENSITIVITY ANALYSIS",
author = "M Smith and Xiang, {Y K} and R Yarrow",
year = "1998",
language = "English",
isbn = "0-08-043052-X",
pages = "934",
editor = "MGH Bell",
booktitle = "TRANSPORTATION NETWORKS: RECENT METHODOLOGICAL ADVANCES",
publisher = "ELSEVIER SCIENCE BV",

}

RIS (suitable for import to EndNote) - Download

TY - GEN

T1 - Descent methods of calculating locally optimal signal controls and prices in multi-modal and dynamic transportation networks

AU - Smith, M

AU - Xiang, Y K

AU - Yarrow, R

PY - 1998

Y1 - 1998

N2 - A bilevel descent method of optimising signals and prices for a multi-modal network while taking account of travellers' choices (equilibrium) is specified within a framework which may, when developed, be efficient or large networks. Similar trilevel methods for the corresponding dynamic problem are also presented. Fairly complete proofs of convergence of the method to a local optimum are given for the steady state case but there remains a gap when we seek to prove convergence in a dynamic context; however if the method converges (in a dynamic context) to the set of equilibria then (under natural conditions) it must also converge to the set of local optima.

AB - A bilevel descent method of optimising signals and prices for a multi-modal network while taking account of travellers' choices (equilibrium) is specified within a framework which may, when developed, be efficient or large networks. Similar trilevel methods for the corresponding dynamic problem are also presented. Fairly complete proofs of convergence of the method to a local optimum are given for the steady state case but there remains a gap when we seek to prove convergence in a dynamic context; however if the method converges (in a dynamic context) to the set of equilibria then (under natural conditions) it must also converge to the set of local optima.

KW - HEURISTIC ALGORITHMS

KW - SENSITIVITY ANALYSIS

M3 - Conference contribution

SN - 0-08-043052-X

SP - 934

BT - TRANSPORTATION NETWORKS: RECENT METHODOLOGICAL ADVANCES

A2 - Bell, MGH

PB - ELSEVIER SCIENCE BV

CY - AMSTERDAM

ER -