IDEAS home Printed from https://ideas.repec.org/a/taf/transp/v32y2008i1p93-114.html
   My bibliography  Save this article

A new approach to neural trip distribution models: NETDIM

Author

Listed:
  • Serkan Tapkın
  • Özdemir Akyılmaz

Abstract

This paper develops and presents a new neural network approach to model trip distribution, which is one of the important phases of conventional four-step travel demand modelling. The trip distribution problem has been investigated using back-propagation artificial neural networks in a number of studies and it was concluded that back-propagation artificial neural networks underperform when compared to traditional models. Such underperformance is due to the thresholding of the linearly combined inputs by utilising a non-linear function and carrying out this operation both in hidden and output layers. The proposed neural trip distribution model does not threshold the linearly combined outputs from the hidden layer. This makes it different from back-propagation artificial neural networks where combined inputs from the hidden layer are activated once more in the output layer. In addition, the neuron in the output layer is used as a summation unit in contrast to the methodologies cited in the neural network applications literature. At the same time, the bias neuron is not connected to the output neuron in the output layer. When this model is compared with various approaches such as the gravity model, modular neural networks and back-propagation neural networks, it was concluded that this new model provides better prediction of trip distribution and therefore, outperforms all the existing approaches.

Suggested Citation

  • Serkan Tapkın & Özdemir Akyılmaz, 2008. "A new approach to neural trip distribution models: NETDIM," Transportation Planning and Technology, Taylor & Francis Journals, vol. 32(1), pages 93-114, April.
  • Handle: RePEc:taf:transp:v:32:y:2008:i:1:p:93-114
    DOI: 10.1080/03081060902750710
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03081060902750710
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03081060902750710?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:taf:transp:v:32:y:2008:i:1:p:93-114. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/GTPT20 .

    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.