Traffic-toolbox Function

biterGrid - Bilevel optimisation function using grid linear search

Calling Sequence

[prix,opfV,sfV,sP]=biterGrid(prlk,lp,up,n,esp,m)

Parameters

Description

This function solves numerically the optimal network pricing problem given by: Max_y f(x(y),y)=y'x(y), subject to x being solution of the parametric (with parameter y) traffic assignment problem over the traffic network describe in the global variable %net.

The algorithm is based on a cyclic decomposition along coordenate axis of upper level objective function (given by the links prices y). In each direction a global line search is done through a 1-dimensional grid search. Once the precision eps is reached the grid is subdivided in a neighbourhood of the current optimum, eps is multyplied by 10-e3. This process is repeated m times.

EXAMPLES

See Also