G-99-48
Solving the Multi-Buyer Joint Replenishment Problem with a Modified Genetic Algorithm
, , and BibTeX reference
The Joint Replenishment Problem (JRP) is a multi-item inventory problem. The objective is to develop inventory policies that minimizes the total costs (comprised of holding cost and setup cost) over the planning horizon. In this paper, we look at the multi-buyer, multi-item version of the JRP. We propose a new modified genetic algorithm which is partially parallelizable and very efficient. Tests are conducted on problems from a leading bank in Hong Kong and from the literature.
Published November 1999 , 14 pages
Publication
Jan 2003
Solving the multi-buyer joint replenishment problem with a modified genetic algorithm
, , and
Transportation Research Part B: Methodological, 37(3), 291–299, 2003
BibTeX reference