An efficient implementation of a static move descriptor-based local search heuristic
From MaRDI portal
Publication:1652594
DOI10.1016/j.cor.2018.01.006zbMath1391.90044OpenAlexW2788141575MaRDI QIDQ1652594
Birger Raa, Daniele Vigo, Onne Beek, Wout E. H. Dullaert
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.01.006
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items
A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large-step Markov chains for the TSP incorporating local search heuristics
- The traveling salesman. Computational solutions for RSP applications
- Variable neighborhood search
- New benchmark instances for the capacitated vehicle routing problem
- Guided local search and its application to the traveling salesman problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Sequential search and its application to vehicle-routing problems
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Tabu Search—Part I
- A data structure for manipulating priority queues
- Parallel iterative search methods for vehicle routing problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A guide to vehicle routing heuristics
- Fibonacci heaps and their uses in improved network optimization algorithms
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
