Routing one million customers in a handful of minutes
From MaRDI portal
Publication:6551178
DOI10.1016/j.cor.2024.106562MaRDI QIDQ6551178
Publication date: 6 June 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A hybrid algorithm for a class of vehicle routing problems
- Variable neighborhood search
- Designing granular solution methods for routing problems with time windows
- Knowledge-guided local search for the vehicle routing problem
- Efficiently solving very large-scale routing problems
- New benchmark instances for the capacitated vehicle routing problem
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Record breaking optimization results using the ruin and recreate principle
- Sequential search and its application to vehicle-routing problems
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- The Truck Dispatching Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Vehicle Routing
- Detection of Influential Observation in Linear Regression
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Rounding and Propagation Heuristics for Mixed Integer Programming
- Decomposition Strategies for Vehicle Routing Heuristics
This page was built for publication: Routing one million customers in a handful of minutes
