A two-echelon inventory routing problem for perishable products

S.U.K. Rohmer*, G.D.H. Claassen, Gilbert Laporte

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)
2 Downloads (Pure)

Abstract

This paper presents a two-echelon inventory-routing problem for perishable products. Products are de- livered from a supplier to an intermediary depot, where storage may occur and from which they are delivered by smaller vehicles to the customer locations. Holding costs are incurred for storage at the de- pot. Customer availability is taken into account in the form of customer delivery patterns. The objective is to minimise the total transportation and holding costs. We formulate the problem as a mixed integer linear program and solve it by means of an adaptive large neighbourhood search metaheuristic in com- bination with the solution of a reduced formulation. Three variants of the heuristic are compared on a variety of randomly generated instances. Given the two-stage structure of the problem, computational results show the importance of taking the cost structure into account when choosing the most suitable solution approach.
Original languageEnglish
Pages (from-to)156-172
JournalComputers and Operations Research
Volume107
DOIs
Publication statusPublished - Jul 2019

Fingerprint

Routing Problem
Customers
Costs
Stage Structure
Neighborhood Search
Integer Program
Linear Program
Metaheuristics
Computational Results
Availability
Heuristics
Minimise
Formulation
Inventory routing
Perishable products

Keywords

  • Perishable products
  • Inventory-routing
  • Adaptive large neighbourhood search
  • Last-mile logistics
  • Two-echelon system

Cite this

@article{7dbf9edc1edb40c982f25bede902cced,
title = "A two-echelon inventory routing problem for perishable products",
abstract = "This paper presents a two-echelon inventory-routing problem for perishable products. Products are de- livered from a supplier to an intermediary depot, where storage may occur and from which they are delivered by smaller vehicles to the customer locations. Holding costs are incurred for storage at the de- pot. Customer availability is taken into account in the form of customer delivery patterns. The objective is to minimise the total transportation and holding costs. We formulate the problem as a mixed integer linear program and solve it by means of an adaptive large neighbourhood search metaheuristic in com- bination with the solution of a reduced formulation. Three variants of the heuristic are compared on a variety of randomly generated instances. Given the two-stage structure of the problem, computational results show the importance of taking the cost structure into account when choosing the most suitable solution approach.",
keywords = "Perishable products, Inventory-routing, Adaptive large neighbourhood search, Last-mile logistics, Two-echelon system",
author = "S.U.K. Rohmer and G.D.H. Claassen and Gilbert Laporte",
year = "2019",
month = "7",
doi = "10.1016/j.cor.2019.03.015",
language = "English",
volume = "107",
pages = "156--172",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier",

}

A two-echelon inventory routing problem for perishable products. / Rohmer, S.U.K.; Claassen, G.D.H.; Laporte, Gilbert.

In: Computers and Operations Research, Vol. 107, 07.2019, p. 156-172.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - A two-echelon inventory routing problem for perishable products

AU - Rohmer, S.U.K.

AU - Claassen, G.D.H.

AU - Laporte, Gilbert

PY - 2019/7

Y1 - 2019/7

N2 - This paper presents a two-echelon inventory-routing problem for perishable products. Products are de- livered from a supplier to an intermediary depot, where storage may occur and from which they are delivered by smaller vehicles to the customer locations. Holding costs are incurred for storage at the de- pot. Customer availability is taken into account in the form of customer delivery patterns. The objective is to minimise the total transportation and holding costs. We formulate the problem as a mixed integer linear program and solve it by means of an adaptive large neighbourhood search metaheuristic in com- bination with the solution of a reduced formulation. Three variants of the heuristic are compared on a variety of randomly generated instances. Given the two-stage structure of the problem, computational results show the importance of taking the cost structure into account when choosing the most suitable solution approach.

AB - This paper presents a two-echelon inventory-routing problem for perishable products. Products are de- livered from a supplier to an intermediary depot, where storage may occur and from which they are delivered by smaller vehicles to the customer locations. Holding costs are incurred for storage at the de- pot. Customer availability is taken into account in the form of customer delivery patterns. The objective is to minimise the total transportation and holding costs. We formulate the problem as a mixed integer linear program and solve it by means of an adaptive large neighbourhood search metaheuristic in com- bination with the solution of a reduced formulation. Three variants of the heuristic are compared on a variety of randomly generated instances. Given the two-stage structure of the problem, computational results show the importance of taking the cost structure into account when choosing the most suitable solution approach.

KW - Perishable products

KW - Inventory-routing

KW - Adaptive large neighbourhood search

KW - Last-mile logistics

KW - Two-echelon system

U2 - 10.1016/j.cor.2019.03.015

DO - 10.1016/j.cor.2019.03.015

M3 - Article

VL - 107

SP - 156

EP - 172

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

ER -