An efficient implementation of a static move descriptor-based local search heuristic
type: Item
instance of: scholarly article
title: An efficient implementation of a static move descriptor-based local search heuristic
zbMATH Open document ID: 1391.90044
author: Onne Beek
author: Birger Raa
author: Daniele Vigo
author: Wout Dullaert
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 6901578
zbMATH Keywords: efficient local search
zbMATH Keywords: vehicle routing
zbMATH Keywords: static move descriptors
zbMATH Keywords: heuristic priority queue
describes a project that uses: VRP
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.cor.2018.01.006
OpenAlex ID: W2788141575
cites work: Q3138882
cites work: A guide to vehicle routing heuristics
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Tabu Search—Part I
cites work: Q4955265
cites work: Sequential search and its application to vehicle-routing problems
cites work: Q4365133
cites work: Very large-scale vehicle routing: new test problems, algorithms, and results
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Large-step Markov chains for the TSP incorporating local search heuristics
cites work: Variable neighborhood search
cites work: The traveling salesman. Computational solutions for RSP applications
cites work: Parallel iterative search methods for vehicle routing problems
cites work: The granular tabu search and its application to the vehicle-routing problem
cites work: New benchmark instances for the capacitated vehicle routing problem
cites work: Guided local search and its application to the traveling salesman problem
cites work: A data structure for manipulating priority queues
DOI: 10.1016/J.COR.2018.01.006
description: scientific article; zbMATH DE number 6901578