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

A Class of Train-Scheduling Problems

Author

Listed:
  • Arjang A. Assad

    (University of Maryland, College Park, Maryland)

Abstract

We relate the question of determining stop-schedules for trains that deliver traffic on a line of stations to the maximization of submodular set functions. We prove that a greedy algorithm is optimal under certain assumptions and report computational experience on the performance of the greedy heuristic as compared to the exact algorithm when the optimality of the greedy heuristic cannot be guaranteed.

Suggested Citation

  • Arjang A. Assad, 1982. "A Class of Train-Scheduling Problems," Transportation Science, INFORMS, vol. 16(3), pages 281-310, August.
    • Handle: RePEc:inm:ortrsc:v:16:y:1982:i:3:p:281-310
    DOI: 10.1287/trsc.16.3.281
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.16.3.281
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.16.3.281?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. Chang, Yu-Hern & Yeh, Chung-Hsing & Shen, Ching-Cheng, 2000. "A multiobjective model for passenger train services planning: application to Taiwan's high-speed rail line," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 91-106, February.
    3. Hamid, Faiz & Agarwal, Yogesh K., 2024. "Train stop scheduling problem: An exact approach using valid inequalities and polar duality," European Journal of Operational Research, Elsevier, vol. 313(1), pages 207-224.
    4. Michael F. Gorman, 1998. "Santa Fe Railway Uses an Operating-Plan Model to Improve Its Service Design," Interfaces, INFORMS, vol. 28(4), pages 1-12, August.
    5. Chew, Joanne S.C. & Zhang, Lele & Gan, Heng S., 2019. "Optimizing limited-stop services with vehicle assignment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 228-246.

    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:16:y:1982:i:3:p:281-310. 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.