On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem

Herbert F. Lewis; Thomas R. Sexton

doi:10.1016/j.orl.2006.06.002

On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem

Dean's Office, College of Business

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

The tour partitioning heuristic for the vehicle routing problem assumes an unlimited supply of vehicles. If the number of vehicles is fixed, this heuristic may produce infeasible solutions. We modify the heuristic to guarantee feasibility in this situation and we analyze the worst-case performance of the modified heuristic.

Original language	English
Pages (from-to)	374-378
Number of pages	5
Journal	Operations Research Letters
Volume	35
Issue number	3
DOIs	https://doi.org/10.1016/j.orl.2006.06.002
State	Published - May 2007

Keywords

Analysis of algorithms
Heuristic algorithm
Vehicle routing problem

Access to Document

10.1016/j.orl.2006.06.002

Cite this

@article{a3c81becc33e43dda7f08bbcc0cca9a0,

title = "On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem",

abstract = "The tour partitioning heuristic for the vehicle routing problem assumes an unlimited supply of vehicles. If the number of vehicles is fixed, this heuristic may produce infeasible solutions. We modify the heuristic to guarantee feasibility in this situation and we analyze the worst-case performance of the modified heuristic.",

keywords = "Analysis of algorithms, Heuristic algorithm, Vehicle routing problem",

author = "Lewis, \{Herbert F.\} and Sexton, \{Thomas R.\}",

year = "2007",

month = may,

doi = "10.1016/j.orl.2006.06.002",

language = "English",

volume = "35",

pages = "374--378",

journal = "Operations Research Letters",

issn = "0167-6377",

number = "3",

}

TY - JOUR

T1 - On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem

AU - Lewis, Herbert F.

AU - Sexton, Thomas R.

PY - 2007/5

Y1 - 2007/5

N2 - The tour partitioning heuristic for the vehicle routing problem assumes an unlimited supply of vehicles. If the number of vehicles is fixed, this heuristic may produce infeasible solutions. We modify the heuristic to guarantee feasibility in this situation and we analyze the worst-case performance of the modified heuristic.

AB - The tour partitioning heuristic for the vehicle routing problem assumes an unlimited supply of vehicles. If the number of vehicles is fixed, this heuristic may produce infeasible solutions. We modify the heuristic to guarantee feasibility in this situation and we analyze the worst-case performance of the modified heuristic.

KW - Analysis of algorithms

KW - Heuristic algorithm

KW - Vehicle routing problem

UR - https://www.scopus.com/pages/publications/34247129581

U2 - 10.1016/j.orl.2006.06.002

DO - 10.1016/j.orl.2006.06.002

M3 - Article

AN - SCOPUS:34247129581

SN - 0167-6377

VL - 35

SP - 374

EP - 378

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this