A powerful route minimization heuristic for the vehicle routing problem with time windows
type: Item
instance of: scholarly article
title: A powerful route minimization heuristic for the vehicle routing problem with time windows
zbMATH Open document ID: 1173.90358
author: Yuichi Nagata
author: Olli Bräysy
published in: Operations Research Letters
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5634570
zbMATH Keywords: vehicle routing
zbMATH Keywords: heuristics
zbMATH Keywords: time windows
zbMATH Keywords: guided local search
MaRDI profile type: Publication
full work available at URL: j.orl.2009.04.006
OpenAlex ID: W1981040114
Wikidata QID: Q110084972
cites work: A general heuristic for vehicle routing problems
cites work: A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows
cites work: A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
cites work: Guided local search joins the elite in discrete optimisation
cites work: Guided Local Search
cites work: An Exchange Heuristic for Routeing Problems with Time Windows
cites work: Q4365135
cites work: An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
DOI: 10.1016/J.ORL.2009.04.006
description: scientific article; zbMATH DE number 5634570