IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v23y1989i1p19-28.html
   My bibliography  Save this article

Derivation of nested transport models within a mathematical programming framework

Author

Listed:
  • Brice, Stéphane

Abstract

This paper presents an optimisation framework for deriving transport demand models with a nested choice structure. The mathematical program is based on the separability of the entropy term in the objective function. The resulting models have similar functional forms to those formed from random utility maximisation principles. However, some precautions must be taken as to the conditional sequence chosen, the uneven sizes of choice subsets, and unlikely values of parameters. The required parameters cannot be directly evaluated by simply satisfying a trip cost constraint because the nested model structure implies endogenous measures to attribute to each level of demand. A computational procedure based on the satisfaction of entropy constraints is presented for calibrating each level-related parameter.

Suggested Citation

  • Brice, Stéphane, 1989. "Derivation of nested transport models within a mathematical programming framework," Transportation Research Part B: Methodological, Elsevier, vol. 23(1), pages 19-28, February.
  • Handle: RePEc:eee:transb:v:23:y:1989:i:1:p:19-28
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(89)90020-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:23:y:1989:i:1:p:19-28. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.