An efficient implementation of a static move descriptor-based local search heuristic

DOI10.1016/J.COR.2018.01.006MaRDI QIDQ1652594zbMATH OpenOpenAlexFDO

Authors Onne Beek, Birger Raa, Daniele Vigo, Wout 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

zbMATH Keywords

vehicle routingefficient local searchheuristic priority queuestatic move descriptors

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Transportation, logistics and supply chain management (90B06)

Recommendations

• Sequential search and its application to vehicle-routing problems
• A new extension of local search applied to the Dial-A-Ride problem
• AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem

Cites work

• scientific article; zbMATH DE number 432754 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 1452993 (Why is no real title available?)
• A data structure for manipulating priority queues
• A guide to vehicle routing heuristics
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Guided local search and its application to the traveling salesman problem
• Large-step Markov chains for the TSP incorporating local search heuristics
• New benchmark instances for the capacitated vehicle routing problem
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Parallel iterative search methods for vehicle routing problems
• Sequential search and its application to vehicle-routing problems
• Tabu Search—Part I
• The granular tabu search and its application to the vehicle-routing problem
• The traveling salesman. Computational solutions for RSP applications
• Variable neighborhood search
• Very large-scale vehicle routing: new test problems, algorithms, and results

Cited in

(3)

• Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
• In-depth analysis of granular local search for capacitated vehicle routing

Describes a project that uses

Uses Software

• VRP
• TSPLIB

This page was built for publication: An efficient implementation of a static move descriptor-based local search heuristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652594)