Abstract

The Joint Replenishment Problem (JRP) determines lot sizes and schedules replenishment times for products so as to minimize the total costs per unit time. In literature, many solution approaches have been proposed to solve the JRP. In this study, we address our efforts to critically evaluate the search algorithms for the JRP. To do so, we first review the of the JRP, investigate the questionable issues in those algorithms, and scrutinize the reason why they are not able to efficiently solve the optimal solution. Also, we employ an example to verify our critical evaluation to show the questionable issues. To compare the computational performance, we test these search algorithms by random experiments. Based on our experimental results, we conclude that Yao and Lee’s(2001) algorithm out-performs van Eijs’(1993) algorithm, Viswanathan's (1996) heuristic and Wildeman et al.'s(1997) Lipschitz-based algorithm.

주제어

#Joint replenishment problem   #search algorithms   #critical evaluation   #comparison  

참고문헌 (0)

1. 이 논문의 참고문헌 없음

이 논문을 인용한 문헌 (0)

1. 이 논문을 인용한 문헌 없음