A novel differential evolution algorithm for joint replenishment problem under interdependence and its application

In this paper, we propose a new differential evolution (DE) algorithm for joint replenishment of inventory using both direct grouping and indirect grouping which allows for the interdependence of minor ordering costs. Since solutions to the joint replenishment problem (JRP) can be represented by integer decision variables, this makes the JRP a good candidate for the DE algorithm. The results of testing randomly generated problems in contrastive numerical examples and two extended experiments show that the DE algorithm provides close to optimal results for some problems than the evolutionary algorithm (EA), which has been proved to be an efficient algorithm. Moreover, the DE algorithm is faster than the EA for most problems. We also conducted a case study and application results suggest that the proposed model is successful in decreasing total costs of maintenance materials inventories significantly in two power companies.