本研究為合併補貨問題的延伸，其增加倉儲空間限制的考量。這個問題主要關切的是在所謂的二冪策略(power-of-two policy)下，決定各種產品的補貨批量，在可以產生一個（不超越倉儲空間限制的）可行補貨排程的前提下，使得平均總成本達到最小。為了有效求解本問題，本研究提出一個複合式的遺傳演算法(hybrid genetic algorithm)。我們運用遺傳演算法多維度搜尋的能力找尋候選解答，並運用一個啓發式演算程序測試候選解答是否可以產生可行的補貨排程。經由我們的數據實驗顯示，本研究所提出的複合式的遺傳演算法，可以迅速地求解考量倉儲空間限制之合併補貨問題，故其可以作為運籌經理人員有效的決策輔助工具。

This study is an extension of the Joint Replenishment Problem (JRP) that takes into accounts warehouse-space restrictions. The focus of this study is to determine the lot size of each product under power-of-two policy to minimize the total cost per unit time and to generate a feasible replenishment schedule of multiple products without exceeding the available warehouse-space. In order to solve this problem, we propose a hybrid genetic algorithm (HGA). We utilize the ability of multi-dimensional search of GA to obtain candidates in the solution space, and test the feasibility of any candidate using the proposed heuristics. By our numerical experiments, we demonstrate that the proposed HGA could effectively solve the JRP with warehouse-space restrictions. Therefore, it could serve as an effective decision-support tool for the logistic managers.