Near-optimal heuristics to set base stock levels in a two-echelon distribution network

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)
3 Downloads (Pure)

Abstract

We consider a continous review two-echelon distribution network with one central warehouse and multiple local stock points, each facing independent Poisson demand for one item. Demands are fulfilled from stock if possible and backordered otherwise. We assume base stock control with one-for-one replenishments and the goal is to minimize the inventory holding and backordering costs. Although this problem is widely studied, only enumerative precedures are known for the exact optimization. A number of heuristics exist, but they find solutions that are far from optimal in some cases (over 20% error on relistic problem instances). We propose a heuristic that is computationally efficient and finds solutions that are close to optimal: 0,2% error on average and less than 5.0% error at maximum on realistic problem instances in our computational experiment.
Original languageEnglish
Pages (from-to)546-552
Number of pages7
JournalInternational Journal of Production Economics
Volume143
Issue number2
DOIs
Publication statusPublished - 2013

Fingerprint

Electric power distribution
Inventory control
Warehouses
Base stock
Heuristics
Distribution network
Costs
Experiments

Cite this

@article{a52ed901d8514a4888fff4a0d739a0ca,
title = "Near-optimal heuristics to set base stock levels in a two-echelon distribution network",
abstract = "We consider a continous review two-echelon distribution network with one central warehouse and multiple local stock points, each facing independent Poisson demand for one item. Demands are fulfilled from stock if possible and backordered otherwise. We assume base stock control with one-for-one replenishments and the goal is to minimize the inventory holding and backordering costs. Although this problem is widely studied, only enumerative precedures are known for the exact optimization. A number of heuristics exist, but they find solutions that are far from optimal in some cases (over 20{\%} error on relistic problem instances). We propose a heuristic that is computationally efficient and finds solutions that are close to optimal: 0,2{\%} error on average and less than 5.0{\%} error at maximum on realistic problem instances in our computational experiment.",
author = "R.J.I. Basten and {Houtum, van}, G.J.J.A.N.",
year = "2013",
doi = "10.1016/j.ijpe.2011.10.018",
language = "English",
volume = "143",
pages = "546--552",
journal = "International Journal of Production Economics",
issn = "0925-5273",
publisher = "Elsevier",
number = "2",

}

Near-optimal heuristics to set base stock levels in a two-echelon distribution network. / Basten, R.J.I.; Houtum, van, G.J.J.A.N.

In: International Journal of Production Economics, Vol. 143, No. 2, 2013, p. 546-552.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Near-optimal heuristics to set base stock levels in a two-echelon distribution network

AU - Basten, R.J.I.

AU - Houtum, van, G.J.J.A.N.

PY - 2013

Y1 - 2013

N2 - We consider a continous review two-echelon distribution network with one central warehouse and multiple local stock points, each facing independent Poisson demand for one item. Demands are fulfilled from stock if possible and backordered otherwise. We assume base stock control with one-for-one replenishments and the goal is to minimize the inventory holding and backordering costs. Although this problem is widely studied, only enumerative precedures are known for the exact optimization. A number of heuristics exist, but they find solutions that are far from optimal in some cases (over 20% error on relistic problem instances). We propose a heuristic that is computationally efficient and finds solutions that are close to optimal: 0,2% error on average and less than 5.0% error at maximum on realistic problem instances in our computational experiment.

AB - We consider a continous review two-echelon distribution network with one central warehouse and multiple local stock points, each facing independent Poisson demand for one item. Demands are fulfilled from stock if possible and backordered otherwise. We assume base stock control with one-for-one replenishments and the goal is to minimize the inventory holding and backordering costs. Although this problem is widely studied, only enumerative precedures are known for the exact optimization. A number of heuristics exist, but they find solutions that are far from optimal in some cases (over 20% error on relistic problem instances). We propose a heuristic that is computationally efficient and finds solutions that are close to optimal: 0,2% error on average and less than 5.0% error at maximum on realistic problem instances in our computational experiment.

U2 - 10.1016/j.ijpe.2011.10.018

DO - 10.1016/j.ijpe.2011.10.018

M3 - Article

VL - 143

SP - 546

EP - 552

JO - International Journal of Production Economics

JF - International Journal of Production Economics

SN - 0925-5273

IS - 2

ER -