An exact algorithm for a vehicle-and-driver scheduling problem
From MaRDI portal
Recommendations
Cites work
- A branch-and-cut algorithm for vehicle routing problems
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Cvrplib
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 3883903 (Why is no real title available?)
- scientific article; zbMATH DE number 3943559 (Why is no real title available?)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Integer Programming Formulation of Traveling Salesman Problems
- Models and algorithms for integration of vehicle and crew scheduling
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Vehicle Routing
Cited in
(12)- The driver and vehicle routing problem
- Linear time approximation schemes for vehicle scheduling problems
- A dual strategy for solving the linear programming relaxation of a driver scheduling system
- An efficient multistart heuristic for the driver and vehicle routing problem
- Effective search space control for large and/or complex driver scheduling problems
- An estimation of distribution algorithm for public transport driver scheduling
- A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems
- scientific article; zbMATH DE number 5117519 (Why is no real title available?)
- scientific article; zbMATH DE number 744104 (Why is no real title available?)
- Driver scheduling based on “driver-friendly” vehicle schedules
- A new hybrid heuristic for driver scheduling
- The basic problem of vehicle scheduling can be solved by maximum bipartite matching
This page was built for publication: An exact algorithm for a vehicle-and-driver scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652246)