On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
type: Item
instance of: scholarly article
title: On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
zbMATH Open document ID: 1180.90054
author: Herbert F. Lewis
author: Thomas R. Sexton
published in: Operations Research Letters
publication date: 2008-01-21T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5228906
zbMATH Keywords: analysis of algorithms
MaRDI profile type: MaRDI publication profile
full work available at URL: j.orl.2006.06.002
OpenAlex ID: W1968306102
cites work: Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
cites work: Bounds and Heuristics for Capacitated Routing Problems
cites work: Q3799801
cites work: Q4142699
DOI: 10.1016/J.ORL.2006.06.002
Recommended article: A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
Recommended article: Iterated tour partitioning for Euclidean capacitated vehicle routing
Recommended article: Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
Recommended article: An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
Recommended article: Tour splitting algorithms for vehicle routing problems
Recommended article: Heuristic procedures for the capacitated vehicle routing problem
Recommended article: Chain partitioning as a key element for building vehicle routing problem heuristics
Recommended article: Heuristic solution approaches for the cumulative capacitated vehicle routing problem
Recommended article: A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
Recommended article: On the capacitated vehicle routing problem
description: scientific article; zbMATH DE number 5228906