IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i2p212-225.html
   My bibliography  Save this article

A novel parameterised approximation approach based on bi-level programming for integration transport scheduling problem

Author

Listed:
  • Bing Li
  • Hua Xuan
  • Xinyu Yang
  • Xueyuan Wang

Abstract

The study described in this paper attempts to integrate vehicle utilisation decisions with optimisation of loading and unloading operations. The interaction between vehicle assignment decisions and yard operations decisions, and their combined effects on capacity and efficiency of freight transportation systems, are the focus of this paper. This type of problem is named as the integration transport scheduling problem and formulated as a bi-level programming model. The interactive correlation functions for incremental revenue predicated parameters (IRP) and incremental cost parameter (ICP) are proposed. The approximation procedures for IRP parameters and ICP parameters are given. Introducing, respectively, IRP into the upper level model and ICP into the lower level model, the bi-level programming model with predicted control parameters (BLP-PCP) is presented. The alternating algorithm by updating predicted control parameters (AA-PCP) is obtained. Computational results indicate that the BLP-PCP model with AA-PCP methodology can generate a better solution and show reasonable computing time.

Suggested Citation

  • Bing Li & Hua Xuan & Xinyu Yang & Xueyuan Wang, 2019. "A novel parameterised approximation approach based on bi-level programming for integration transport scheduling problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(2), pages 212-225, February.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:2:p:212-225
    DOI: 10.1080/01605682.2017.1421856
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2017.1421856
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2017.1421856?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:tjorxx:v:70:y:2019:i:2:p:212-225. 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/tjor .

    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.