Pages that link to "Item:Q2783884"

The following pages link to Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks (Q2783884):

Displaying 39 items.

• Optimal path problems with second-order stochastic dominance constraints (Q264233) (← links)
• Linear programming formulation for strategic dynamic traffic assignment (Q264276) (← links)
• Effects of countdown displays in public transport route choice under severe overcrowding (Q298902) (← links)
• Dynamic shortest path problems: hybrid routing policies considering network disruptions (Q336651) (← links)
• New reformulations of distributionally robust shortest path problem (Q342487) (← links)
• The dynamic shortest path problem with anticipation (Q852944) (← links)
• Optimal routing for maximizing the travel time reliability (Q862490) (← links)
• Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network (Q948645) (← links)
• A new model for path planning with interval data (Q1000974) (← links)
• Breakdown minimization principle versus Wardrop's equilibria for dynamic traffic assignment and control in traffic and transportation networks: a critical mini-review (Q1620203) (← links)
• Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation (Q1642944) (← links)
• Multicriteria stochastic shortest path problem for electric vehicles (Q1642961) (← links)
• Criticism of generally accepted fundamentals and methodologies of traffic and transportation theory: a brief review (Q1673274) (← links)
• Concealment measurement and flow distribution of military supply transportation: a double-entropy model (Q1681511) (← links)
• Corrigendum to: ``Least expected time paths in stochastic schedule-based transit networks'' (Q1721083) (← links)
• Itinerary planning with time budget for risk-averse travelers (Q1754240) (← links)
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks (Q1869511) (← links)
• A simple ant colony optimizer for stochastic shortest path problems (Q1945168) (← links)
• Optimising waiting at nodes in time-dependent networks: cost functions and applications (Q1949565) (← links)
• The global optimal algorithm of reliable path finding problem based on backtracking method (Q1992766) (← links)
• Reliability in public transit networks considering backup itineraries (Q2116902) (← links)
• Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network (Q2129372) (← links)
• Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks (Q2183323) (← links)
• Dynamic journeying under uncertainty (Q2253524) (← links)
• Lagrangian relaxation for the multiple constrained robust shortest path problem (Q2298370) (← links)
• Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering (Q2364368) (← links)
• Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly (Q2371467) (← links)
• Shortest paths in stochastic networks with correlated link costs (Q2387385) (← links)
• Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) (← links)
• Arriving on time (Q2499355) (← links)
• Ranking paths in stochastic time-dependent networks (Q2514742) (← links)
• Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge (Q2514743) (← links)
• An approach to the distributionally robust shortest path problem (Q2668652) (← links)
• Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks (Q2669733) (← links)
• Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings (Q2670574) (← links)
• The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks (Q2943828) (← links)
• STOCHASTIC SCENARIO-BASED TIME-STAGE OPTIMIZATION MODEL FOR THE LEAST EXPECTED TIME SHORTEST PATH PROBLEM (Q3195012) (← links)
• UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS (Q3422198) (← links)
• Robust Adaptive Routing Under Uncertainty (Q4969320) (← links)