Tabu search for driver scheduling
From MaRDI portal
Recommendations
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- scientific article; zbMATH DE number 2209651
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- scientific article; zbMATH DE number 1488070
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
Cited in
(12)- Staff scheduling and rostering: a review of applications, methods and models.
- Solving a multi-objective interval crew-scheduling problem via genetic algorithms
- Railway crew scheduling: models, methods and applications
- Effective search space control for large and/or complex driver scheduling problems
- Subgraph ejection chains and tabu search for the crew scheduling problem
- GENETIC ALGORITHM AND TABU SEARCH METHODS FOR CARE SERVICE SCHEDULING PROBLEM AND COMPARISON BETWEEN THESE TWO METHODS
- scientific article; zbMATH DE number 1488070 (Why is no real title available?)
- Driver scheduling based on “driver-friendly” vehicle schedules
- A new hybrid heuristic for driver scheduling
- A genetic algorithm for public transport driver scheduling
- A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows
- Integrating column generation and large neighborhood search for bus driver scheduling with complex break constraints
This page was built for publication: Tabu search for driver scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2759908)