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

Authors:
Konstantinos N. Androutsopoulos;Konstantinos G. Zografos
Affiliations:
Transportation Systems and Logistics Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Greece;Transportation Systems and Logistics Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Greece
Venue:
Operations Research Letters
Year:
2008

Citing 3
Cited 2

Finding the k Shortest Paths

SIAM Journal on Computing
Minimum time paths in a network with mixed time constraints

Computers and Operations Research
Integrated Routing and Scheduling of Hazmat Trucks with Stops En Route

Transportation Science

A Neural-network Algorithm for All k Shortest Paths Problem

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Finding the K shortest paths in a time-schedule network with constraints on arcs

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 constrained within specified time windows.