Efficiently solving very large-scale routing problems
From MaRDI portal
Publication:1738815
DOI10.1016/j.cor.2019.03.006zbMath1458.90055OpenAlexW2921712036WikidataQ128297900 ScholiaQ128297900MaRDI QIDQ1738815
Kenneth Sörensen, Florian Arnold, Michel Gendreau
Publication date: 18 April 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10067/1602270151162165141
Large-scale problems in mathematical programming (90C06) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Hybrid search with neighborhood reduction for the multiple traveling salesman problem, A review of vehicle routing with simultaneous pickup and delivery, A study on the pickup and delivery problem with time windows: matheuristics and new instances, A progressive filtering heuristic for the location-routing problem and variants, A POPMUSIC matheuristic for the capacitated vehicle routing problem, Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations, A concise guide to existing and emerging vehicle routing problem variants, Adjusting the order crossover operator for capacitated vehicle routing problems, A branch-and-cut embedded matheuristic for the inventory routing problem, Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery, Memetic search for the minmax multiple traveling salesman problem with single and multiple depots, Heuristic optimization for multi-depot vehicle routing problem in ATM network model, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid algorithm for a class of vehicle routing problems
- Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- How easy is local search?
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Knowledge-guided local search for the vehicle routing problem
- New benchmark instances for the capacitated vehicle routing problem
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Improved branch-cut-and-price for capacitated vehicle routing
- Sequential search and its application to vehicle-routing problems
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Vehicle Routing
- What you should know about the vehicle routing problem
- TSPLIB—A Traveling Salesman Problem Library
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Guided Local Search
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
