Advanced Search
Article Contents
Article Contents

A mixed simulated annealing-genetic algorithm approach to the multi-buyer multi-item joint replenishment problem: advantages of meta-heuristics

Abstract Related Papers Cited by
  • The Joint Replenishment Problem (JRP) is a multi-item inventory problem. The objective is to develop inventory policies that minimize total cost (comprised of holding and setup costs) over the planning horizon. In this paper we consider the extension of this problem to the multi-buyer, multi-item version of the JRP. We propose and test a mixed simulated annealing-genetic algorithm (SAGA) for the extended problem. Tests are conducted on problems from a leading bank in Hong Kong. Results are also compared to a pure GA approach and several interesting observations are made on the value of such meta-heuristics.
    Mathematics Subject Classification: Primary: 90B05, 90C11, 90C59.


    \begin{equation} \\ \end{equation}
  • 加载中

Article Metrics

HTML views() PDF downloads(78) Cited by(0)

Access History

Other Articles By Authors



    DownLoad:  Full-Size Img  PowerPoint