Multi-depot vehicle routing problem with time windows under shared depot resources
From MaRDI portal
Publication:5963636
Recommendations
- Multi-depot time dependent vehicle routing problem with heterogeneous fleet and time windows
- A new variable neighborhood search algorithm for the multi depot heterogeneous vehicle routing problem with time windows
- A hybrid genetic algorithm for the multi-depot open vehicle routing problem
- Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
- The multi-depot vehicle routing problem with inter-depot routes
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- A general heuristic for vehicle routing problems
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- A reactive variable neighborhood search for the vehicle-routing problem with time windows
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
- A unified tabu search heuristic for vehicle routing problems with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- New measures of proximity for the assignment algorithms in the MDVRPTW
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The open vehicle routing problem with time windows
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
Cited in
(14)- A general VNS for the multi-depot open vehicle routing problem with time windows
- Logic-based benders decomposition for an inter-modal transportation problem
- A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets
- Approximation schemes for Euclidean vehicle routing problems with time windows
- A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
- Improved modeling and solution methods for the multi-resource routing problem
- The multi-depot vehicle routing problem with inter-depot routes
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- Application of multiagent technologies to multiple depot vehicle routing problem with time windows
- Crowdsourced humanitarian relief vehicle routing problem
- Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem
- A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location
- Multi-depot time dependent vehicle routing problem with heterogeneous fleet and time windows
This page was built for publication: Multi-depot vehicle routing problem with time windows under shared depot resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963636)
