Solving heterogeneous vehicle routing problems using decomposition and set covering
From MaRDI portal
Cites work
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- A heuristic algorithm for the truckload and less-than-truckload problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A heuristic column generation method for the heterogeneous fleet VRP
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- A hybrid algorithm for a class of vehicle routing problems
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- A parallel algorithm for the vehicle routing problem
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
- A survey on matheuristics for routing problems
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- AILS-II: an adaptive iterated local search heuristic for the large-scale capacitated vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- Clustering large graphs via the singular value decomposition
- Decomposition Strategies for Vehicle Routing Heuristics
- Designing delivery districts for the vehicle routing problem with stochastic demands
- Designing granular solution methods for routing problems with time windows
- Efficiently solving very large-scale routing problems
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 1749223 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- In-depth analysis of granular local search for capacitated vehicle routing
- Knowledge-guided local search for the vehicle routing problem
- MineReduce: an approach based on data mining for problem size reduction
- New benchmark instances for the capacitated vehicle routing problem
- Parallel iterative search methods for vehicle routing problems
- POPMUSIC -- partial optimization metaheuristic under special intensification conditions
- Problem size reduction methods for large CVRPs
- PyVRP: a high-performance VRP solver package
- Routing one million customers in a handful of minutes
- The capacitated team orienteering and profitable tour problems
- The fleet size and mix vehicle routing problem
- The fleet size and mix vehicle routing problem with time windows
- The granular tabu search and its application to the vehicle-routing problem
- The orienteering problem: a survey
- The vehicle routing problem with profits and consistency constraints
- Thirty years of heterogeneous vehicle routing
- Vehicle Routing
This page was built for publication: Solving heterogeneous vehicle routing problems using decomposition and set covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285950)
