Shortest path problems with left-side time windows

DOI10.1007/s11590-011-0390-3zbMath1258.90102MaRDI QIDQ1926637

Jianping Li, Ying Yin, Tongquan Zhang

Publication date: 28 December 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0390-3

zbMATH Keywords

shortest path problem; left-side time windows; multi-left-side time windows; travelling cycle

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

Related Items

Reachability for airline networks: fast algorithm for shortest path problem with time windows

Cites Work

• An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
• Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
• Shortest path problems with time windows on nodes and arcs
• GRASP with a new local search scheme for vehicle routing problems with time windows
• Visiting a network of services with time constraints.
• Finding the first \(K\) shortest paths in a time-window network.
• Time-constrained Chinese postman problems
• The selection and scheduling of telecommunication calls with time windows
• A constraint programming approach to the Chinese postman problem with time windows
• Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
• Finding \(K\) shortest looping paths with waiting time in a time--window network
• Vehicle routing and scheduling with dynamic travel times
• The multiple TSP with time windows: vehicle bounds based on precedence graphs