.png){kind=icon}
返回
Solving the grocery backroom layout problem
.png){kind=icon}
OA
AI
DOI：10.1080/00207543.2019.1708990.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The backroom of retail stores has structural differences when compared with other warehouses and distribution centres, which are more traditionally studied in the literature. This paper presents a mathematical optimisation approach for an unequal area facility layout problem, applied in designing the backroom layout in grocery retail. A set of rectangular facilities (backroom departments) with given area requirements has to be placed, without overlapping, on a limited floor space (backroom area), which can have a regular or an irregular shape. The objective is to find the location and format of the storage departments, such that the walking distances in the store by store employees are minimised. The proposed approach is tested in a European grocery retailer. In the computational experiments, several real store layouts are compared with the ones suggested by the proposed model. The decrease in the walking distances is, on average, 30 percent. In order to understand what the current designers' strategy is, a set of scenarios was created and compared with the real layouts. Each scenario ignores a characteristic of the problem. The goal is to understand what aspect designers are currently discarding. The findings indicate that, currently, designers neglect the different replenishment frequencies of storage departments.
Keyword:
backroom layout problem
grocery retail
strategic planning
mixed integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays具有柔性海湾的不等面积设施布局问题的线性规划嵌入式概率禁忌搜索
PREAI
分享收藏分享收藏
查看更多内容