Improved bounds for vehicle routing solutions

Agustín Bompadre, Moshe Dror, James B. Orlin

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then utilized in a design of best-to-date approximation algorithms.

Original languageEnglish (US)
Pages (from-to)299-316
Number of pages18
JournalDiscrete Optimization
Volume3
Issue number4
DOIs
StatePublished - Dec 1 2006

Fingerprint

Vehicle Routing
Vehicle routing
Approximation algorithms
Vehicle Routing Problem
Approximation Algorithms
Lower bound
Design

Keywords

  • Approximation algorithm
  • Lower bound
  • Vehicle routing problem

ASJC Scopus subject areas

  • Software
  • Control and Optimization

Cite this

Improved bounds for vehicle routing solutions. / Bompadre, Agustín; Dror, Moshe; Orlin, James B.

In: Discrete Optimization, Vol. 3, No. 4, 01.12.2006, p. 299-316.

Research output: Contribution to journalArticle

Bompadre, Agustín ; Dror, Moshe ; Orlin, James B. / Improved bounds for vehicle routing solutions. In: Discrete Optimization. 2006 ; Vol. 3, No. 4. pp. 299-316.
@article{c932bf2836e747928eaf3926ddebc471,
title = "Improved bounds for vehicle routing solutions",
abstract = "We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then utilized in a design of best-to-date approximation algorithms.",
keywords = "Approximation algorithm, Lower bound, Vehicle routing problem",
author = "Agust{\'i}n Bompadre and Moshe Dror and Orlin, {James B.}",
year = "2006",
month = "12",
day = "1",
doi = "10.1016/j.disopt.2006.04.002",
language = "English (US)",
volume = "3",
pages = "299--316",
journal = "Discrete Optimization",
issn = "1572-5286",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Improved bounds for vehicle routing solutions

AU - Bompadre, Agustín

AU - Dror, Moshe

AU - Orlin, James B.

PY - 2006/12/1

Y1 - 2006/12/1

N2 - We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then utilized in a design of best-to-date approximation algorithms.

AB - We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then utilized in a design of best-to-date approximation algorithms.

KW - Approximation algorithm

KW - Lower bound

KW - Vehicle routing problem

UR - http://www.scopus.com/inward/record.url?scp=33748463814&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748463814&partnerID=8YFLogxK

U2 - 10.1016/j.disopt.2006.04.002

DO - 10.1016/j.disopt.2006.04.002

M3 - Article

AN - SCOPUS:33748463814

VL - 3

SP - 299

EP - 316

JO - Discrete Optimization

JF - Discrete Optimization

SN - 1572-5286

IS - 4

ER -