A heuristic and lower bound for a multi-depot routing problem
From MaRDI portal
(Redirected from Publication:1905085)
Recommendations
- The Multi-Depot Routing Allocation Problem
- The multi-depot vehicle routing problem with inter-depot routes
- Heuristic solutions to multi-depot location-routing problems
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
Cites work
Cited in
(11)- Heuristic solutions to multi-depot location-routing problems
- Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network
- A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems
- High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons
- The Multi-Depot Routing Allocation Problem
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- Heuristic strategies for a multi-allocation problem in LTL logistics
- Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles
This page was built for publication: A heuristic and lower bound for a multi-depot routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1905085)