IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v20y1986i3p189-199.html
   My bibliography  Save this article

Static Blocking at Railyards: Sorting Implications and Track Requirements

Author

Listed:
  • Carlos F. Daganzo

    (University of California, Berkeley, California)

Abstract

In this paper, various strategies for minimizing the amount of switching done at a classification yard are examined. We investigate how the allocation of blocks (the sorting classes recognized at the yard) to classification tracks affects switching work. Given are the sorting classes, as well as the schedule and block makeup of the departing trains. Only static strategies are considered---strategies where every block has been assigned permanently to a classification track. Simple formulas are given for the minimum number of tracks needed to implement a strategy, and for the amount of switching work given a number of tracks. The total track length is also examined. The results are significantly influenced by the number of blocks recognized by the yard; given this number, the results are nearly independent of the train departure schedule, the number of departing trains, and the number of blocks of individual trains. This feature simplifies the study of larger problems (e.g., dynamic blocking strategies) and, most importantly, makes train formation and scheduling an easier job at every yard.

Suggested Citation

  • Carlos F. Daganzo, 1986. "Static Blocking at Railyards: Sorting Implications and Track Requirements," Transportation Science, INFORMS, vol. 20(3), pages 189-199, August.
    • Handle: RePEc:inm:ortrsc:v:20:y:1986:i:3:p:189-199
    DOI: 10.1287/trsc.20.3.189
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.20.3.189
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.20.3.189?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jean-François Cordeau & Paolo Toth & Daniele Vigo, 1998. "A Survey of Optimization Models for Train Routing and Scheduling," Transportation Science, INFORMS, vol. 32(4), pages 380-404, November.
    2. Wu, Xin (Bruce) & Lu, Jiawei & Wu, Shengnan & Zhou, Xuesong (Simon), 2021. "Synchronizing time-dependent transportation services: Reformulation and solution algorithm using quadratic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 152(C), pages 140-179.
    3. Boysen, Nils & Fliedner, Malte & Jaehn, Florian & Pesch, Erwin, 2012. "Shunting yard operations: Theoretical aspects and applications," European Journal of Operational Research, Elsevier, vol. 220(1), pages 1-14.
    4. He, Shiwei & Song, Rui & Chaudhry, Sohail S., 2000. "Fuzzy dispatching model and genetic algorithms for railyards operations," European Journal of Operational Research, Elsevier, vol. 124(2), pages 307-331, July.
    5. Shi, Tie & Zhou, Xuesong, 2015. "A mixed integer programming model for optimizing multi-level operations process in railroad yards," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 19-39.

    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:inm:ortrsc:v:20:y:1986:i:3:p:189-199. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.