A tabu search heuristic finds spanning trees minimizing passenger-kilometers in transit networks, with a greedy extension to add links, demonstrated on Canberra bus data.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Urban transit network design using spanning tree: A case study of Canberra transit network
A tabu search heuristic finds spanning trees minimizing passenger-kilometers in transit networks, with a greedy extension to add links, demonstrated on Canberra bus data.