A genetic algorithm for joint replenishment based on the exact inventory cost

Authors:
Sung-Pil Hong;Yong-Hyuk Kim
Affiliations:
Department of Industrial Engineering, Seoul National University, Sillim-dong, Gwanak-gu, Seoul 151-742, Korea;Department of Computer Science, Kwangwoon University, Wolgye-dong, Nowon-gu, Seoul 139-701, Korea
Venue:
Computers and Operations Research
Year:
2009

Citing 7
Cited 7

Monte-Carlo approximation algorithms for enumeration problems

Journal of Algorithms
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Introduction to Algorithms

Introduction to Algorithms
Genetic Algorithm and Graph Partitioning

IEEE Transactions on Computers
An evolutionary algorithm to solve the joint replenishment problem using direct grouping

Computers and Industrial Engineering
Monte-Carlo algorithms for enumeration and reliability problems

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Computational complexity of uncapacitated multi-echelon production planning problems

Operations Research Letters

Rationing mechanisms and inventory control-policy parameters for a divergent supply chain operating with lost sales and costs of review

Computers and Operations Research
A real-time warehouse operations planning system for small batch replenishment problems in production environment

Expert Systems with Applications: An International Journal
Meta-heuristic algorithms for solving a fuzzy single-period problem

Mathematical and Computer Modelling: An International Journal
An effective and efficient differential evolution algorithm for the integrated stochastic joint replenishment and delivery model

Knowledge-Based Systems
A differential evolution algorithm for joint replenishment problem using direct grouping and its application

Expert Systems: The Journal of Knowledge Engineering
Model and algorithm of fuzzy joint replenishment problem under credibility measure on fuzzy goal

Knowledge-Based Systems
Modeling and optimization for the joint replenishment and delivery problem with heterogeneous items

Knowledge-Based Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Given the order cycles of items in joint replenishment, no closed-form formula or efficient method is known to compute the exact inventory cost. Previous studies avoid the difficulty by restricting the replenishment policy to the cases where the order cycle of each item is a multiple of the cycle of the most frequently ordered item. This simplifies the computation but may entail sub-optimality of a solution. To cope with this, we devise an unbiased estimator of the exact cost which is computable in time polynomial of the problem input size and 1/@e, where @e is a pre-specified relative error of estimation. We then develop a genetic algorithm based on this new cost evaluation, report the experimental results in comparison to the ''RAND'' [Kaspi M, Rosenblatt MJ. An improvement of Silver's algorithm for the joint replenishment problem. IIE Transactions 1983; 15: 264-9] which has been known as a state-of-the-art method for joint replenishment, and discuss their implications.