Activity-travel scheduling in stochastic multi-state supernetworks with spatial and temporal correlations

References

• Arentze, T. A., and H. J. P. Timmermans. 2004. “Multistate Supernetwork Approach to Modelling Multi-Activity, Multimodal Trip Chains.” International Journal of Geographical Information Science 18 (7): 631–651.
   Google Scholar
• Bhat, C. R., and F. S. Koppelman. 1999. “Activity-based Modeling of Travel Demand.” Handbook of Transportation Science, Springer, Boston, MA 35–61.
   Google Scholar
• Bovy, P. H. 2009. “On Modelling Route Choice Sets in Transportation Networks: A Synthesis.” Transport Reviews 29 (1): 43–68.
   Google Scholar
• Bowman, J. L., and M. E. Ben-Akiva. 2001. “Activity-based Disaggregate Travel Demand Model System with Activity Schedules.” Transportation Research Part A: Policy and Practice 35 (1): 1–28.
   Google Scholar
• Chen, B. Y., W. H. K. Lam, Q. Li, A. Sumalee, and K. Yan. 2013. “Shortest Path Finding Problem in Stochastic Time-Dependent Road Networks with Stochastic First-in-First-out Property.” IEEE Transactions on Intelligent Transportation Systems 14 (4): 1907–1917.
   Google Scholar
• Chen, B. Y., W. H. K. Lam, A. Sumalee, and Z. L. Li. 2012. “Reliable Shortest Path Finding in Stochastic Networks with Spatial Correlated Link Travel Times.” International Journal of Geographical Information Science 26 (2): 365–386.
   Google Scholar
• Dean, B. C. 2004. “Shortest Paths in FIFO Time-dependent Networks: Theory and Algorithms.” Rapport technique, Massachusetts Institute of Technology.
   Google Scholar
• Dijkstra, E. W. 1959. “A Note on two Problems in Connection with Graphs.” Numerische Mathematik 1 (1): 269–271.
   Google Scholar
• Dougherty, J., R. Kohavi, and M. Sahami. 1995. “Supervised and Unsupervised Discretization of Continuous Features.” Machine learning proceedings 1995. Morgan Kaufmann 194–202.
   Google Scholar
• Dupačová, J., N. Gröwe-Kuska, and W. Römisch. 2003. “Scenario Reduction in Stochastic Programming.” Mathematical Programming 95 (3): 493–511.
   Google Scholar
• Fan, Y. Y., R. E. Kalaba, and J. E. Moore, II. 2005. “Shortest Paths in Stochastic Networks with Correlated Link Costs.” Computers & Mathematics with Applications 49 (9–10): 1549–1564.
   Google Scholar
• 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.
   Google Scholar
• Fu, X., W. H. K. Lam, and B. Y. Chen. 2014. “A Reliability-Based Traffic Assignment Model for Multi-Modal Transport Network Under Demand Uncertainty.” Journal of Advanced Transportation 48 (1): 66–85.
   Google Scholar
• Gan, L. P., and W. Recker. 2008. “A Mathematical Programming Formulation of the Household Activity Rescheduling Problem.” Transportation Research Part B: Methodological 42 (6): 571–606.
   Google Scholar
• Gan, L. P., and W. Recker. 2013. “Stochastic Preplanned Household Activity Pattern Problem with Uncertain Activity Participation (SHAPP).” Transportation Science 47 (3): 439–454.
   Google Scholar
• Gao, S., and I. Chabini. 2006. “Optimal Routing Policy Problems in Stochastic Time-Dependent Networks.” Transportation Research Part B: Methodological 40: 93–122.
   Google Scholar
• Gupta, A., K. G. Mehrotra, and C. Mohan. 2010. “A Clustering-Based Discretization for Supervised Learning.” Statistics & Probability Letters 80 (9–10): 816–824.
   Google Scholar
• Hardin, J., S. R. Garcia, and D. Golan. 2013. “A Method for Generating Realistic Correlation Matrices.” The Annals of Applied Statistics 7 (3): 1733–1762.
   Google Scholar
• Hogarth, R. M. 1975. “Cognitive Processes and the Assessment of Subjective Probability Distributions.” Journal of the American Statistical Association 70 (350): 271–289.
   Google Scholar
• Huang, H., and S. Gao. 2012. “Optimal Paths in Dynamic Networks with Dependent Random Link Travel Times.” Transportation Research Part B: Methodological 46 (5): 579–598.
   Google Scholar
• Huang, H., and S. Gao. 2018. “Trajectory-adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times.” Transportation Science 52 (1): 102–117.
   Google Scholar
• Jenelius, E. 2012. “The Value of Travel Time Variability with Trip Chains, Flexible Scheduling and Correlated Travel Times.” Transportation Research Part B: Methodological 46 (6): 762–780.
   Google Scholar
• Joh, C. H., T. A. Arentze, and H. J. P. Timmermans. 2008. “DANA: Dissimilarity Analysis of Activity travel Patterns.” Eindhoven, the Netherlands.
   Google Scholar
• Li, Q., F. Liao, H. J. P. Timmermans, and J. Zhou. 2016. “A User Equilibrium Model for Combined Activity–Travel Choice Under Prospect Theoretical Mechanisms of Decision-Making Under Uncertainty.” Transportmetrica A: Transport Science 12 (7): 629–649.
   Google Scholar
• 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.
   Google Scholar
• Liao, F., T. A. Arentze, and H. J. P. Timmermans. 2010. “Supernetwork Approach for Multimodal and Multiactivity Travel Planning.” Transportation Research Record 2175 (1): 38–46.
   Google Scholar
• Liao, F., T. A. Arentze, and H. J. P. Timmermans. 2011. “Constructing Personalized Transportation Networks in Multi-State Supernetworks: a Heuristic Approach.” International Journal of Geographical Information Science 25 (11): 1885–1903.
   Google Scholar
• Liao, F., T. A. Arentze, and H. J. P. Timmermans. 2012. “Supernetwork Approach for Modeling Traveler Response to Park-and-Ride.” Transportation Research Record 2323 (1): 10–17.
   Google Scholar
• 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: Methodological 55: 41–58.
   Google Scholar
• Liao, F., S. Rasouli, and H. J. P. Timmermans. 2014. “Incorporating Activity-Travel Time Uncertainty and Stochastic Space–Time Prisms in Multistate Supernetworks for Activity-Travel Scheduling.” International Journal of Geographical Information Science 28 (5): 928–945.
   Google Scholar
• Löhndorf, N. 2016. “An Empirical Analysis of Scenario Generation Methods for Stochastic Optimization.” European Journal of Operational Research 255 (1): 121–132.
   Google Scholar
• Mak, S., and V. R. Joseph. 2018. “Support Points.” The Annals of Statistics 46 (6A): 2562–2592.
   Google Scholar
• Miller-Hooks, E. D., and H. S. Mahmassani. 2000. “Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks.” Transportation Science 34 (2): 198–215.
   Google Scholar
• Miller, G. A. 1956. “The Magical Number Seven, Plus or Minus two: Some Limits on our Capacity for Processing Information.” Psychological Review 63 (2): 81.
   Google Scholar
• Nie, Y. M., and X. Wu. 2009a. “Reliable a Priori Shortest Path Problem with Limited Spatial and Temporal Dependencies.” In Transportation and Traffic Theory 2009: Golden Jubilee, 169–195.
   Google Scholar
• Nie, Y. M., and X. Wu. 2009b. “Shortest Path Problem Considering on-Time Arrival Probability.” Transportation Research Part B: Methodological 43 (6): 597–613.
   Google Scholar
• Prato, C. G. 2009. “Route Choice Modeling: Past, Present and Future Research Directions.” Journal of Choice Modelling 2 (1): 65–100.
   Google Scholar
• Rasouli, S., and H. J. P. Timmermans. 2014. “Activity-based Models of Travel Demand: Promises, Progress and Prospects.” International Journal of Urban Sciences 18 (1): 31–60.
   Google Scholar
• Rujeerapaiboon, N., K. Schindler, D. Kuhn, and W. Wiesemann. 2018. “Scenario Reduction Revisited: Fundamental Limits and Guarantees.” Mathematical Programming, 1–36.
   Google Scholar
• Saxena, A., M. Prasad, A. Gupta, N. Bharill, O. P. Patel, A. Tiwari, E. M. Joo, W. P. Ding, and C. T. Lin. 2017. “A Review of Clustering Techniques and Developments.” Neurocomputing 267: 664–681.
   Google Scholar
• Shahabi, M., A. Unnikrishnan, and S. D. Boyles. 2013. “An Outer Approximation Algorithm for the Robust Shortest Path Problem.” Transportation Research Part E: Logistics and Transportation Review 58: 52–66.
   Google Scholar
• Smith, G. F., P. G. Benson, and S. P. Curley. 1991. “Belief, Knowledge, and Uncertainty: A Cognitive Perspective on Subjective Probability.” Organizational Behavior and Human Decision Processes 48 (2): 291–321.
   Google Scholar
• Tilahun, N. Y., and D. M. Levinson. 2010. “A Moment of Time: Reliability in Route Choice Using Stated Preference.” Journal of Intelligent Transportation Systems 14 (3): 179–187.
   Google Scholar
• Waller, S. T., and A. K. Ziliaskopoulos. 2002. “On the Online Shortest Path Problem with Limited arc Cost Dependencies.” Networks: An International Journal 40 (4): 216–227.
   Google Scholar
• Wang, D., F. Liao, Z. Gao, and H. J. P. Timmermans. 2019. “Tolerance-based Strategies for Extending the Column Generation Algorithm to the Bounded Rational Dynamic User Equilibrium Problem.” Transportation Research Part B: Methodological 119: 102–121.
   Google Scholar
• Xing, T., and X. Zhou. 2011. “Finding the Most Reliable Path with and Without Link Travel Time Correlation: A Lagrangian Substitution Based Approach.” Transportation Research Part B: Methodological 45 (10): 1660–1679.
   Google Scholar
• Yang, L., and X. Zhou. 2014. “Constraint Reformulation and a Lagrangian Relaxation-Based Solution Algorithm for a Least Expected Time Path Problem.” Transportation Research Part B: Methodological 59: 22–44.
   Google Scholar
• Zockaie, A., H. S. Mahmassani, and Y. M. Nie. 2016. “Path Finding in Stochastic Time Varying Networks with Spatial and Temporal Correlations for Heterogeneous Travelers.” Transportation Research Record: Journal of the Transportation Research Board 2567 (1): 105–113.
   Google Scholar
• Zockaie, A., Y. M. Nie, X. Wu, and H. S. Mahmassani. 2013. “Impacts of Correlations on Reliable Shortest Path Finding.” Transportation Research Record: Journal of the Transportation Research Board 2334 (1): 1–9.
   Google Scholar