Minimization of travel time and weighted number of stops in a traffic-light network

DOI10.1016/S0377-2217(02)00148-0zbMath1107.90451MaRDI QIDQ1869410

Yen-Liang Chen, Hsu-Hao Yang

Publication date: 10 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Shortest path; Road network; Time window; Traffic light

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B20: Traffic problems in operations research

Related Items

Finding \(K\) shortest looping paths in a traffic-light network

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A reoptimization algorithm for the shortest path problem with time windows
• The pickup and delivery problem with time windows
• Minimum time paths in a network with mixed time constraints.
• Shortest-path algorithms: Taxonomy and annotation
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• Vehicle Routing with Time Windows
• Deterministic network optimization: A bibliography
• The first K minimum cost paths in a time-schedule network
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Fibonacci heaps and their uses in improved network optimization algorithms
• Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
• Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
• Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows