Problem size reduction methods for large CVRPs
From MaRDI portal
Cites work
- A general heuristic for vehicle routing problems
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A method for solving traveling-salesman problems
- A Multilevel Approach to the Travelling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Decomposition Strategies for Vehicle Routing Heuristics
- Efficiently solving very large-scale routing problems
- Heuristics for a cash-collection routing problem with a cluster-first route-second approach
- scientific article; zbMATH DE number 3621663 (Why is no real title available?)
- scientific article; zbMATH DE number 976350 (Why is no real title available?)
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- Inventory rebalancing and vehicle routing in bike sharing systems
- New benchmark instances for the capacitated vehicle routing problem
- On Some Properties of Shortest Hamiltonian Circuits
- Optimization by simulated annealing
- Parallel iterative search methods for vehicle routing problems
- The granular tabu search and its application to the vehicle-routing problem
- The pickup and delivery problem with alternative locations and overlapping time windows
- The vehicle routing problem
- The vehicle routing problem with backhauls
- Vehicle routing problems with multiple trips
- Vehicle routing with backhauls: review and research perspectives
This page was built for publication: Problem size reduction methods for large CVRPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979315)
