Publication Cover
Transportation Letters
The International Journal of Transportation Research
Volume 12, 2020 - Issue 3
107
Views
0
CrossRef citations to date
0
Altmetric
Articles

The k-interchange-constrained diameter of a transit network: a connectedness indicator that accounts for travel convenience

References

  • Barrett, C., R. Jacob, and M. Marathe. 2000. “Formal-Language Constrained Path Problems.” SIAM Journal on Computing 30 (3): 809–837. doi:10.1137/S0097539798337716.
  • Cadarso, L., E. Codina, L. F. Escudero, and A. Marin. 2017. “Rapid Transit Network Design: Considering Recovery Robustness and Risk Aversion Measures.” Transportation Research Procedia 22: 255–264. doi:10.1016/j.trpro.2017.03.032.
  • Cook, S. 1971. “The Complexity of Theorem Proving Procedures.” In Proceedings of the Third Annual ACM Symposium on Theory of Computing, 151–158.
  • Derrible, S., and C. Kennedy. 2010. “Characterizing Metro Networks: State, Form, and Structure.” Transportation 37 (2): 275–297. doi:10.1007/s11116-009-9227-7.
  • Derrible, S., and C. Kennedy. 2011. “Applications of Graph Theory and Network Science to Transit Network Design.” Transport Reviews 31 (4): 495–519. doi:10.1080/01441647.2010.543709.
  • Erdos, P., A. Gyarfas, and L. Pyber. 1991. “Vertex Coverings by Monochromatic Cycles and Trees.” Journal of Combinatorial Theory Series B 51: 90–95. doi:10.1016/0095-8956(91)90007-7.
  • Gattuso, D., and E. Miriello. 2005. “Compared Analysis of Metro Networks Supported by Graph Theory.” Networks and Spatial Economics 5 (4): 395–414. doi:10.1007/s11067-005-6210-5.
  • Goodchild, M. F. 2009. “Geographic Information Systems and Science: Today and Tomorrow.” Annals of GIS 15 (1): 3–9. doi:10.1080/19475680903250715.
  • Guihaire, V., and J.-K. Hao. 2008. “Transit Network Design and Scheduling: A Global Review.” Transportation Research Part A: Policy and Practice 42 (10): 1251–1273.
  • Gutiérrez-Jarpa, G., C. Obreque, G. Laporte, and V. Marianov. 2013. “Rapid Transit Network Design for Optimal Cost and Origin-Destination Demand Capture.” Computers & Operations Research 40 (12): 3000–3009. doi:10.1016/j.cor.2013.06.013.
  • Gutiérrez-Jarpa, G., G. Laporte, V. Marianov, and L. Moccia. 2017. “Multi-Objective Rapid Transit Network Design with Modal Competition: The Case of Concepcion, Chile.” Computers & Operations Research 78: 27–43. doi:10.1016/j.cor.2016.08.009.
  • Kansky, K. 1963. Structure of Transportation Networks: Relationships between Network Geography and Regional Characteristics. University of Chicago, Department of Geography, Research Papers 84.
  • Magnanti, T. L., and R. T. Wong. 1984. “Network Design and Transportation Planning: Models and Algorithms.” Transportation Science 18 (1): 1–55. doi:10.1287/trsc.18.1.1.
  • Meschini, L., G. Gentile, and N. Papola. 2007. “A Frequency Based Transit Model for Dynamic Traffic Assignment to Multimodal Networks.” In Transportation and Traffic Theory, edited by R. E. Allsop, M. G. H. Bell, and B. G. Heydecker, 407–436. London, UK: Elsevier.
  • Mitchell, B. 2003. Jubilee Line Extension: From Concept to Completion. Institution of Civil Engineers. Thomas Telford Publishing, London, England.
  • Newman, M., A.-L. Barabasi, and D. J. Watts, eds. 2006. The Structure and Dynamics of Networks. Princeton, NJ: Princeton University Press.
  • Peng, F. 2004. “A Decision Support System for the Design of Urban Inter-Modal Public Transit Network.” In Proceedings of Codatu XI. Bucharest.
  • Pterneaa, M., K. Kepaptsoglou, and M. G. Karlaftis. 2015. “Sustainable Urban Transit Network Design.” Transportation Research Part A: Policy and Practice 77: 276–291.
  • Ribeiro, C., and M. Minoux. 1985. “A Heuristic Approach to Hard Constrained Shortest Path Problems.” Discrete Applied Mathematics 10 (2): 125–137. doi:10.1016/0166-218X(85)90007-1.
  • Rodrigue, J.-P., C. Comtois, and B. Slack. 2016. The Geography of Transport Systems. Taylor & Francis.
  • Yu, B., Z. Yang, C. Cheng, and C. Liu. 2005. “Optimizing Bus Transit Network with Parallel Ant Colony Algorithm.” Proceedings of the Eastern Asia Society for Transportation Studies 5: 374–389.
  • Zhao, F., and X. Zeng. 2006. “Simulated Annealing-Genetic Algorithm for Transit Network Optimization.” Journal of Computing in Civil Engineering 20: 57–68. doi:10.1061/(ASCE)0887-3801(2006)20:1(57).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.