Knowledge-guided local search for the vehicle routing problem
From MaRDI portal
Publication:1722960
DOI10.1016/j.cor.2019.01.002zbMath1458.90056OpenAlexW2908789966MaRDI QIDQ1722960
Kenneth Sörensen, Florian Arnold
Publication date: 19 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10067/1585050151162165141
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Hybrid search with neighborhood reduction for the multiple traveling salesman problem ⋮ An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem ⋮ A progressive filtering heuristic for the location-routing problem and variants ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions ⋮ Adjusting the order crossover operator for capacitated vehicle routing problems ⋮ In-depth analysis of granular local search for capacitated vehicle routing ⋮ Memetic search for the minmax multiple traveling salesman problem with single and multiple depots ⋮ Binary well placement optimization using a decomposition-based multi-objective evolutionary algorithm with diversity preservation ⋮ Efficiently solving very large-scale routing problems ⋮ Efficient approximation of the metric CVRP in spaces of fixed doubling dimension ⋮ Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
Uses Software
Cites Work
- Large neighborhood search for multi-trip vehicle routing
- A hybrid algorithm for a class of vehicle routing problems
- Tabu search -- uncharted domains
- A library of local search heuristics for the vehicle routing problem
- A general heuristic for vehicle routing problems
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- How easy is local search?
- Variable neighborhood search
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- New benchmark instances for the capacitated vehicle routing problem
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Sequential search and its application to vehicle-routing problems
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- A memetic algorithm for the multi trip vehicle routing problem
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- What you should know about the vehicle routing problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Guided Local Search
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Vehicle Routeing with Multiple Use of Vehicles
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Vehicle routing problems with multiple trips
- Handbook of metaheuristics
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
- Unnamed Item
- Unnamed Item
