WIT Press

Optimal Resource Allocation To Elementary Networks

Price

Free (open access)

Paper DOI

10.2495/UT980111

Volume

36

Pages

12

Published

1998

Size

1,308 kb

Copyright

WIT Press

Author(s)

G. Bellei, G. Gentile & N. Papola

Abstract

A wide range of transport bilevel problems are investigated referring to an elementary network consisting of one Origin Destination (OD) pair, with a given demand, connected by two links. In this context it is shown that these problems, generally non-convex, exhibit several local minima. Most results are supplied in a graphical form and analytical proofs are developed for the NDP with linear investment functions. 1 Introduction Since the work of Tobin and Friesz^ has opened the field of assignment sensitivity analysis, several contributions (for example Friesz et al.Yang*, Davis^), aiming at devising solution algorithms for classical transport bilevel optimisation problems (Network Design, Traffic Control Problem, OD Matrix Estimation etc.),

Keywords