IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v21y2018i3d10.1007_s10951-017-0535-z.html
   My bibliography  Save this article

Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem

Author

Listed:
  • Lunce Fu

    (University of Southern California)

  • Maged Dessouky

    (University of Southern California)

Abstract

We study the state-dependent shortest path problem and focus on its application to the Single Train Routing Problem consisting of a rail network with only double-track segments, where the objective is to route one train through an empty network as fast as possible. We show that the Single Train Routing Problem is NP-hard. We investigate the solution properties and present sufficient conditions for optimality. Different conditions on the parameters are given to guarantee that certain local route selection is optimal. Then, a dynamic programming heuristic is introduced and conditions when the proposed heuristic can obtain the optimal solution in polynomial time are also discussed. Experimental results show the efficiency of the proposed heuristics for general problem settings.

Suggested Citation

  • Lunce Fu & Maged Dessouky, 2018. "Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem," Journal of Scheduling, Springer, vol. 21(3), pages 367-386, June.
    • Handle: RePEc:spr:jsched:v:21:y:2018:i:3:d:10.1007_s10951-017-0535-z
    DOI: 10.1007/s10951-017-0535-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-017-0535-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-017-0535-z?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.

    References listed on IDEAS

    as
    1. Ahuja, Ravindra & Orlin, James & Pallottino, Stefano & Scutella, Maria, 2003. "Dynamic Shortest Paths Minimizing Travel Times And Costs," Working papers 4390-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jean-François Cordeau & Gianpaolo Ghiani & Emanuela Guerriero, 2014. "Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem," Transportation Science, INFORMS, vol. 48(1), pages 46-58, February.
    2. Giacomo Nannicini & Philippe Baptiste & Gilles Barbier & Daniel Krob & Leo Liberti, 2010. "Fast paths in large-scale dynamic road networks," Computational Optimization and Applications, Springer, vol. 45(1), pages 143-158, January.
    3. Bozhenyuk Alexander & Gerasimenko Evgeniya, 2013. "Algorithm for Monitoring Minimum Cost in Fuzzy Dynamic Networks," Information Technology and Management Science, Sciendo, vol. 16(1), pages 53-59, December.
    4. Antonio Polimeni & Antonino Vitetta, 2013. "Optimising Waiting at Nodes in Time-Dependent Networks: Cost Functions and Applications," Journal of Optimization Theory and Applications, Springer, vol. 156(3), pages 805-818, March.
    5. Hu, Xiao-Bing & Zhang, Ming-Kong & Zhang, Qi & Liao, Jian-Qin, 2017. "Co-Evolutionary path optimization by Ripple-Spreading algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 411-432.
    6. Ziliaskopoulos, Athanasios K. & Mandanas, Fotios D. & Mahmassani, Hani S., 2009. "An extension of labeling techniques for finding shortest path trees," European Journal of Operational Research, Elsevier, vol. 198(1), pages 63-72, October.

    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:spr:jsched:v:21:y:2018:i:3:d:10.1007_s10951-017-0535-z. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.