Managing Limited Retail Space for Basic Products

To evaluate the performance of the heuristics used to compute the solutions under the space sharing and the space dedication strategies, we consider a broad range of parameters and generated 500 random problems instances, each comprising between 5 to 15 candidate product. We then computed the solutions provided by the appropriate algorithms and compared these solutions with the appropriate upper bound solution for each strategy. We define three different criteria for the comparison of performance between space sharing and space dedication strategies. We set the value of the last column to 1 if space sharing is better than dedication, -1 if space dedication is better than sharing, and 0 if the performance is similar. We present the results in three sheets which correspond to the three criteria of comparison.为评估空间共享（space sharing）与空间专属（space dedication）策略下用于求解的启发式算法（heuristics）的性能，我们选取了宽泛的参数范围，生成了500组随机问题实例（random problems instances），每组实例包含5至15个候选产品（candidate product）。随后我们通过适配的算法求解得到各策略对应的解，并将所得解与各策略对应的上界解（upper bound solution）进行对比。我们定义了三项不同的评判准则，用于对比空间共享与空间专属策略的性能表现。我们将每个实例的最后一列数值设置为：若空间共享策略更优，则取值为1；若空间专属策略更优，则取值为-1；若二者性能相近，则取值为0。我们将实验结果按照三项评判准则分别整理至三个工作表中。