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

DOI10.1016/j.cor.2003.08.004zbMath1077.90076OpenAlexW2069752825MaRDI QIDQ1886860

Yen-Liang Chen, Hsu-Hao Yang

Publication date: 19 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.08.004

zbMATH Keywords

Shortest pathLooping pathTraffic-light

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs ⋮ Finding the \(K\) shortest paths in a schedule-based transit network ⋮ Finding \(K\) shortest looping paths with waiting time in a time--window network

Cites Work

• An algorithm for ranking paths that may contain cycles
• The quickest path problem
• An algorithm for the ranking of shortest paths
• Minimization of travel time and weighted number of stops in a traffic-light network
• Shortest-path algorithms: Taxonomy and annotation
• Scheduling School Buses
• An efficient algorithm for K shortest simple paths
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Deterministic network optimization: A bibliography
• Data Structures and Computer Science Techniques in Operations Research
• Finding the k Shortest Paths
• An efficient implementation of an algorithm for findingK shortest simple paths
• An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• An Appraisal of Some Shortest-Path Algorithms
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: Finding \(K\) shortest looping paths in a traffic-light network