IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v52y2001i1d10.1057_palgrave.jors.2601028.html
   My bibliography  Save this article

The first K minimum cost paths in a time-schedule network

Author

Listed:
  • Y-L Chen

    (National Central University)

  • D Rinks

    (Lousiana State University)

  • K Tang

    (Purdue University)

Abstract

The time-constrained shortest path problem is an important generalisation of the classical shortest path problem and in recent years has attracted much research interest. We consider a time-schedule network, where every node in the network has a list of pre-specified departure times and departure from a node may take place only at one of these departure times. The objective of this paper is to find the first K minimum cost simple paths subject to a total time constraint. An efficient polynomial time algorithm is developed. It is also demonstrated that the algorithm can be modified for finding the first K paths for all possible values of total time.

Suggested Citation

  • Y-L Chen & D Rinks & K Tang, 2001. "The first K minimum cost paths in a time-schedule network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(1), pages 102-108, January.
    • Handle: RePEc:pal:jorsoc:v:52:y:2001:i:1:d:10.1057_palgrave.jors.2601028
    DOI: 10.1057/palgrave.jors.2601028
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601028
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601028?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.

    Citations

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


    Cited by:

    1. Yen‐Liang Chen & Kwei Tang, 2005. "Finding the Kth shortest path in a time‐schedule network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 93-102, February.
    2. Chen, Yen-Liang & Yang, Hsu-Hao, 2003. "Minimization of travel time and weighted number of stops in a traffic-light network," European Journal of Operational Research, Elsevier, vol. 144(3), pages 565-580, February.

    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:pal:jorsoc:v:52:y:2001:i:1:d:10.1057_palgrave.jors.2601028. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.