Vehicle routing with split deliveries

Moshe Dror, Gilbert Laporte, Pierre Trudeau

Research output: Contribution to journalArticle

134 Citations (Scopus)

Abstract

This paper considers a relaxation of the classical vehicle routing problem (VRP), in which split deliveries are allowed. As the classical VRP, this problem is NP-hard, but nonetheless it seems more difficult to solve exactly. It is first formulated as an integer linear program. Several new classes of valid constraints are derived, and a hierarchy between these is established. A constraint relaxation branch and bound algorithm for the problem is then described. Computational results indicate that by using an appropriate combination of constraints, the gap between the lower and upper bounds at the root of the search tree can be reduced considerably. These results also confirm the quality of a previously published heuristic for this problem.

Original languageEnglish (US)
Pages (from-to)239-254
Number of pages16
JournalDiscrete Applied Mathematics
Volume50
Issue number3
DOIs
StatePublished - May 20 1994

Fingerprint

Vehicle Routing
Vehicle routing
Vehicle Routing Problem
Computational complexity
Search Trees
Integer Program
Branch and Bound Algorithm
Linear Program
Computational Results
Upper and Lower Bounds
NP-complete problem
Roots
Heuristics
Valid

Keywords

  • Connectivity constraints
  • Fractional cycle elimination constraints
  • k-split cycles
  • Split delivery vehicle routing problem
  • Subtour elimination constraints

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Vehicle routing with split deliveries. / Dror, Moshe; Laporte, Gilbert; Trudeau, Pierre.

In: Discrete Applied Mathematics, Vol. 50, No. 3, 20.05.1994, p. 239-254.

Research output: Contribution to journalArticle

Dror, Moshe ; Laporte, Gilbert ; Trudeau, Pierre. / Vehicle routing with split deliveries. In: Discrete Applied Mathematics. 1994 ; Vol. 50, No. 3. pp. 239-254.
@article{8d25c852d93f4ae8a9f9497221899806,
title = "Vehicle routing with split deliveries",
abstract = "This paper considers a relaxation of the classical vehicle routing problem (VRP), in which split deliveries are allowed. As the classical VRP, this problem is NP-hard, but nonetheless it seems more difficult to solve exactly. It is first formulated as an integer linear program. Several new classes of valid constraints are derived, and a hierarchy between these is established. A constraint relaxation branch and bound algorithm for the problem is then described. Computational results indicate that by using an appropriate combination of constraints, the gap between the lower and upper bounds at the root of the search tree can be reduced considerably. These results also confirm the quality of a previously published heuristic for this problem.",
keywords = "Connectivity constraints, Fractional cycle elimination constraints, k-split cycles, Split delivery vehicle routing problem, Subtour elimination constraints",
author = "Moshe Dror and Gilbert Laporte and Pierre Trudeau",
year = "1994",
month = "5",
day = "20",
doi = "10.1016/0166-218X(92)00172-I",
language = "English (US)",
volume = "50",
pages = "239--254",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Vehicle routing with split deliveries

AU - Dror, Moshe

AU - Laporte, Gilbert

AU - Trudeau, Pierre

PY - 1994/5/20

Y1 - 1994/5/20

N2 - This paper considers a relaxation of the classical vehicle routing problem (VRP), in which split deliveries are allowed. As the classical VRP, this problem is NP-hard, but nonetheless it seems more difficult to solve exactly. It is first formulated as an integer linear program. Several new classes of valid constraints are derived, and a hierarchy between these is established. A constraint relaxation branch and bound algorithm for the problem is then described. Computational results indicate that by using an appropriate combination of constraints, the gap between the lower and upper bounds at the root of the search tree can be reduced considerably. These results also confirm the quality of a previously published heuristic for this problem.

AB - This paper considers a relaxation of the classical vehicle routing problem (VRP), in which split deliveries are allowed. As the classical VRP, this problem is NP-hard, but nonetheless it seems more difficult to solve exactly. It is first formulated as an integer linear program. Several new classes of valid constraints are derived, and a hierarchy between these is established. A constraint relaxation branch and bound algorithm for the problem is then described. Computational results indicate that by using an appropriate combination of constraints, the gap between the lower and upper bounds at the root of the search tree can be reduced considerably. These results also confirm the quality of a previously published heuristic for this problem.

KW - Connectivity constraints

KW - Fractional cycle elimination constraints

KW - k-split cycles

KW - Split delivery vehicle routing problem

KW - Subtour elimination constraints

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

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

U2 - 10.1016/0166-218X(92)00172-I

DO - 10.1016/0166-218X(92)00172-I

M3 - Article

AN - SCOPUS:0000855841

VL - 50

SP - 239

EP - 254

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 3

ER -