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.
Optimal resources allocation to elementary networks / Bellei, Giuseppe; Gentile, Guido; Papola, Natale. - (1998), pp. 103-114. (Intervento presentato al convegno 4th International Conference on Urban Transport and the Environment for the 21st Century tenutosi a Lisbona, Portogallo).
Optimal resources allocation to elementary networks
BELLEI, Giuseppe;GENTILE, Guido;PAPOLA, Natale
1998
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
Bellei_Optimal-resources-allocation_1998.pdf
accesso aperto
Note: contributo
Tipologia:
Documento in Pre-print (manoscritto inviato all'editore, precedente alla peer review)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
584.26 kB
Formato
Adobe PDF
|
584.26 kB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
