Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
From MaRDI portal
(Redirected from Publication:3134567)
Recommendations
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
- Publication:4889095
- Application oriented variable fixing methods for the multiple depot vehicle scheduling problem
Cited in
(31)- Multi-objective temporal bin packing problem: an application in cloud computing
- scientific article; zbMATH DE number 1361557 (Why is no real title available?)
- A time-space network based exact optimization model for multi-depot bus scheduling
- Vehicle routing and crew scheduling for metropolitan mail distribution at Australia post
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- scientific article; zbMATH DE number 915580 (Why is no real title available?)
- Heuristic solutions to multi-depot location-routing problems
- Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies
- Heuristic dispatching models for multi-vehicle materials handling systems
- On a routing and scheduling problem concerning multiple edge traversals in graphs
- A comparison of different solution approaches to the vehicle scheduling problem in a practical case
- Electric bus planning \& scheduling: a review of related problems and methodologies
- Parallel Auction Algorithm for Bus Rescheduling
- Models and Algorithms for Single-Depot Vehicle Scheduling
- A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
- scientific article; zbMATH DE number 3991268 (Why is no real title available?)
- Multi-depot vehicle scheduling problems with time windows and waiting costs
- Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
- Simulation-based optimization for housekeeping in a container transshipment terminal
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A new ILP-based refinement heuristic for vehicle routing problems
- Routing problems: A bibliography
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- Application oriented variable fixing methods for the multiple depot vehicle scheduling problem
- A decision support system for the single-depot vehicle rescheduling problem
- Survey of research in the design and control of automated guided vehicle systems
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- Algorithms and codes for dense assignment problems: The state of the art
- A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
- Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows
- scientific article; zbMATH DE number 915578 (Why is no real title available?)
This page was built for publication: Heuristic Algorithms 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 Q3134567)
