A labeling method for dynamic driver-task assignment with uncertain task durations
From MaRDI portal
Recommendations
- Dynamic traffic assignment under uncertainty: a distributional robust chance-constrained approach
- A new hybrid heuristic for driver scheduling
- Dynamic policies for uncertain time‐critical tasking problems
- scientific article; zbMATH DE number 1057929
- Adaptive labeling algorithms for the dynamic assignment problem
- Driver scheduling based on “driver-friendly” vehicle schedules
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
- A solution approach for dynamic vehicle and crew scheduling
Cites work
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- Adaptive labeling algorithms for the dynamic assignment problem
- An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
- Routing with time windows by column generation
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Fixed Job Schedule Problem with Working-Time Constraints
- The Vehicle Routing Problem with Stochastic Travel Times
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Use of Sample Information in Stochastic Recourse and Chance-Constrained Programming Models
Cited in
(2)
This page was built for publication: A labeling method for dynamic driver-task assignment with uncertain task durations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2488239)