A comparison of five heuristics for the multiple depot vehicle scheduling problem
From MaRDI portal
Recommendations
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- scientific article; zbMATH DE number 3991268
- Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
Cites work
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A time-space network based exact optimization model for multi-depot bus scheduling
- A unified tabu search heuristic for vehicle routing problems with time windows
- An exact algorithm for multiple depot bus scheduling
- Branch-and-price: Column generation for solving huge integer programs
- Decomposition Principle for Linear Programs
- Future paths for integer programming and links to artificial intelligence
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1452994 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- Models and Algorithms for Single-Depot Vehicle Scheduling
- Multi-depot vehicle scheduling problems with time windows and waiting costs
- Network flows. Theory, algorithms, and applications.
- On some matching problems arising in vehicle scheduling models
- Parallel iterative search methods for vehicle routing problems
- Vehicle scheduling in public transit and Lagrangean pricing
Cited in
(27)- A comparison of different solution approaches to the vehicle scheduling problem in a practical case
- Planning of complex supply chains: a performance comparison of three meta-heuristic algorithms
- Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
- The traveling salesman problem with draft limits
- The inventory-routing problem with transshipment
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Multi-depot vehicle scheduling problems with time windows and waiting costs
- High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows
- Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows
- Modeling and solving the multimodal car- and ride-sharing problem
- Electric bus planning \& scheduling: a review of related problems and methodologies
- A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority
- Solution approaches for integrated vehicle and crew scheduling with electric buses
- Application oriented variable fixing methods for the multiple depot vehicle scheduling problem
- Vehicle scheduling based on variable trip times with expected on-time performance
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
- The synchronized arc and node routing problem: application to road marking
- Heuristics for dynamic and stochastic inventory-routing
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
- A hybrid method for the probabilistic maximal covering location-allocation problem
- An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem
- A school bus scheduling problem
- A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
- Scheduling the vehicles of bus rapid transit systems: a case study
- Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
This page was built for publication: A comparison of five heuristics for the multiple depot vehicle scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835636)
