IDEAS home Printed from https://ideas.repec.org/a/taf/tjrtxx/v9y2021i6p579-594.html
   My bibliography  Save this article

Optimization model and algorithm for the placing-in and taking-out of wagons in railway stations with branch-shaped goods operating sites

Author

Listed:
  • Guo Chuijiang

Abstract

This paper formulates an optimization model for the placing-in and taking-out of waggons in railway stations with branch-shaped goods operation sites, taking the minimization of locomotive running and waiting time for loading and unloading as the optimization objective with the following constraints: locomotive capability, required prioritization for transferring between operating sites, connecting time for each waggon group, and starting time of the shunting operation. A simulated annealing algorithm was regarded as the main framework to solve the optimization model. The model and algorithm were then verified using a sample case for the placing-in and taking-out of waggons in Wayuan railway station. The results indicate that the model is consistent with the scheme requirements, and the computation results and the efficiency of the algorithm were practical for railway operations. The model and algorithm provided in this paper are feasible and superior to existing models.

Suggested Citation

  • Guo Chuijiang, 2021. "Optimization model and algorithm for the placing-in and taking-out of wagons in railway stations with branch-shaped goods operating sites," International Journal of Rail Transportation, Taylor & Francis Journals, vol. 9(6), pages 579-594, November.
    • Handle: RePEc:taf:tjrtxx:v:9:y:2021:i:6:p:579-594
    DOI: 10.1080/23248378.2020.1823254
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/23248378.2020.1823254
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/23248378.2020.1823254?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:tjrtxx:v:9:y:2021:i:6:p:579-594. 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/tjrt20 .

    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.