Department of Industrial Engineering, Iran University of Science & Technology, Tehran, Iran.
PLoS One. 2022 Mar 8;17(3):e0264186. doi: 10.1371/journal.pone.0264186. eCollection 2022.
Product category management (PCM) plays a pivotal role in today's large stores. PCM manages to answer questions such as assortment planning (AP) and shelf space allocation (SSA). AP problem seeks to determine a list of products and suppliers, while SSA problem tries to design the layout of the selected products in the available shelf space. These problems aim to maximize the retailer sales under different constraints, such as limited purchasing budget, limited space of classes for displaying the products, and having at least a certain number of suppliers. This paper makes an attempt to develop an integrated mathematical model to optimize integrated AP, SSA, and inventory control problem for the perishable products. The objective of the model is to maximize the sales and retail profit, considering the costs of supplier contracting/selecting and ordering, assortment planning, holding, and procurement cost. GAMS BARON solver is hired to solve the proposed model in small and medium scales. However, because the problem is NP-hard, an evolutionary genetic algorithm (GA), and an efficient local search vibration damping optimization (VDO) algorithm are proposed. A real case study is considered to evaluate the effectiveness and capabilities of the model. Besides, some test problems of different sizes are generated and solved by the proposed metaheuristic solvers to confirm the efficient performance of proposed algorithms in solving large-scale instances.
产品类别管理(PCM)在当今的大型商店中起着至关重要的作用。PCM 能够回答诸如分类规划(AP)和货架空间分配(SSA)等问题。AP 问题旨在确定产品和供应商的列表,而 SSA 问题则试图设计所选产品在可用货架空间中的布局。这些问题旨在在不同的约束下最大化零售商的销售额,例如有限的采购预算、展示产品的类别空间有限,以及至少有一定数量的供应商。本文试图开发一个综合的数学模型,以优化易腐产品的综合 AP、SSA 和库存控制问题。该模型的目标是最大化销售额和零售利润,同时考虑供应商签约/选择和订购、分类规划、持有和采购成本的成本。GAMS BARON 求解器被聘请用于解决小规模和中等规模的建议模型。然而,由于该问题是 NP 难问题,因此提出了一种进化遗传算法(GA)和一种高效的局部搜索减振优化(VDO)算法。考虑了一个实际案例研究来评估模型的有效性和能力。此外,还生成了不同大小的一些测试问题,并由提出的元启发式求解器进行求解,以确认所提出的算法在解决大规模实例方面的高效性能。