Solving the joint replenishment problem with warehouse-space restrictions using a genetic algorithm

Ming-Jong Yao*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

This study is an extension of the Joint Replenishment Problem (JRP) that takes into accounts warehouse-space restrictions. The focus of this study is to determine the lot size of each product under power-of-two policy to minimize the total cost per unit time and to generate a feasible replenishment schedule of multiple products without exceeding the available warehouse-space. In order to solve this problem, we propose a hybrid genetic algorithm (HGA). We utilize the ability of multi-dimensional search of GA to obtain candidates in the solution space, and test the feasibility of any candidate using the proposed heuristics. By our numerical experiments, we demonstrate that the proposed HGA could effectively solve the JRP with warehouse-space restrictions. Therefore, it could serve as an effective decision-support tool for the logistic managers.

Original languageEnglish
Pages (from-to)128-141
Number of pages14
JournalJournal of the Chinese Institute of Industrial Engineers
Volume24
Issue number2
DOIs
StatePublished - 1 Jan 2007

Keywords

  • Genetic algorithm
  • Inventory
  • Joint replenishment problem
  • Scheduling
  • Warehouse space

Fingerprint Dive into the research topics of 'Solving the joint replenishment problem with warehouse-space restrictions using a genetic algorithm'. Together they form a unique fingerprint.

Cite this