AbstractIn this paper we consider the estimation of an origin–destination (OD)-matrix, given a target OD-matrix and traffic counts on a subset of the links in the network. We use a general nonlinear bilevel minimization formulation of the problem, where the lower level problem is to assign a given OD-matrix onto the network according to the user equilibrium principle. After reformulating the problem to a single level problem, the objective function includes implicitly given link flow variables, corresponding to the given OD-matrix. We propose a descent heuristic to solve the problem, which is an adaptation of the well-known projected gradient method. In order to compute a search direction we have to approximate the Jacobian matrix representing the derivatives of the link flows with respect to a change in the OD-flows, and we propose to do this by solving a set of quadratic programs with linear constraints only. If the objective function is differentiable at the current point, the Jacobian is exact and we obtain a gradient. Numerical experiments are presented which indicate that the solution approach can be applied in practice to medium to large size networks.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A heuristic for the bilevel origin–destination-matrix estimation problem


    Contributors:

    Published in:

    Publication date :

    2007-09-11


    Size :

    16 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English