The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

In a vendor-managed inventory setting, a supplier determines the timing and size of replenishments for its customers. In the Dynamic-Demand Joint Replenishment Problem (DJRP), one assumes that the supplier pays a fixed fee for replenishing a customer which often occurs if the supplier outsources transportation. Hence, there is no incentive for the supplier to schedule replenishments for nearby customers in the same period. This results in higher transportation costs for the carrier, decreased vehicle utilization and increased future fees for the supplier. To lower costs for both parties, this paper extends the traditional DJRP to the DJRP with Approximated Transportation Costs (DJRP-AT) by taking transportation considerations into account. Since routing problems are difficult to solve and it is not necessary to know the sequence of the deliveries to the customers as these are outsourced, the transportation costs for a given set of customers are approximated using classical schemes. A solution approach for the DJRP-AT based on Branch-and-Cut-and-Price is validated using test instances from the literature. Results show improvements of 4% on average and up to 14.4% for individual instances compared with the DJRP. Moreover, when the DJRP-AT is compared with the DJRP on instances derived from a real-life case, similar savings are obtained. Comparing the DJRP-AT to an equivalent problem with actual routing costs, the solution values of the DJRP-AT are on average only 0.77% higher showing the value of the approximation.

Original languageEnglish
Pages (from-to)1013-1033
Number of pages21
JournalEuropean Journal of Operational Research
Volume276
Issue number3
DOIs
Publication statusPublished - 1 Aug 2019

Fingerprint

Costs
Customers
Demand
Joint replenishment
Transportation costs
Dynamic demand
Branch-and-cut
Routing Problem
Incentives
Timing
Schedule
Suppliers
Routing
Necessary
Approximation
Replenishment

Keywords

  • Branch-and-Cut-and-Price
  • Joint replenishment
  • Logistics
  • Transportation costs

Cite this

@article{a648bb27445249ababba0ba83db36fda,
title = "The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs",
abstract = "In a vendor-managed inventory setting, a supplier determines the timing and size of replenishments for its customers. In the Dynamic-Demand Joint Replenishment Problem (DJRP), one assumes that the supplier pays a fixed fee for replenishing a customer which often occurs if the supplier outsources transportation. Hence, there is no incentive for the supplier to schedule replenishments for nearby customers in the same period. This results in higher transportation costs for the carrier, decreased vehicle utilization and increased future fees for the supplier. To lower costs for both parties, this paper extends the traditional DJRP to the DJRP with Approximated Transportation Costs (DJRP-AT) by taking transportation considerations into account. Since routing problems are difficult to solve and it is not necessary to know the sequence of the deliveries to the customers as these are outsourced, the transportation costs for a given set of customers are approximated using classical schemes. A solution approach for the DJRP-AT based on Branch-and-Cut-and-Price is validated using test instances from the literature. Results show improvements of 4{\%} on average and up to 14.4{\%} for individual instances compared with the DJRP. Moreover, when the DJRP-AT is compared with the DJRP on instances derived from a real-life case, similar savings are obtained. Comparing the DJRP-AT to an equivalent problem with actual routing costs, the solution values of the DJRP-AT are on average only 0.77{\%} higher showing the value of the approximation.",
keywords = "Branch-and-Cut-and-Price, Joint replenishment, Logistics, Transportation costs",
author = "Baller, {Annelieke C.} and Said Dabia and Dullaert, {Wout E.H.} and Daniele Vigo",
year = "2019",
month = "8",
day = "1",
doi = "10.1016/j.ejor.2019.01.070",
language = "English",
volume = "276",
pages = "1013--1033",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs. / Baller, Annelieke C.; Dabia, Said; Dullaert, Wout E.H.; Vigo, Daniele.

In: European Journal of Operational Research, Vol. 276, No. 3, 01.08.2019, p. 1013-1033.

Research output: Contribution to JournalArticleAcademicpeer-review

TY - JOUR

T1 - The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs

AU - Baller, Annelieke C.

AU - Dabia, Said

AU - Dullaert, Wout E.H.

AU - Vigo, Daniele

PY - 2019/8/1

Y1 - 2019/8/1

N2 - In a vendor-managed inventory setting, a supplier determines the timing and size of replenishments for its customers. In the Dynamic-Demand Joint Replenishment Problem (DJRP), one assumes that the supplier pays a fixed fee for replenishing a customer which often occurs if the supplier outsources transportation. Hence, there is no incentive for the supplier to schedule replenishments for nearby customers in the same period. This results in higher transportation costs for the carrier, decreased vehicle utilization and increased future fees for the supplier. To lower costs for both parties, this paper extends the traditional DJRP to the DJRP with Approximated Transportation Costs (DJRP-AT) by taking transportation considerations into account. Since routing problems are difficult to solve and it is not necessary to know the sequence of the deliveries to the customers as these are outsourced, the transportation costs for a given set of customers are approximated using classical schemes. A solution approach for the DJRP-AT based on Branch-and-Cut-and-Price is validated using test instances from the literature. Results show improvements of 4% on average and up to 14.4% for individual instances compared with the DJRP. Moreover, when the DJRP-AT is compared with the DJRP on instances derived from a real-life case, similar savings are obtained. Comparing the DJRP-AT to an equivalent problem with actual routing costs, the solution values of the DJRP-AT are on average only 0.77% higher showing the value of the approximation.

AB - In a vendor-managed inventory setting, a supplier determines the timing and size of replenishments for its customers. In the Dynamic-Demand Joint Replenishment Problem (DJRP), one assumes that the supplier pays a fixed fee for replenishing a customer which often occurs if the supplier outsources transportation. Hence, there is no incentive for the supplier to schedule replenishments for nearby customers in the same period. This results in higher transportation costs for the carrier, decreased vehicle utilization and increased future fees for the supplier. To lower costs for both parties, this paper extends the traditional DJRP to the DJRP with Approximated Transportation Costs (DJRP-AT) by taking transportation considerations into account. Since routing problems are difficult to solve and it is not necessary to know the sequence of the deliveries to the customers as these are outsourced, the transportation costs for a given set of customers are approximated using classical schemes. A solution approach for the DJRP-AT based on Branch-and-Cut-and-Price is validated using test instances from the literature. Results show improvements of 4% on average and up to 14.4% for individual instances compared with the DJRP. Moreover, when the DJRP-AT is compared with the DJRP on instances derived from a real-life case, similar savings are obtained. Comparing the DJRP-AT to an equivalent problem with actual routing costs, the solution values of the DJRP-AT are on average only 0.77% higher showing the value of the approximation.

KW - Branch-and-Cut-and-Price

KW - Joint replenishment

KW - Logistics

KW - Transportation costs

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

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

U2 - 10.1016/j.ejor.2019.01.070

DO - 10.1016/j.ejor.2019.01.070

M3 - Article

VL - 276

SP - 1013

EP - 1033

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -