Solving min-max multi-depot vehicle routing problem
From MaRDI portal
Recommendations
- A GVNS algorithm for solving the multi-depot vehicle routing problem
- A new solution approach to multi-depot vehicle routing problem with ant colony optimization
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- New assignment algorithms for the multi-depot vehicle routing problem
- The multi-depot vehicle routing problem with inter-depot routes
Cited in
(27)- Mathematical formulations and improvements for the multi-depot open vehicle routing problem
- An efficient multistart heuristic for the driver and vehicle routing problem
- Gossip algorithms for heterogeneous multi-vehicle routing problems
- Using metaheuristics on the multi-depot vehicle routing problem with modified optimization criterion
- An approximation algorithm for vehicle routing with compatibility constraints
- Discrete optimization model and algorithm for driver planning in periodic driver routing problem
- Heuristics for the lexicographic Max-ordering vehicle routing problem
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- Geometric partitioning and robust ad-hoc network design
- Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
- Dividing a territory among several vehicles
- A multi-depot period vehicle routing problem arising in the utilities sector
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Improved load balancing and resource utilization for the skill vehicle routing problem
- New assignment algorithms for the multi-depot vehicle routing problem
- Multiple depot vehicle routing problems on clustering algorithms
- Decision Support System for the Multi-depot Vehicle Routing Problem
- A new solution approach to multi-depot vehicle routing problem with ant colony optimization
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Greedy and adaptive algorithms for multi-depot vehicle routing with object alternation
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
- Approximation algorithms for solving the trip-constrained vehicle routing cover problems
- Convex-hull based two-phase algorithm to solve capacitated vehicle routing problem
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
- The multi-depot vehicle routing problem with inter-depot routes
This page was built for publication: Solving min-max multi-depot vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5324200)
