✦ LIBER ✦

Shortest paths in a network with time-dependent flow speeds

✍ Scribed by Kiseok Sung; Michael G.H Bell; Myeongki Seong; Soondal Park

Book ID: 108445528
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 171 KB
Volume: 121
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(99)00035-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest Paths in Time-Dependent FIFO Ne

Shortest Paths in Time-Dependent FIFO Networks

✍ Frank Dehne; Masoud T. Omran; Jörg-Rüdiger Sack 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 776 KB

Shortest paths in piecewise continuous t

Shortest paths in piecewise continuous time-dependent networks

✍ M. Dell’Amico; M. Iori; D. Pretolani 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 894 KB

Time depending shortest-path problems wi

Time depending shortest-path problems with applications to railway networks

✍ K. Nachtigall 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 761 KB

Time version of the shortest path proble

Time version of the shortest path problem in a stochastic-flow network

✍ Yi-Kuei Lin 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 543 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

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