NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times.
Tim ZeitzPublished in: Inf. Process. Lett. (2023)
Keyphrases
- travel time
- shortest path problem
- shortest path
- np hardness
- transportation networks
- traffic flows
- np hard
- road network
- vehicle routing and scheduling
- vehicle routing
- spatial networks
- traffic congestion
- vehicle routing problem
- routing problem
- approximation algorithms
- traffic conditions
- routing algorithm
- traffic flow
- combinatorial optimization problems
- mixed integer
- special case
- optimal solution
- prize collecting
- fastest path
- computational complexity
- directed graph
- bayesian networks
- evolutionary algorithm
- multiple objectives
- particle swarm optimization
- network structure