SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Large-scale transit itinerary planning under uncertainty
16 references·0 citing·35 second hop
Large-scale transit itinerary planning under uncertainty (2015)Large-scale transit itinerary planning un…Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem (2013)Constraint reformulation and …Optimal paths in dynamic networks with dependent random link travel times (2012)Optimal paths in dynamic netw…Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach (2011)Finding the most reliable pat…Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns (2010)Fast Routing in Very Large Pu…Shortest path problem considering on-time arrival probability (2009)Shortest path problem conside…Robust Optimization for Empty Repositioning Problems (2009)Robust Optimization for Empty…Algorithms for Itinerary Planning in Multimodal Transportation Networks (2008)Algorithms for Itinerary Plan…Two-Stage Robust Network Flow and Design Under Demand Uncertainty (2007)Two-Stage Robust Network Flow…An Analytic Stochastic Model for the Transit Vehicle Holding Problem (2001)An Analytic Stochastic Model …An adaptive routing algorithm for in-vehicle route guidance systems with real-time information (2001)An adaptive routing algorithm…A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems (2001)A Mean-Variance Model for Rou…Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks (2000)Least Expected Time Paths in …Adaptive least-expected time paths in stochastic, time-varying transportation and data networks (2000)Adaptive least-expected time …Least possible time paths in stochastic,time-varying networks (1998)Least possible time paths in …Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications (1993)Time dependent, shortest-path…The Fastest Path through a Network with Random Time-Dependent Travel Times (1986)The Fastest Path through a Ne…Probability Concepts in Engineering Planning and Design (1975)Expected shortest paths in dynamic and stochastic traffic networks (1998)Shortest paths in stochastic networks with correlated link costs (2005)Finding Reliable Shortest Paths in Road Networks Under Uncertainty (2012)The Theory of Games and Economic Behavior (1945)Theory of games and economic behavior (2019)Control Strategies for an Idealized Public Transportation System (1972)The Holding Problem with Real–Time Information Available (2001)Chapter 2 Public Transit (2006)Hybrid predictive control for real-time optimization of public transport systems’ operations based on evolutionary multi-objective optimization (2009)Modelling bus bunching and holding control with vehicle overtaking and distributed passenger boarding behaviour (2017)Stochastic Programming (1995)Chapter 9 Hazardous Materials Transportation (2006)Stochastic Programming (2010)Finding most reliable paths on networks with correlated and shifted log–normal travel times (2013)Robust Convex Optimization (1998)The Price of Robustness (2004)Robust and Data-Driven Optimization: Modern Decision Making Under Uncertainty (2006)A Linear Decision-Based Approximation Approach to Stochastic Programming (2007)A Comparative Theoretical and Computational Study on Robust Counterpart Optimization: I. Robust Linear Optimization and Robust Mixed Integer Linear Optimization (2011)Introduction to Stochastic Programming (2011)Toward the design of intelligent traveler information systems (1998)An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays (2000)Travelers’ preferences in multimodal networks: Design and results of a comprehensive series of choice experiments (2013)Multi-criteria approaches for urban passenger transport systems: a literature review (2014)Multimodal urban mobility and multilayer transport networks (2022)Application of a Technique for Research and Development Program Evaluation (1959)Introduction to Stochastic Programming (1997)Optimal routing policy problems in stochastic time-dependent networks (2005)Adaptive route choices in risky traffic networks: A prospect theory approach (2009)Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks (2002)Dispatching and routing of emergency vehicles in disaster mitigation using data fusion (2008)Evacuation Transportation Planning Under Uncertainty: A Robust Optimization Approach (2009)Algorithm Engineering in Robust Optimization (2016)A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice (2019)
this work references cited by second hop

References

  • 1986The Fastest Path through a Network with Random Time-Dependent Travel Times404 cited
  • 2007Two-Stage Robust Network Flow and Design Under Demand Uncertainty340 cited
  • 2000Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks310 cited
  • 2009Shortest path problem considering on-time arrival probability308 cited
  • 2001An Analytic Stochastic Model for the Transit Vehicle Holding Problem237 cited
  • 1993Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications208 cited
  • 2008Algorithms for Itinerary Planning in Multimodal Transportation Networks151 cited
  • 2009Robust Optimization for Empty Repositioning Problems151 cited
  • 2001An adaptive routing algorithm for in-vehicle route guidance systems with real-time information149 cited
  • 2000Adaptive least-expected time paths in stochastic, time-varying transportation and data networks147 cited
  • 2011Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach133 cited
  • 2001A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems130 cited
  • 2013Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem128 cited
  • 2010Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

122 cited
  • 1998Least possible time paths in stochastic,time-varying networks103 cited
  • 2012Optimal paths in dynamic networks with dependent random link travel times95 cited
  • Cited by

    No citing works inside the corpus for this window.