Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.15754 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914482473664512 |
|---|---|
| author | Suguira, Satoshi Cheung, Kam-Fung Bell, Michael G. H. Nakanishi, Hitomi Kurauchi, Fumitaka Perera, Supun Vidyattama, Yogi |
| author_facet | Suguira, Satoshi Cheung, Kam-Fung Bell, Michael G. H. Nakanishi, Hitomi Kurauchi, Fumitaka Perera, Supun Vidyattama, Yogi |
| contents | Transit network design plays an important role in public transport. With the simplicity of spanning tree, this paper adopts the concept of spanning tree to help (re-)design a public transit network that addresses passenger utility by minimizing the total passenger-kilometers, which can be formulated as a mixed-integer optimization model. However, searching for an optimal minimum passenger-kilometer spanning tree is intractable for a large network. This paper proposes a tabu search based heuristic to quickly output a promising spanning tree. The efficacy of the proposed tabu search based heuristic is verified using the Canberra bus network data. With the flexibility of the proposed tabu search heuristic and the efficiency of the transit system, this paper proposes a greedy algorithm to relax the number of links constraint to add more links that can further minimize the total passenger-kilometers. With the case study of Canberra transit network, this paper provides implications to policy makers to further improve the design of a public transit network. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_15754 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Urban transit network design using spanning tree: A case study of Canberra transit network Suguira, Satoshi Cheung, Kam-Fung Bell, Michael G. H. Nakanishi, Hitomi Kurauchi, Fumitaka Perera, Supun Vidyattama, Yogi Optimization and Control Transit network design plays an important role in public transport. With the simplicity of spanning tree, this paper adopts the concept of spanning tree to help (re-)design a public transit network that addresses passenger utility by minimizing the total passenger-kilometers, which can be formulated as a mixed-integer optimization model. However, searching for an optimal minimum passenger-kilometer spanning tree is intractable for a large network. This paper proposes a tabu search based heuristic to quickly output a promising spanning tree. The efficacy of the proposed tabu search based heuristic is verified using the Canberra bus network data. With the flexibility of the proposed tabu search heuristic and the efficiency of the transit system, this paper proposes a greedy algorithm to relax the number of links constraint to add more links that can further minimize the total passenger-kilometers. With the case study of Canberra transit network, this paper provides implications to policy makers to further improve the design of a public transit network. |
| title | Urban transit network design using spanning tree: A case study of Canberra transit network |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2604.15754 |