Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
ORSA Journal on Computing · 1990-02 · 2 (1) · 64-73
DOI: 10.1287/ijoc.2.1.64 ↗Kurz gefasst
Fachartikel in der Zeitschrift ORSA Journal on Computing, 1990-02. Verfasst von Chung-Lun Li und 1 weiteren Autor:innen. Die Arbeit wurde bisher 57-mal zitiert (Crossref).
Abstract (Originalsprache)
We consider the multidepot capacitated vehicle routing problems and analyze the tour partitioning heuristics for different versions of the model. We prove that the worst-case ratios of the heuristics are bounded by some fixed numbers. Examples are provided to show that the worst-case bounds are tight or asymptotically tight for almost all versions. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Zitieren
APA
Li, C., & Simchi-Levi, D. (1990). Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems. ORSA Journal on Computing, 2(1), 64-73. https://doi.org/10.1287/ijoc.2.1.64
Vancouver
Li C, Simchi-Levi D. Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems. ORSA Journal on Computing. 1990;2(1):64-73. doi:10.1287/ijoc.2.1.64
BibTeX
@article{Li1990,
author = {Li, Chung-Lun and Simchi-Levi, David},
title = {Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems},
journal = {ORSA Journal on Computing},
year = {1990},
volume = {2},
number = {1},
pages = {64--73},
doi = {10.1287/ijoc.2.1.64}
}
EUVIMED