Graph Algorithms
Minimum delay routing in stochastic networks
IEEE/ACM Transactions on Networking (TON)
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Algorithmic Aspects of Speech Recognition: A Synopsis
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
FATES: Finding A Time dEpendent Shortest path
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Multi-cast ant colony system for the bus routing problem
Metaheuristics
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Queueing Networks of Random Link Topology: Stationary Dynamics of Maximal Throughput Schedules
Queueing Systems: Theory and Applications
Distributed shortest-path protocols for time-dependent networks
Distributed Computing
Computers and Operations Research
IEEE/ACM Transactions on Networking (TON)
Scheduling algorithms for procrastinators
Journal of Scheduling
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
The diameter of opportunistic mobile networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Engineering Label-Constrained Shortest-Path Algorithms
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Finding rectilinear least cost paths in the presence of convex polygonal congested regions
Computers and Operations Research
Ontology driven road network analysis based on analytical network process technique
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Shortest paths in time-dependent FIFO networks using edge load forecasts
Proceedings of the Second International Workshop on Computational Transportation Science
Towards a routing framework in ad hoc space networks
International Journal of Ad Hoc and Ubiquitous Computing
Computers and Operations Research
Time-minimal path planning in dynamic current fields
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Ad hoc solution of the multicommodity-flow-over-time problem
IEEE Transactions on Intelligent Transportation Systems
Bidirectional A* search for time-dependent fast paths
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Multi-criteria shortest paths in time-dependent train networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
T-drive: driving directions based on taxi trajectories
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
A case for time-dependent shortest path computation in spatial networks
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Efficient k-nearest neighbor search in time-dependent spatial networks
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
A Flexible Reservation Algorithm for Advance Network Provisioning
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Timetable information: models and algorithms
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Finding all attractive train connections by multi-criteria Pareto search
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Efficient computation of time-dependent centralities in air transportation networks
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Driving with knowledge from the physical world
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Vehicle routing under time-dependent travel times: The impact of congestion avoidance
Computers and Operations Research
How much off-center are centrality metrics for routing in opportunistic networks
CHANTS '11 Proceedings of the 6th ACM workshop on Challenged networks
An integer programming approach for the rural postman problem with time dependent travel times
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A critical-time-point approach to all-start-time lagrangian shortest paths: a summary of results
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Online computation of fastest path in time-dependent spatial networks
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Dynamic pickup and delivery with transfers
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
An evolutionary algorithm for the urban public transportation
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I
A memetic algorithm for routing in urban public transportation networks
ICAIS'11 Proceedings of the Second international conference on Adaptive and intelligent systems
Proximity queries in time-dependent traffic networks using graph embeddings
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Contraction of timetable networks with realistic transfers
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Time-dependent contraction hierarchies and approximation
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
On the complexity of time-dependent shortest paths
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Shortest path search from a physical perspective
COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory
Towards k-nearest neighbor search in time-dependent spatial network databases
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
An a* algorithm framework for the point-to-point time-dependent shortest path problem
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Core Routing on Dynamic Time-Dependent Road Networks
INFORMS Journal on Computing
A GRASP approach to transporter scheduling and routing at a shipyard
Computers and Industrial Engineering
Computation of shortest path in cellular automata
Mathematical and Computer Modelling: An International Journal
Intelligent transportation systems-Enabling technologies
Mathematical and Computer Modelling: An International Journal
Shortest paths in piecewise continuous time-dependent networks
Operations Research Letters
Algorithms for time-dependent bicriteria shortest path problems
Discrete Optimization
Operations Research Letters
Location of central nodes in time varying computer networks
Operations Research Letters
Parallel computation of best connections in public transportation networks
Journal of Experimental Algorithmics (JEA)
Proceedings of the 18th annual international conference on Mobile computing and networking
Prioritized gossip in vehicular networks
Ad Hoc Networks
Time-dependent route planning with generalized objective functions
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Finding time period-based most frequent path in big trajectory data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
A review of urban computing for mobile phone traces: current methods, challenges and opportunities
Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing
Analyzing temporal metrics of public transportation for designing scalable delay-tolerant networks
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Finding traffic-aware fastest paths in spatial networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Nearest neighbor queries with service time constraints in time-dependent road networks
Proceedings of the Second ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Information Sciences: an International Journal
Reprint of "Prioritized gossip in vehicular networks"
Ad Hoc Networks
| Hi-index | 0.00 |
In this paper the shortest-path problem in networks in which the delay (or weight) of the edges changes with time according to arbitrary functions is considered. Algorithms for finding the shortest path and minimum delay under various waiting constraints are presented and the properties of the derived path are investigated. It is shown that if departure time from the source node is unrestricted, then a shortest path can be found that is simple and achieves a delay as short as the most unrestricted path. In the case of restricted transit, it is shown that there exist cases in which the minimum delay is finite, but the path that achieves it is infinite.