What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
type: Item
instance of: scholarly article
title: What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
zbMATH Open document ID: 1458.90642
author: Florian Arnold
author: K. Sörensen
published in: Computers \& Operations Research
publication date: 2019-03-27T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 7043539
zbMATH Keywords: data mining
zbMATH Keywords: heuristics
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: problem-specific knowledge
MaRDI profile type: Publication
full work available at URL: j.cor.2018.02.007
OpenAlex ID: W2616964197
cites work: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
cites work: Random forests
cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems
cites work: Q4955265
cites work: What you should know about the vehicle routing problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Comprehensible credit scoring models using rule extraction from support vector machines
cites work: Testing local search move operators on the vehicle routing problem with split deliveries and time windows
cites work: Active-guided evolution strategies for large-scale capacitated vehicle routing problems
cites work: To explain or to predict?
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
cites work: Guided Local Search
DOI: 10.1016/J.COR.2018.02.007
description: scientific article; zbMATH DE number 7043539