The joint replenishment and freight consolidation of a warehouse in a supply chain

I. K. Moon; B. C. Cha; C. U. Lee

doi:10.1016/j.ijpe.2009.10.030

The joint replenishment and freight consolidation of a warehouse in a supply chain

I. K. Moon, B. C. Cha, C. U. Lee

School of Industrial Management Engineering

Research output: Contribution to journal › Article › peer-review

41 Citations (Scopus)

Abstract

We have developed joint replenishment and consolidated freight delivery policies for a third party warehouse that handles multiple items, which have deterministic demand rates in a supply chain. Two policies are proposed and mathematical models are developed to obtain the optimal parameters for the proposed policies. Four efficient algorithms are presented to solve the mathematical models for the two policies. The performances of the two policies with the parameters obtained from the proposed algorithms are then compared with the common cycle approach for 1600 randomly generated problems. The results show the robust performance of the proposed algorithm for both policies.

Original language	English
Pages (from-to)	344-350
Number of pages	7
Journal	International Journal of Production Economics
Volume	133
Issue number	1
DOIs	https://doi.org/10.1016/j.ijpe.2009.10.030
Publication status	Published - 2011 Sep

Keywords

Freight consolidation
Heuristic algorithm
Joint replenishment problem

ASJC Scopus subject areas

Business, Management and Accounting(all)
Economics and Econometrics
Management Science and Operations Research
Industrial and Manufacturing Engineering

Access to Document

10.1016/j.ijpe.2009.10.030

Fingerprint Dive into the research topics of 'The joint replenishment and freight consolidation of a warehouse in a supply chain'. Together they form a unique fingerprint.

Cite this

@article{55b6e2b9ed3f4637ab6189e6cc9ecc1e,

title = "The joint replenishment and freight consolidation of a warehouse in a supply chain",

abstract = "We have developed joint replenishment and consolidated freight delivery policies for a third party warehouse that handles multiple items, which have deterministic demand rates in a supply chain. Two policies are proposed and mathematical models are developed to obtain the optimal parameters for the proposed policies. Four efficient algorithms are presented to solve the mathematical models for the two policies. The performances of the two policies with the parameters obtained from the proposed algorithms are then compared with the common cycle approach for 1600 randomly generated problems. The results show the robust performance of the proposed algorithm for both policies.",

keywords = "Freight consolidation, Heuristic algorithm, Joint replenishment problem",

author = "Moon, {I. K.} and Cha, {B. C.} and Lee, {C. U.}",

year = "2011",

month = sep,

doi = "10.1016/j.ijpe.2009.10.030",

language = "English",

volume = "133",

pages = "344--350",

journal = "International Journal of Production Economics",

issn = "0925-5273",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - The joint replenishment and freight consolidation of a warehouse in a supply chain

AU - Moon, I. K.

AU - Cha, B. C.

AU - Lee, C. U.

PY - 2011/9

Y1 - 2011/9

N2 - We have developed joint replenishment and consolidated freight delivery policies for a third party warehouse that handles multiple items, which have deterministic demand rates in a supply chain. Two policies are proposed and mathematical models are developed to obtain the optimal parameters for the proposed policies. Four efficient algorithms are presented to solve the mathematical models for the two policies. The performances of the two policies with the parameters obtained from the proposed algorithms are then compared with the common cycle approach for 1600 randomly generated problems. The results show the robust performance of the proposed algorithm for both policies.

AB - We have developed joint replenishment and consolidated freight delivery policies for a third party warehouse that handles multiple items, which have deterministic demand rates in a supply chain. Two policies are proposed and mathematical models are developed to obtain the optimal parameters for the proposed policies. Four efficient algorithms are presented to solve the mathematical models for the two policies. The performances of the two policies with the parameters obtained from the proposed algorithms are then compared with the common cycle approach for 1600 randomly generated problems. The results show the robust performance of the proposed algorithm for both policies.

KW - Freight consolidation

KW - Heuristic algorithm

KW - Joint replenishment problem

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

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

U2 - 10.1016/j.ijpe.2009.10.030

DO - 10.1016/j.ijpe.2009.10.030

M3 - Article

AN - SCOPUS:79958242738

VL - 133

SP - 344

EP - 350

JO - International Journal of Production Economics

JF - International Journal of Production Economics

SN - 0925-5273

IS - 1

ER -