✦ LIBER ✦

Finding the K shortest paths in a time-schedule network with constraints on arcs

✍ Scribed by Jin, Wen; Chen, Shuiping; Jiang, Hai

Book ID: 121374018
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 463 KB
Volume: 40
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2013.07.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the Kth shortest path in a time-

Finding the Kth shortest path in a time-schedule network

✍ Yen-Liang Chen; Kwei Tang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

A genetic algorithm for finding the k sh

A genetic algorithm for finding the k shortest paths in a network

✍ Ahmed Younes Hamed 📂 Article 📅 2010 🏛 Elsevier 🌐 English ⚖ 801 KB

The First K Minimum Cost Paths in a Time

The First K Minimum Cost Paths in a Time-Schedule Network

✍ Y.-L. Chen, D. Rinks and K. Tang 📂 Article 📅 2001 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 335 KB

Solving the -shortest path problem with

Solving the -shortest path problem with time windows in a time varying network

✍ Konstantinos N. Androutsopoulos; Konstantinos G. Zografos 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 922 KB

The k-shortest path problem in a network with time dependent cost attributes arises in many transportation decisions including hazardous materials routing and urban trip planning. The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are const

[IEEE IEEE INFOCOM 2001. Conference on C

[IEEE IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society - Anchorage, AK, USA (22-26 April 2001)] Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) - A*Prune: an algorithm for finding K shortest paths subject to multiple constraints

✍ Gang Liu, ; Ramakrishnan, K.G. 📂 Article 📅 2001 🏛 IEEE ⚖ 142 KB