• Title/Summary/Keyword: Logistics and Supply Chain Management(L/SCM)

Search Result 1, Processing Time 0.017 seconds

Applying Genetic Algorithm for Can-Order Policies in the Joint Replenishment Problem

  • Nagasawa, Keisuke;Irohara, Takashi;Matoba, Yosuke;Liu, Shuling
    • Industrial Engineering and Management Systems
    • /
    • v.14 no.1
    • /
    • pp.1-10
    • /
    • 2015
  • In this paper, we consider multi-item inventory management. When managing a multi-item inventory, we coordinate replenishment orders of items supplied by the same supplier. The associated problem is called the joint replenishment problem (JRP). One often-used approach to the JRP is to apply a can-order policy. Under a can-order policy, some items are re-ordered when their inventory level drops to or below their re-order level, and any other item with an inventory level at or below its can-order level can be included in this order. In the present paper, we propose a method for finding the optimal parameter of a can-order policy, the can-order level, for each item in a lost-sales model. The main objectives in our model are minimizing the number of ordering, inventory, and shortage (i.e., lost-sales) respectively, compared with the conventional JRP, in which the objective is to minimize total cost. In order to solve this multi-objective optimization problem, we apply a genetic algorithm. In a numerical experiment using actual shipment data, we simulate the proposed model and compare the results with those of other methods.