论文信息 - A Comparison between Scatter Search and the RAND Method for Solving the Joint Replenishment Problem

A Comparison between Scatter Search and the RAND Method for Solving the Joint Replenishment Problem

The purpose of the present paper is to compare the performance of scatter search (SS) against one of the best heuristics, known as the RAND algorithm (Kaspi and Rosenblatt [7]), in order to solve a popular and useful multi-product inventory problem referred to in the literature as the joint replenishment problem (JRP). The JRP is a classical problem of great utility for many real problems. This paper applies the SS method to a set of randomly generated examples, and shows that the solutions obtained, when compared to RAND, are, when not better, at least identical in the majority of cases for up to 50 items. An important observation is that the average number of iterations employed by SS to find the best solutions on the set of examples, had a linear behavior with respect to the number of items.

Miguel Gutierrez A. | S. de-los-Cobos | J. Goddard

[1] Fred W. Glover,et al. Principles of scatter search , 2006, Eur. J. Oper. Res..

[2] E. Silver. A Simple Method of Determining Order Quantities in Joint Replenishments Under Deterministic Demand , 1976 .

[3] Meir J. Rosenblatt,et al. An Improvement of Silver's Algorithm for the Joint Replenishment Problem , 1983 .

[4] Z. Michalewicz,et al. A comparison between genetic algorithms and the RAND method for solving the joint replenishment problem , 2000 .

[5] F. Glover. Scatter search and path relinking , 1999 .

[6] Fred W. Glover,et al. A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[7] F. Glover,et al. Scatter Search and Path Relinking: Foundations and Advanced Designs , 2004 .

[8] Meir J. Rosenblatt,et al. On the economic ordering quantity for jointly replenished items , 1991 .

[9] S. Goyal. Determination of Optimum Packaging Frequency of Items Jointly Replenished , 1974 .