A decomposition approach to the inventory routing problem with satellite facilities

Jonathan F. Bard, Liu Huang, Patrick Jaillet, Moshe Dror

Research output: Contribution to journalArticle

102 Citations (Scopus)

Abstract

This paper presents a comprehensive decomposition scheme for solving the inventory routing problem in which a central supplier must restock a subset of customers on an intermittent basis. In this setting, the customer demand is not known with certainty and routing decisions taken over the short run might conflict with the long-run goal of minimizing annual operating costs. A unique aspect of the short-run subproblem is the presence of satellite facilities where vehicles can be reloaded and customer deliveries continued until the closing time is reached. Three heuristics have been developed to solve the vehicle routing problem with satellite facilities (randomized Clarke-Wright, GRASP, modified sweep). After the daily tours are derived, a parametric analysis is conducted to investigate the tradeoff between distance and annual costs. This leads to the development of the efficient frontier from which the decision maker is free to choose the most attractive alternative. The proposed procedures are tested on data sets generated from field experience with a national liquid propane distributor.

Original languageEnglish (US)
Pages (from-to)189-203
Number of pages15
JournalTransportation Science
Volume32
Issue number2
StatePublished - May 1998

Fingerprint

customer
Satellites
Decomposition
Vehicle routing
Operating costs
Propane
operating costs
supplier
decision maker
heuristics
Liquids
Costs
demand
costs
Inventory routing
experience
Short-run
time
Vehicle routing problem
Distributor

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Transportation

Cite this

A decomposition approach to the inventory routing problem with satellite facilities. / Bard, Jonathan F.; Huang, Liu; Jaillet, Patrick; Dror, Moshe.

In: Transportation Science, Vol. 32, No. 2, 05.1998, p. 189-203.

Research output: Contribution to journalArticle

Bard, Jonathan F. ; Huang, Liu ; Jaillet, Patrick ; Dror, Moshe. / A decomposition approach to the inventory routing problem with satellite facilities. In: Transportation Science. 1998 ; Vol. 32, No. 2. pp. 189-203.
@article{c98896847aa44101837f83161484bbc4,
title = "A decomposition approach to the inventory routing problem with satellite facilities",
abstract = "This paper presents a comprehensive decomposition scheme for solving the inventory routing problem in which a central supplier must restock a subset of customers on an intermittent basis. In this setting, the customer demand is not known with certainty and routing decisions taken over the short run might conflict with the long-run goal of minimizing annual operating costs. A unique aspect of the short-run subproblem is the presence of satellite facilities where vehicles can be reloaded and customer deliveries continued until the closing time is reached. Three heuristics have been developed to solve the vehicle routing problem with satellite facilities (randomized Clarke-Wright, GRASP, modified sweep). After the daily tours are derived, a parametric analysis is conducted to investigate the tradeoff between distance and annual costs. This leads to the development of the efficient frontier from which the decision maker is free to choose the most attractive alternative. The proposed procedures are tested on data sets generated from field experience with a national liquid propane distributor.",
author = "Bard, {Jonathan F.} and Liu Huang and Patrick Jaillet and Moshe Dror",
year = "1998",
month = "5",
language = "English (US)",
volume = "32",
pages = "189--203",
journal = "Transportation Science",
issn = "0041-1655",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "2",

}

TY - JOUR

T1 - A decomposition approach to the inventory routing problem with satellite facilities

AU - Bard, Jonathan F.

AU - Huang, Liu

AU - Jaillet, Patrick

AU - Dror, Moshe

PY - 1998/5

Y1 - 1998/5

N2 - This paper presents a comprehensive decomposition scheme for solving the inventory routing problem in which a central supplier must restock a subset of customers on an intermittent basis. In this setting, the customer demand is not known with certainty and routing decisions taken over the short run might conflict with the long-run goal of minimizing annual operating costs. A unique aspect of the short-run subproblem is the presence of satellite facilities where vehicles can be reloaded and customer deliveries continued until the closing time is reached. Three heuristics have been developed to solve the vehicle routing problem with satellite facilities (randomized Clarke-Wright, GRASP, modified sweep). After the daily tours are derived, a parametric analysis is conducted to investigate the tradeoff between distance and annual costs. This leads to the development of the efficient frontier from which the decision maker is free to choose the most attractive alternative. The proposed procedures are tested on data sets generated from field experience with a national liquid propane distributor.

AB - This paper presents a comprehensive decomposition scheme for solving the inventory routing problem in which a central supplier must restock a subset of customers on an intermittent basis. In this setting, the customer demand is not known with certainty and routing decisions taken over the short run might conflict with the long-run goal of minimizing annual operating costs. A unique aspect of the short-run subproblem is the presence of satellite facilities where vehicles can be reloaded and customer deliveries continued until the closing time is reached. Three heuristics have been developed to solve the vehicle routing problem with satellite facilities (randomized Clarke-Wright, GRASP, modified sweep). After the daily tours are derived, a parametric analysis is conducted to investigate the tradeoff between distance and annual costs. This leads to the development of the efficient frontier from which the decision maker is free to choose the most attractive alternative. The proposed procedures are tested on data sets generated from field experience with a national liquid propane distributor.

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

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

M3 - Article

VL - 32

SP - 189

EP - 203

JO - Transportation Science

JF - Transportation Science

SN - 0041-1655

IS - 2

ER -