The following pages link to Arriving on time (Q2499355):
Displaying 18 items.
- Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
- Optimal routing for maximizing the travel time reliability (Q862490) (← links)
- Stochastic shortest path with unlimited hops (Q976100) (← links)
- A new model for path planning with interval data (Q1000974) (← links)
- Arrival time dependent routing policies in public transport (Q1627847) (← links)
- Solving the stochastic time-dependent orienteering problem with time windows (Q1751260) (← links)
- A simple ant colony optimizer for stochastic shortest path problems (Q1945168) (← 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)
- Dynamic traveling salesman problem with stochastic release dates (Q2327624) (← links)
- Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering (Q2364368) (← links)
- A multi-objective approach for PH-graphs with applications to stochastic shortest paths (Q2661758) (← links)
- A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times (Q2875605) (← links)
- Robust Adaptive Routing Under Uncertainty (Q4969320) (← links)
- The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks (Q5003704) (← links)
- Computing Constrained Shortest-Paths at Scale (Q5031006) (← links)
- Markov decision processes associated with two threshold probability criteria (Q5167593) (← links)
- Mean‐standard deviation model for minimum cost flow problem (Q6179689) (← links)