No label defined (Q3743987)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3978867
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3978867

      Statements

      0 references
      0 references
      1986
      0 references
      trip matrix estimation
      0 references
      linkflows
      0 references
      congested network
      0 references
      elastic demand traffic assignment problem
      0 references
      decomposition techniques
      0 references
      implicit optimization models
      0 references
      [For the entire collection see Zbl 0595.00027.] We present mathematical programming models for the problem of estimating a trip matrix from network data. The models presented are based on the results of \textit{S. Nguyen} [Transportation planning models, Proc. Course Internat. Center Transport Stud., Amalfi/Italy 1982, 363-380 (1984; Zbl 0598.90039)] who has shown that trip matrices that reproduce observed linkflows in a congested network can be obtained by solving an elastic demand traffic assignment problem with a specific linear demand function. It can be shown that this elastic traffic assignment problem has a unique optimal solution with respect to the linkflows but that the resulting trip matrix not necessarily is unique. The mathematical programming models presented here will deal with the problem of deriving one of the optimal trip matrices from Nguyen's elastic demand traffic assignment problem. Models with different choice criteria will be discussed and solution methods based on decomposition techniques will be presented for the various models. The present models will all be examples of implicit optimization models, i.e. optimization models in which the constraints involve another optimization model.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references