1,045
Views
11
CrossRef citations to date
0
Altmetric
Research Article

Maximizing space-time accessibility in multi-modal transit networks: an activity-based approach

ORCID Icon, , ORCID Icon & ORCID Icon
Pages 192-220 | Received 30 Nov 2019, Accepted 31 Jul 2020, Published online: 18 Aug 2020

References

  • Adler, T., and M. Ben-Akiva. 1979. “A Theoretical and Empirical Model of Trip Chaining Behaviour.” Transportation Research Part B: Methodological 13: 243–257.
  • Antunes, A., A. Seco, and N. Pinto. 2002. “Inter-Urban Road Network Planning: An Accessibility-Maximization Approach.” Journal of Decision Systems 11: 283–296.
  • Antunes, A., A. Seco, and N. Pinto. 2003. “An Accessibility-Maximization Approach to Road Network Planning.” Computer Aided Civil and Infrastructure Engineering 18: 224–240.
  • Arentze, T. A., and H. J. P. Timmermans. 2009. “A Need-Based Model of Multi-day, Multi-Person Activity Generation.” Transportation Research Part B 43 (2): 251–265.
  • Axhausen, K. W., and T. Gärling. 1992. “Activity-based Approaches to Travel Analysis: Conceptual Frameworks, Models, and Research Problems.” Transport Reviews 12: 323–341.
  • Bertsekas, D. P. 1995. “An Auction Algorithm for the Max-Flow Problem.” Journal of Optimization Theory and Applications 87: 69–101.
  • Cervero, R. 1997. “Paradigm Shift: From Automobility to Accessibility Planning.” Urban Futures: Issues for Australian Cities 22: 9–20.
  • Chen, B. Y., W. H. K. Lam, H. Shao, and A. Sumalee. 2019. “Accessibility-based Network Design Model Considering Induced Travel Demands.” In The 13th International Conference of Eastern Asia Society for Transportation Studies.
  • Chen, B. Y., W. H. K. Lam, A. Sumalee, and H. Shao. 2011. “An Efficient Solution Algorithm for Solving Multi-Class Reliability-Based Traffic Assignment Problem.” Mathematical and Computer Modelling 54 (5): 1428–1439.
  • Chen, J., Z. Liu, S. Zhu, and W. Wang. 2015. “Design of Limited-Stop Bus Service with Capacity Constraint and Stochastic Travel Time.” Transportation Research Part E 83: 1–15.
  • Chen, A., H. K. Lo, and H. Yang. 2001. “A Self-Adaptive Projection and Contraction Algorithm for the Traffic Assignment Problem with Path-Specific Costs.” European Journal of Operational Research 135 (1): 27–41.
  • Chen, A., C. Yang, S. Kongsomsaksakul, and M. Lee. 2007. “Network-based Accessibility Measures for Vulnerability Analysis of Degradable Transportation Networks.” Networks and Spatial Economics 7 (3): 241–256.
  • Chen, B. Y., H. Yuan, Q. Li, D. Wang, and W. H. K. Lam. 2017. “Measuring Place-Based Accessibility Under Travel Time Uncertainty.” International Journal of Geographical Information Science 31 (4): 783–804.
  • Chow, J. Y. J., and S. Djavadian. 2015. “Activity-based Market Equilibrium for Capacitated Multimodal Transport Systems.” Transportation Research Part C 59: 2–18.
  • Chow, J. Y. J., and W. W. Recker. 2012. “Inverse Optimization with Endogenous Arrival Time Constraints to Calibrate the Household Activity Pattern Problem.” Transportation Research Part B 46 (3): 463–479.
  • Di, Z., L. Yang, J. Qi, and Z. Gao. 2018. “Transportation Network Design for Maximizing Flow-Based Accessibility.” Transportation Research Part B 110: 209–238.
  • Dong, X., M. E. Ben-Akiva, J. L. Bowman, and J. L. Walker. 2006. “Moving From Trip-Based to Activity-Based Measures of Accessibility.” Transportation Research Part A 40 (2): 163–180.
  • Duan, F. 1994. “A Faster Algorithm for Shortest-Path – SPFA.” Journal of Southwest Jiaotong University 29: 207–212.
  • Ettema, D., and H. Timmermans. 2003. “Modeling Departure Time Choice in the Context of Activity Scheduling Behaviour.” Transportation Research Record 1831: 39–46.
  • Facchinei, F., and J. S. Pang. 2003. Finite-Dimensional Variational Inequalities and Complementarity Problems. Berlin: Springer.
  • Fu, X., and W. H. K. Lam. 2014. “A Network Equilibrium Approach for Modelling Activity-Travel Pattern Scheduling Problems in Multi-Modal Transit Networks with Uncertainty.” Transportation 41 (1): 37–55.
  • Fu, X., and W. H. K. Lam. 2018. “Modelling Joint Activity-Travel Pattern Scheduling Problem in Multi-Modal Transit Networks.” Transportation 45 (1): 23–49.
  • Fu, X., W. H. K. Lam, and Q. Meng. 2014. “Modelling Impacts of Adverse Weather Conditions on Activity – Travel Pattern Scheduling in Multi-Modal Transit Networks.” Transportmetrica B: Transport Dynamics 2: 151–167.
  • Geurs, K. T., and B. van Wee. 2004. “Accessibility Evaluation of Land-Use and Transport Strategies: Review and Research Directions.” Journal of Transport Geography 12: 127–140.
  • Gulhan, G., H. Ceylan, and H. Ceylan. 2018. “Using Accessibility Measures in Transit Network Design.” Transport 33 (2): 510–519.
  • Huang, D., Z. Liu, P. Liu, and J. Chen. 2016. “Optimal Transit Fare and Service Frequency of a Nonlinear Origin-Destination Based Fare Structure.” Transportation Research Part E 96: 1–19.
  • Kang, J. E., J. Y. J. Chow, and W. W. Recker. 2013. “On Activity-Based Network Design Problems.” Transportation Research 57B: 398–418.
  • Khoa, D. V., W. H. K. Lam, A. Chen, and H. Shao. 2020. “A Household Optimum Utility Approach for Modeling Joint Activity-Travel Choices in Congested Road Networks.” Transportation Research Part B: Methodological 134: 93–125.
  • Kim, H. M., and M. P. Kwan. 2003. “Space-time Accessibility Measures: A Geocomputational Algorithm with a Focus on the Feasible Opportunity set and Possible Activity Duration.” Journal of Geographical Systems 5: 71–91.
  • Kitamura, R. 1984. “Incorporating Trip Chaining Into Analysis of Destination Choice.” Transportation Research Part B: Methodological 18: 67–81.
  • Kwan, M. P. 1998. “Space-time and Integral Measures of Individual Accessibility: A Comparative Analysis Using a Point-Based Framework.” Geographical Analysis 30: 191–216.
  • Kwan, M. P. 2013. “Beyond Space (as we Knew it): Toward Temporally Integrated Geographies of Segregation, Health, and Accessibility.” Annals of the Association of American Geographers 103: 1078–1086.
  • Kwan, M. P., and J. Weber. 2008. “Scale and Accessibility: Implications for the Analysis of Land Use-Travel Interaction.” Applied Geography 28: 110–123.
  • Lam, W. H. K., and Y. Yin. 2001. “An Activity-Based Time-Dependent Traffic Assignment Model.” Transportation Research Part B 35 (6): 549–574.
  • Leventhal, T., G. Nemhauser, and L. Trotter Jr. 1973. “A Column Generation Algorithm for Optimal Traffic Assignment.” Transportation Science 7 (2): 168–176.
  • Li, Z. C., W. H. K. Lam, and S. C. Wong. 2011. “On the Allocation of New Lines in a Competitive Transit Network with Uncertain Demand and Scale Economies.” Journal of Advanced Transportation 45 (4): 233–251.
  • Li, Z. C., W. H. K. Lam, S. C. Wong, and A. Sumalee. 2010. “An Activity-Based Approach for Scheduling Multimodal Transit Services.” Transportation 37: 751–774.
  • Li, Q., F. Liao, H. J. P. Timmermans, H. Huang, and J. Zhou. 2018. “Incorporating Free-Floating Car-Sharing Into an Activity-Based Dynamic User Equilibrium Model: A Demand-Side Model.” Transportation Research Part B: Methodological 107: 102–123.
  • Liao, F. 2016. “Modeling Duration Choice in Space–Time Multi-State Supernetworks for Individual Activity-Travel Scheduling.” Transportation Research Part C: Emerging Technologies 69: 16–35.
  • Liao, F. 2019a. “Space–Time Prism Bounds of Activity Programs: A Goaldirected Search in Multi-State Supernetworks.” International Journal of Geographical Information Science 33: 900–921.
  • Liao, F. 2019b. “Joint Travel Problem in Space-Time Multi-State Supernetworks.” Transportation 46 (4): 1319–1343.
  • Liao, F., T. A. Arentze, and H. J. P. Timmermans. 2013. “Incorporating Space-Time Constraints and Activity-Travel Time Profiles in a Multi-State Supernetwork Approach to Individual Activity-Travel Scheduling.” Transportation Research Part B 55: 41–58.
  • Liu, P., F. Liao, H. J. Huang, and H. J. P. Timmermans. 2015. “Dynamic Activity-Travel Assignment in Multi-State Supernetworks.” Transportation Research Part B 81: 24–43.
  • Liu, P., F. Liao, H. J. Huang, and H. J. P. Timmermans. 2016. “Dynamic Activity-Travel Assignment in Multi-State Supernetworks Under Transport and Location Capacity Constraints.” Transportmetrica A: Transport Science 12: 572–590.
  • Liu, P., F. Liao, Q. Tian, H. J. Huang, and H. Timmermans. 2020. “Day-to-Day Needs-Based Activity-Travel Dynamics and Equilibria in Multi-State Supernetworks.” Transportation Research Part B: Methodological 132: 208–227.
  • Lo, H. K., C. W. Yip, and K. H. Wan. 2003. “Modeling Transfer and Non-Linear Fare Structure in Multi-Modal Network.” Transportation Research Part B 37 (2): 149–170.
  • Lovric, M., S. Raveau, M. Adnan, F. C. Pereira, K. Basak, H. Loganathan, and M. Ben-Akiva. 2016. “Evaluating off-Peak Pricing Strategies in Public Transportation with an Activity-Based Approach.” Transportation Research Record: Journal of the Transportation Research Board 2544: 10–19.
  • Lu, C. C., J. Liu, Y. Qu, S. Peeta, N. M. Rouphail, and X. Zhou. 2016. “Eco-system Optimal Time-Dependent Flow Assignment in a Congested Network.” Transportation Research Part B 94: 217–239.
  • Luo, Z. Q., J. S. Pang, and D. Ralph. 1996. Mathematical Programs with Equilibrium Constraints. Cambridge: Cambridge University Press.
  • Miller, H. J. 1999. “Measuring Space-Time Accessibility Benefits Within Transportation Networks: Basic Theory and Computational Procedures.” Geographical Analysis 31: 1–26.
  • Miller, H. J. 2005. “A Measurement Theory for Time Geography.” Geographical Analysis 37: 17–45.
  • Miller, H. J. 2007. “Location-based Versus People-Based Geographic Information Science.” Geography Compass 1: 503–535.
  • Neutens, T., M. Delafontaine, D. M. Scott, and P. D. Maeyer. 2012. “An Analysis of Day-to-Day Variations in Individual Space-Time Accessibility.” Journal of Transport Geography 23: 81–91.
  • Nielsen, O. A. 2000. “A Stochastic Transit Assignment Model Considering Differences in Passengers Utility Functions.” Transportation Research Part B: Methodological 34: 377–402.
  • Nurlaela, S., and C. Curtis. 2012. “Modeling Household Residential Location Choice and Travel Behaviour and its Relationship with Public Transport Accessibility.” Procedia – Social and Behavioral Sciences 54: 56–64.
  • Ramadurai, G., and S. Ukkusuri. 2010. “Dynamic User Equilibrium Model for Combined Activity-Travel Choices Using Activity–Travel Supernetwork Representation.” Networks and Spatial Economics 10: 273–292.
  • Rasouli, S., and H. J. P. Timmermans. 2014. “Activity-based Models of Travel Demand: Promises, Progress and Prospects.” International Journal of Urban Sciences 18: 31–60.
  • Roorda, M. J., and E. J. Miller. 2005. “Strategies for Resolving Activity Scheduling Conflicts: An Empirical Analysis.” In Progress in Activity-Based Analysis, edited by H. J. P. Timmermans, 203–222. Oxford: Elsevier.
  • Ruiz, T., and M. J. Roorda. 2011. “Assessing Planning Decisions by Activity Type During the Scheduling Process.” Transportmetrica 7: 417–442.
  • Shao, H., W. H. K. Lam, A. Sumalee, and A. Chen. 2018. “Network-Wide On-Line Travel Time Estimation with Inconsistent Data From Multiple Sensor Systems Under Network Uncertainty.” Transportmetrica A: Transport Science 14: 110–129.
  • Smith, M. J. 1979. “The Existence, Uniqueness and Stability of Traffic Equilibria.” Transportation Research Part B 13: 295–304.
  • Szeto, W. Y., and Y. Jiang. 2012. “Hybrid Artificial Bee Colony Algorithm for Transit Network Design.” Transportation Research Record 2284: 47–56.
  • Szeto, W. Y., and Y. Jiang. 2014. “Transit Route and Frequency Design: Bi-Level Modeling and Hybrid Artificial Bee Colony Algorithm Approach.” Transportation Research Part B: Methodological 67: 235–263.
  • Szeto, W. Y., Y. Wu, and S. C. Ho. 2011. “An Artificial Bee Colony Algorithm for the Capacitated Vehicle Routing Problem.” European Journal of Operational Research 215 (1): 126–135.
  • Tong, L., X. Zhou, and H. J. Miller. 2015. “Transportation Network Design for Maximizing Space-Time Accessibility.” Transportation Research Part B 81: 555–576.
  • Wan, N., B. Zou, and T. Sternberg. 2012. “A Three-Step Floating Catchment Area Method for Analyzing Spatial Access to Health Services.” International Journal of Geographical Information Science 26: 1073–1089.
  • Wang, D. G., and Y. W. Chai. 2009. “The Jobs-Housing Relationship and Commuting in Beijing, China: The Legacy of Danwei.” Journal of Transport Geography 17: 30–38.
  • Wang, Y., B. Y. Chen, H. Yuan, D. Wang, W. H. K. Lam, and Q. Li. 2018. “Measuring Temporal Variation of Location-Based Accessibility Using Space-Time Utility Perspective.” Journal of Transport Geography 73: 13–24.
  • Wang, D., F. Liao, Z. Gao, and H. Timmermans. 2019. “Tolerance-based Strategies for Extending the Column Generation Algorithm to the Bounded Rational Dynamic User Equilibrium Problem.” Transportation Research Part B 119: 102–121.
  • Weber, J., and M. P. Kwan. 2013. “Evaluating the Effects of Geographic Contexts on Individual Accessibility: A Multilevel Approach.” Urban Geography 24: 647–671.
  • Wu, B., and J. Hine. 2003. “A PTAL Approach to Measuring Changes in Bus Service Accessibility.” Transport Policy 10: 307–320.
  • Yamamoto, T., and R. Kitamura. 1999. “An Analysis of Time Allocation to In-Home and Out-of-Home Discretionary Activities Across Working Days and Non-Working Days.” Transportation 26: 231–250.
  • Zhang, X., H. Yang, H. J. Huang, and H. M. Zhang. 2005. “Integrated Scheduling of Daily Work Activities and Morning–Evening Commutes with Bottleneck Congestion.” Transportation Research Part A 39 (1): 41–60.

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.