IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v39y1991i1p82-99.html
   My bibliography  Save this article

Optimal Pacing of Trains in Freight Railroads: Model Formulation and Solution

Author

Listed:
  • David Kraay

    (University of Pennsylvania, Philadelphia, Pennsylvania)

  • Patrick T. Harker

    (University of Pennsylvania, Philadelphia, Pennsylvania)

  • Bintong Chen

    (University of Pennsylvania, Philadelphia, Pennsylvania)

Abstract

Recent developments in location systems technology for railroads provide a train dispatcher with the capability to improve the operations of a rail line by pacing trains over a territory; i.e., to permit trains to travel at less than maximum velocity to minimize fuel consumption while maintaining a given level of performance. Traditional railroad dispatching models assume that the velocities of the trains moving over a dispatcher's territory are fixed at their maximum value and, thus, are incapable of dealing with a pacing situation. This paper presents a mathematical programming model for the pacing problem and describes alternative solution procedures for this model. Analytical and numerical evidence are presented that confirm the applicability of a heuristic solution procedure for this problem, as well as providing evidence that a pacing approach versus the traditional dispatching approach is an efficient and potentially cost effective method for the control of train movements.

Suggested Citation

  • David Kraay & Patrick T. Harker & Bintong Chen, 1991. "Optimal Pacing of Trains in Freight Railroads: Model Formulation and Solution," Operations Research, INFORMS, vol. 39(1), pages 82-99, February.
    • Handle: RePEc:inm:oropre:v:39:y:1991:i:1:p:82-99
    DOI: 10.1287/opre.39.1.82
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.39.1.82
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.39.1.82?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. Wang, Pengling & Goverde, Rob M.P., 2019. "Multi-train trajectory optimization for energy-efficient timetabling," European Journal of Operational Research, Elsevier, vol. 272(2), pages 621-635.
    2. Carey, Malachy & Crawford, Ivan, 2007. "Scheduling trains on a network of busy complex stations," Transportation Research Part B: Methodological, Elsevier, vol. 41(2), pages 159-178, February.
    3. Adenso-Díaz, B. & Oliva González, M. & González-Torre, P., 1999. "On-line timetable re-scheduling in regional train services," Transportation Research Part B: Methodological, Elsevier, vol. 33(6), pages 387-398, August.
    4. Lee, Yusin & Chen, Chuen-Yih, 2009. "A heuristic for the train pathing and timetabling problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 837-851, September.
    5. Enrique Castillo & Inmaculada Gallego & José Ureña & José Coronado, 2009. "Timetabling optimization of a single railway track line with sensitivity analysis," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(2), pages 256-287, December.
    6. Wang, Yihui & Tang, Tao & Ning, Bin & Meng, Lingyun, 2017. "Integrated optimization of regular train schedule and train circulation plan for urban rail transit lines," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 83-104.
    7. Jonas Harbering & Abhiram Ranade & Marie Schmidt & Oliver Sinnen, 2019. "Complexity, bounds and dynamic programming algorithms for single track train scheduling," Annals of Operations Research, Springer, vol. 273(1), pages 479-500, February.
    8. Min, Yun-Hong & Park, Myoung-Ju & Hong, Sung-Pil & Hong, Soon-Heum, 2011. "An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway network," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 409-429, February.
    9. A. Agnetis & P.B. Mirchandani & D. Pacciarelli & A. Pacifici, 2000. "Nondominated Schedules for a Job-Shop with Two Competing Users," Computational and Mathematical Organization Theory, Springer, vol. 6(2), pages 191-217, July.
    10. Brewer, Paul J. & Plott, Charles R., 1996. "A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks," International Journal of Industrial Organization, Elsevier, vol. 14(6), pages 857-886, October.
    11. Ghoseiri, Keivan & Szidarovszky, Ferenc & Asgharpour, Mohammad Jawad, 2004. "A multi-objective train scheduling model and solution," Transportation Research Part B: Methodological, Elsevier, vol. 38(10), pages 927-952, December.
    12. Kraay, David R. & Harker, Patrick T., 1995. "Real-time scheduling of freight railroads," Transportation Research Part B: Methodological, Elsevier, vol. 29(3), pages 213-229, June.
    13. Chakroborty, Partha & Vikram, Durgesh, 2008. "Optimum assignment of trains to platforms under partial schedule compliance," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 169-184, February.
    14. Xuesong Feng & Hanxiao Zhang & Yong Ding & Zhili Liu & Hongqin Peng & Bin Xu, 2013. "A Review Study on Traction Energy Saving of Rail Transport," Discrete Dynamics in Nature and Society, Hindawi, vol. 2013, pages 1-9, September.
    15. Sahin, Ismail, 1999. "Railway traffic control and train scheduling based oninter-train conflict management," Transportation Research Part B: Methodological, Elsevier, vol. 33(7), pages 511-534, September.
    16. Mu, Shi & Dessouky, Maged, 2011. "Scheduling freight trains traveling on complex networks," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1103-1123, August.
    17. Chen, Zebin & Li, Shukai & D’Ariano, Andrea & Yang, Lixing, 2022. "Real-time optimization for train regulation and stop-skipping adjustment strategy of urban rail transit lines," Omega, Elsevier, vol. 110(C).
    18. Hallowell, Susan F. & Harker, Patrick T., 1998. "Predicting on-time performance in scheduled railroad operations: methodology and application to train scheduling," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(4), pages 279-295, May.
    19. Carlo Mannino & Alessandro Mascis, 2009. "Optimal Real-Time Traffic Control in Metro Stations," Operations Research, INFORMS, vol. 57(4), pages 1026-1039, August.
    20. Ram Gopalan, 2015. "Computational complexity of convoy movement planning problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 31-60, August.
    21. Carey, Malachy & Carville, Sinead, 2003. "Scheduling and platforming trains at busy complex stations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(3), pages 195-224, March.

    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:oropre:v:39:y:1991:i:1:p:82-99. 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.