AbstractThe joint replenishment problem (JRP) is a multi-item inventory problem. The objective is to develop inventory policies that minimize 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 very efficient. Tests are conducted on problems from a leading bank in Hong Kong and from the literature.
Solving the multi-buyer joint replenishment problem with a modified genetic algorithm
Transportation Research Part B: Methodological ; 37 , 3 ; 291-299
2002-02-20
9 pages
Article (Journal)
Electronic Resource
English
Solving the multi-buyer joint replenishment problem with a modified genetic algorithm
Online Contents | 2003
|The Multi-Item Joint Replenishment Problem with Transportation and Container Effects
Online Contents | 1994
|SOLVING FUZZY DYNAMIC SHIP ROUTING AND SCHEDULING PROBLEM THROUGH MODIFIED GENETIC ALGORITHM
BASE | 2022
|