Open Access
This article is

- freely available
- re-usable

*Appl. Sci.*
**2019**,
*9*(8),
1581;
https://doi.org/10.3390/app9081581

Article

Using Product Network Analysis to Optimize Product-to-Shelf Assignment Problems

^{1}

Key Laboratory of Advanced Manufacturing Technology, Ministry of Education, Guizhou University, Guiyang 550025, China

^{2}

Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan 32003, Taiwan

^{3}

Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 10607, Taiwan

^{*}

Author to whom correspondence should be addressed.

Received: 21 March 2019 / Accepted: 15 April 2019 / Published: 17 April 2019

## Abstract

**:**

A good product-to-shelf assignment strategy not only helps customers easily find desired product items but also increases retailer profit. Recent research has attempted to solve product-to-shelf problems using product association analysis, a powerful data mining tool that can detect significant co-purchase rules underlying a large amount of purchase transaction data. While some studies have developed efficient approaches for this task, they largely overlook important factors related to optimizing product-to-shelf assignment, including product characteristics, physical proximity, and category constraints. This paper proposes a three-stage product-to-shelf assignment method to address this shortcoming. The first stage constructs a product relationship network that represents the purchase association among product items. The second stage derives the centrality value of each product item through network analysis. Based on the centrality of each product, an item is classified as an attraction item, an opportunity item, or a trivial item. The third stage considers purchase association, physical relationship, and category constraint when evaluating the location preference of each product. Based on the location preference values, a product assignment algorithm is then developed to optimize locations for opportunity items. A series of analyses and comparisons on the performance of different network types are conducted. It is found that the two network types provide variant managerial meanings for store managers. In addition, the implementation and experimental results show the proposed method is feasible and helpful.

Keywords:

shelf allocation; frequent pattern mining; product association; network analysis## 1. Introduction

The development of online shopping has created intense competition for traditional retail businesses. These firms have sought to respond by improving their business strategies in terms of ordering, pricing, advertising, shelving, and so on. Effective shelf-space management is a crucial factor in maximizing store profit, minimizing inventories, and building strong relationships with vendors [1]. Space elasticity has been widely used to estimate the relationship between sales and allocated space [2,3,4], and previous studies have used space elasticity to establish a relationship between shelf space and product demand. However, using space elasticity for shelf-space allocation requires estimating a great number of parameters, resulting in high costs and high error rates in the mathematical models [5].

Recently, advances in information technology have made it easier for retailers to collect various types of customer data [6]. Mining this data for insight into customer behavior can help retailers solidify ephemeral relationships with customers into long-term loyalty. As part of this effort, retailers have modified their shelf-space management practices using product association analysis [7,8,9,10], a powerful data mining tool that can detect significant co-purchase rules underlying a large amount of purchase transaction data. Although previous studies have demonstrated that product association analysis can improve the efficiency of shelf space usage and increase cross-selling possibility, three problems remain to be resolved.

First, most previous studies simply assume that all products in the store can be re-organized based on the outcome of product association analysis. However, moving critical products might disrupt existing customer shopping patterns/rules. In reality, some products are critical to attracting customers and moving them could break existing linkages. Therefore, it might be desirable to analyze the relationships among products before deciding which products are to be re-organized. Second, previous studies have seldom considered the physical proximity of shelf locations when evaluating assignment task. For example, product A and product B are candidates to be assigned to Shelf 1. The original shelf for product A (denoted as Shelf 2) is one foot away from Shelf 1, while the original shelf for product B (denoted as Shelf 3) is ten feet away from Shelf 1. Previous studies might randomly pick a product and assign it to Shelf 1. However, Shelf 1 is much closer to Shelf 2 than to Shelf 3, and failure to consider physical proximity results in some products being reassigned to shelves far from their current locations, which not only incurs a reallocation cost but also increases inconvenience for customers trying to find specific products. Third, previous studies simply assume that products can be reassigned to any locations in the store. In reality, products belong to certain categories and should be grouped with other items within the same category to prevent customer confusion.

To solve these problems, this study proposes a three-stage product-to-shelf assignment method that considers customer purchase behaviors as well as physical and category constraints. The first stage constructs a Product Relationship Network (PRN) that represents the purchase association among product items. Two types of PRNs are studied: Transaction-based networks (TBN) and customer-based networks (CBN), which will be described later in Section 3.2. The second stage uses network analysis to derive the centrality value of each product item, which reveals the importance of a product item in the network. Based on its centrality value, an item is classified as an attraction item, an opportunity item, or a trivial item (see Section 3.3.2 for definitions). Opportunity items are those that should be reorganized/re-shelved. The third stage integrates purchase association, geographic relationship, and category constraints to evaluate the location preference of each product. Based on the preference values, a product assignment algorithm is developed to determine the optimal positions/locations for opportunity items.

## 2. Literature Review

Shelf space is an essential resource in logistics decisions and store management, and well-designed space allocation can attract more consumers and derive increased sales. Corstjens and Doyle [2] developed a shelf space allocation model which accounts for product space cost elasticity, inter-product cross-elasticity, product profit margins, and product cost. This model was among the first space allocation models to consider interdependencies. A shelf-space allocation problem formulated by Yang and Chen [3] disregarded cross-elasticities and allowed the profit of each product to vary when allocated to different shelves. Their model was then optimized by Lim et al. [4] by combining a local search technique with meta-heuristics. However, using space elasticity to determine product assortment and shelf-space allocation requires the estimation of a great quantity of parameters, resulting in increased costs and errors in the mathematical model. In addition, some research used price policy to consider product item location [11] and explored the product category allocation problem. However, these studies overlooked customer purchase behavior.

Effective shelf-space management can attract consumer attention and encourage additional purchases. Hwang et al. [12] developed an integrated mathematical model for the shelf space design and item allocation problem and solved it using genetic algorithm. The objective function is composed of the average of an item’s location effect, demand rate, and gross margin. To solve the mathematical problem, they used two types of genetic algorithms: A slicing structure produced by guillotine cuts and horizontal cuts. Cil [10] used buying association measurements to create a category correlation matrix and applied the multidimensional scale technique to display a set of products in store spaces. Tsafarakis et al. [13] introduced differential evolution (DE) to assist retailers in adapting their product portfolios in periods of economic recession and facilitate strategic product assortment planning (PAP) decisions. The performance of five different DE implementations was benchmarked against Simulated Annealing. The interrelated issue of assortment adaptation across different retail store formats was also taken into consideration. Flamand et al. [14] introduced a tactical, store-wide shelf-space management problem where shelves are comprised of smaller, adjacent segments that vary in attractiveness. A product category (e.g., tea or oil) is viewed at an aggregate level. The reward resulting from assigning a product category to a shelf depends on the attractiveness of the shelf segments it is assigned to and its aggregate gross profit. Ghoniem et al. [15] studied the unclustered variant of the problem, where product categories are taken individually, as a generalized assignment problem with location/allocation considerations for which they develop preprocessing schemes, valid inequalities, and a branch-and-price algorithm that significantly outperforms CPLEX for small- and mid-sized instances. Zhao et al. [16] developed integrated optimization models with inventory replenishment, shelf display location, and shelf space allocation. The joint optimization models are proposed according to two different situations: (1) Each item is replenished individually; and (2) multiple items are replenished jointly. The results demonstrate that their proposed SA-based hyper-heuristic algorithm is robust and efficient for both joint optimization models. Frontoni et al. [17] presented a solution to optimally re-allocate shelf space to minimize Out of Stock (OOS) events. The approach uses Shelf Out of Stock (SOOS) data coming in real time from a sensor network technology and an integer linear programming model that integrates a space elastic demand function. Experimental results have proved that the system can efficiently calculate a proper solution able to re-allocate space and reduce OOS events. Flamand et al. [18] developed a model that jointly examines assortment planning and store-wide shelf space allocation decisions. The model is then solved by a heuristic approach that constructs a high-quality initial solution that is further enhanced using a large-scale neighborhood local search procedure.

Recently, network analysis has been applied to transaction data to provide a better understanding of product relationships from various points of view [19,20]. Oestreicher-Singer and Sundararajan [21] investigated co-purchase networks and demand levels associated with over 250,000 interconnected books over a year. Their results showed that the visibility of co-purchase networks amplifies shared purchasing of complementary products. Raeder and Chawla [22] used market-basket analysis to evaluate associations between two products, establishing a product network based on history transaction data, followed by community detection. Kim et al. [23] used product network analysis to extend the market basket analysis with social network analysis. They integrated the centrality concept into product networks and tried to explain the result through social network analysis in actual retail stores. Tsai et al. [24] proposed a novel shopping behavior prediction system which considers both the quantity and utility of purchased products. A set of frequent shopping patterns, called high-utility mobile sequential patterns (UMSPs), is generated using the UMSPL algorithm. However, the product-to-shelf problem is not addressed in this study.

Grida et al. [25] introduced a mathematical model to optimize the retail revenue while considering products’ cross-elasticity on demand. The space allocated to each product is considered as a continuous variable that has a lower boundary of one product face. The resulting model, a NP-hard one, is solved using an adaptive meta-heuristic algorithm based on artificial bee colony (ABC). Bianchi-Aguiar et al. [26] presented a novel mixed integer programming formulation for the shelf space allocation problem considering two innovative features emerging from merchandising rules: Hierarchical product families and display directions. The formulation uses single commodity flow constraints to model product sequencing and explores the product families’ hierarchy to reduce the combinatorial nature of the problem. Reisi et al. [27] provided a closed-form expression for the approximate solution to the lower-level problem determining the retail prices and the allocated shelf spaces. This solution then is incorporated into the manufacturers’ profit resulting in a single-level optimization problem which is easier to solve.

## 3. Research Method

#### 3.1. Research Framework and Assumption

Placing products with a high degree of association close to each other raises the likelihood of cross-selling. This paper seeks to develop a method that allocates products to suitable shelves to maximize such associations and thus drive cross-selling. Figure 1 shows the proposed three-stage framework. The first stage constructs a Product Relationship Network (PRN) that represents the purchasing association among the product items. Two types of PRNs—transaction-based networks (TBN) and customer-based networks (CBNs)—are used, depending on how purchasing data are dealt with. The two PRNs will be further defined in Section 3.2. The second stage uses network analysis to derive the centrality value of each product item, which reveals the importance of the item in its network. Based on the centrality of each product, an item is classified as an attraction item, an opportunity item, or a trivial item. Opportunity items are those to be reorganized/re-shelved. The third stage uses a product assignment algorithm to determine the optimal positions/locations for opportunity items to maximize cross-selling.

The product-to-shelf assignment problem is strongly influenced by a large number of variables that are context specific. Therefore, the following assumptions are made in this study. First, although the type of stores discussed in this study is limited, it is assumed that product volumes are identical and can be smoothly exchanged across the shelves. Second, variables such as the bargaining power of the producers, and setup cost of moving product items are not discussed in this study.

#### 3.2. Product Relationship Networks

Let I = {i

_{1}, i_{2}, …, i_{P}} be the set of product items sold in a store where P is the total number of product items. A purchase database stores a set of purchase records in which a record consists of a purchase timestamp, a transaction identifier (T_ID), a customer identifier (C_ID), and a product item. Depending on how the product relationship is constructed, product items in the purchase database can be aggregated according to unique T_ID or C_ID. If records are aggregated using T_ID, the dataset is called a transaction-based dataset (TBD). If records are aggregated using C_ID, the dataset is called a customer-based dataset (CBD). Figure 2 shows a simple aggregation example. Figure 2a indicates 14 purchase records in a purchase database. After aggregating by T_ID, 6 transaction-based records are generated as shown in Figure 2b. Similarly, as shown in Figure 2c, 4 customer-based records are generated if C_ID is used to aggregate the purchase database.Based on different datasets, two types of Product Relationship Networks (PRNs) are constructed. If the network is constructed using the transaction-based dataset (TBD), the network is called a transaction-based network (TBN). If the network is constructed using the customer-based dataset (CBD), the network is called a customer-based network (CBN). The construction process for both types of PRNs includes the following two phases. The first phase derives all frequent 2-itemsets from an aggregated dataset using the Apriori algorithm under a minimum support count. The second phase builds the product association matrix according to the support values of frequent 2-itemsets.

The Apriori algorithm proposed by Agrawal and Srikant [7] is a popular method for identifying frequent itemsets. Let L

_{k}represent the set of all frequent k-itemsets and C_{k}represents the set of candidate k-itemsets. k-itemsets may or may not be frequent, but all of the frequent k-itemsets are included in C_{k}. The Apriori algorithm scans the dataset and calculates the count of each candidate in C_{k}to determine which k-itemsets are frequent. All candidates with a count exceeding the minimum support count are frequent and belong to L_{k}. Otherwise, the candidates are removed. (k + 1)-itemsets of C_{k}_{+1}, which include frequent k-itemsets, can be repeatedly generated by L_{k}. The algorithm will stop when L_{k}= Ø. Note that this algorithm will stop when k = 2 since only frequent 2-itemsets are required in this study.After obtaining frequent 2-itemsets, the product association matrix of a PRN can be determined. Let M = [m
where SupCount is the function returning the support count of itemset {i

_{i,j}] be the product association matrix of size y × y where y is the number of individual items which have ever appeared in the frequent 2-itemsets, and m_{i,j}is defined as:
$${m}_{i,j}=SupCount(\{{t}_{i},{t}_{j}\})$$

_{i}, i_{j}}. If m_{ij}is high, the association between items i_{i}and i_{j}is strong. Note that if itemset {i_{i}, i_{j}} cannot be found in the frequent 2-itemsets, the support count m_{i,j}will be marked as “x” in the matrix.In TBN, records with the same transaction ID are aggregated so that the association value between two items indicates the co-purchase relationship from the viewpoint of transactions. In CBN, records with the same customer ID are aggregated so that the association between items in CBN indicates the co-purchasing relationship from the viewpoint of customers. That is, CBN treats each customer in the store as equally important, while TBN might favor frequent buyers.

#### 3.3. Network Analysis for Item Classification

After the product association matrix is obtained, a product item is considered to be a node in a network where a link between two nodes indicates their association strength. In the network, the centrality measure is used to determine the importance of each product item in the store. With this importance, each product is classified as an attraction item, an opportunity item, or a trivial item. Opportunity items are those to be reorganized/re-shelved in the third stage.

#### 3.3.1. Network Analysis

Centrality measure is a popular index used to identify the relative importance of nodes in the network; a higher value indicates the node has a stronger effect in the network. This research uses the two most popular centrality measures, closeness and betweenness [28]. Closeness centrality measures how close a node is to all other nodes. A node is considered to be central if it can reach all others quickly. Formally, closeness centrality C
where d(i, j) is the distance of the shortest path from node i to node j in the network, and N is the total number of nodes in the network.

_{c}(i) is the reciprocal of the sum of the shortest distance from node i to each other node, which can be formulated as:
$${C}_{C}(i)=\frac{1}{{\displaystyle \sum {}_{j=1}^{N}d(i,j)}}$$

Betweenness centrality is a measure of centrality in a network based on shortest paths. For every pair of nodes in a network, there exists at least one shortest path between the nodes such that either the number of edges that the path passes through (for unweighted graphs) or the sum of the weights of the edges (for weighted graphs) is minimized. The betweenness centrality for node i, C
where g

_{B}(i), is the number of these shortest paths that pass through node i. Mathematically, it is defined as:
$${C}_{B}(i)={\displaystyle \sum _{i\ne s}^{N}{\displaystyle \sum _{i\ne t}^{N}\frac{{g}_{s,t}(i)}{{g}_{s,t}}}}$$

_{s}_{,t}is the number of shortest paths from node s to node t and g_{s}_{,t}(i) is the number of the shortest paths from node s to node t that pass through node i. In this study, the Dijkstra algorithm [29] is used to find the shortest path between two nodes.#### 3.3.2. Item Classification

As mentioned in Section 1, not all items are suitable for rearrangement since established shopping behaviors might be disrupted if major attractive items are relocated. To determine item suitability for relocation, this study classifies each product item as an attraction item, an opportunity item, or a trivial item based on its centrality measure.

**Definition**

**1.**

An attraction item is an item whose centrality value is higher than an upper bound threshold value α in PRN. Attraction items should not be relocated because doing so would disrupt their connection to other products. In the following discussion, the set of attraction items is denoted as$AI=\left\{{i}_{j}\right|C(j)>\alpha \}$where C(j) is the centrality for item i

_{j}.**Definition**

**2.**

An opportunity item is an item whose centrality value is no greater than α but higher than a lower bound threshold value β in PRN. Opportunity items are commodities affiliated with attraction items and might sell better if moved to a more appropriate section/shelf. Therefore, opportunity items are considered to be commodities which should be re-allocated. The set of opportunity items is denoted as$OI=\left\{{i}_{j}\right|\alpha \ge C(j)>\beta \}$.

**Definition**

**3.**

A trivial item is an item whose centrality value is no greater than β. Trivial items are items which do not show a strong association with other items in PRN. Thus reallocating trivial items might not generate additional sales. The set of trivial items is denoted as$TI=\left\{{i}_{j}\right|\beta \ge C(j)\}$.

#### 3.4. Location Preference Evaluation

As mentioned in Section 3.3.2, opportunity items are those that are re-organized, while attraction items and trivial items are kept in their original locations. To maximize cross-selling, an opportunity item should be moved to a cell close to that of its related attraction items. For example, bottle openers should be placed near bottled beers instead of canned beers. Therefore, the location preference for opportunity items will be evaluated according to purchase association and physical proximity.

Figure 3 illustrates a typical layout consisting of cabinets and aisles in a retail store. A cabinet consists of several cells where a cell is a space used to display a product item. Let (x
where A

_{m}, y_{m}) and (x_{n}, y_{n}) respectively be the center coordinates of cell m and cell n. The physical distance between the two cells is defined as:
$${g}_{m,n}=\{\begin{array}{ll}\left|{x}_{m}-{x}_{n}\right|+\left|{y}_{m}-{y}_{n}\right|& \mathrm{if}\text{\hspace{1em}}{A}_{m}={A}_{n}\\ \left|{x}_{m}-{x}_{n}\right|+\mathrm{min}\left[(2Y-{y}_{m}-{y}_{n}),({y}_{m}+{y}_{n})\right]& \mathrm{if}\text{\hspace{1em}}{A}_{m}\ne {A}_{n}\end{array}$$

_{m}is the aisle number of cell m, A_{n}is the aisle number of cell n, and Y is the length of a cabinet. Based on Equation (4), we can derive a physical distance matrix G = [g_{m}_{,n}] that shows the physical relationship among all cells.It is clear that an opportunity item i
where p

_{i}should be placed in a cell close to the set of attraction items, AI. In addition, if the purchase association between the attraction item i_{j}and the opportunity item i_{i}is stronger, items i_{j}and i_{i}should be placed closer together. Thus, location preference in which opportunity item i_{i}is placed to cell m is defined as:
$${l}_{i,m}={\displaystyle \sum _{j\in AI}{p}_{i,j}\times {g}_{m,Cell(j)}}\text{\hspace{1em}\hspace{1em}}\mathrm{for}\text{}\mathrm{all}\text{}m\in Cell(k)\text{}\mathrm{where}\text{}k\in OI$$

_{i}_{,j}is the support count for itemset {i_{i}, i_{j}} defined in Equation (1), g_{m}_{,Cell(j)}is the physical distance between cells m and Cell(j), and Cell(j) is the function returning the cell to which item i_{j}belongs.Product items belong to specific product categories such as beverages, snacks, or fresh food. For management purposes and shopping convenience, a store layout is divided into many zones, each of which is devoted to a single product category. Therefore, the cells to which opportunity items can be moved should be limited by management constraints. Let a

_{i}_{,m}be the likelihood availability that opportunity item i_{i}is placed in cell m:
$${a}_{i,m}=\{\begin{array}{l}1\text{\hspace{1em}}\mathrm{if}\text{}\mathrm{item}\text{}{i}_{i}\text{}\mathrm{is}\text{}\mathrm{allowed}\text{}\mathrm{to}\text{}\mathrm{be}\text{}\mathrm{placed}\text{}\mathrm{on}\text{}\mathrm{cell}\text{}m\\ 0\text{\hspace{1em}}\mathrm{if}\text{}\mathrm{item}\text{}{i}_{i}\text{}\mathrm{cannot}\text{}\mathrm{be}\text{}\mathrm{placed}\text{}\mathrm{on}\text{}\mathrm{cell}\text{}m\end{array}$$

Finally, the final location preference lp

_{i}_{,m}can be derived as:
$$l{p}_{i,m}={l}_{i,m}\times {a}_{i,m}$$

#### 3.5. Product Assignment

This research assumes that all product items have identical sizes and quantities so that two opportunity items on different shelves can be easily exchanged. The reassignment considers the location preference defined in Equation (7) and reassigns products to the most suitable shelves. Therefore, the objective of product rearrangement is to rearrange opportunity items while minimizing total shelf movement:
subject to:
where opportunity items i and j ∈ OI, E

$$MIN{\displaystyle \sum _{i=1}^{\left|OI\right|}{\displaystyle \sum _{j=1}^{\left|OI\right|}({E}_{i,j}\cdot l{p}_{i,Cell(j)})}}$$

$$\begin{array}{c}{\displaystyle \sum _{j=1}^{\left|OI\right|}{E}_{ij}=1,i=1,2,\dots ,}\left|OI\right|\\ {\displaystyle \sum _{i=1}^{\left|OI\right|}{E}_{ij}=1,j=1,2,\dots ,}\left|OI\right|\\ {E}_{ij}\ge 0\text{\hspace{1em}\hspace{1em}}for\text{\hspace{0.17em}}all\text{\hspace{0.17em}}i\text{\hspace{0.17em}}and\text{\hspace{0.17em}}j\end{array}$$

_{ij}= 1 if opportunity item i is assigned to a shelf which displays opportunity item j, otherwise E_{ij}= 0. The item assignment problem shown in Equation (8) is solved using the Hungarian method [30], a combinatorial optimization algorithm that can solve the assignment problem in polynomial time. Appendix A shows the computational procedure of the Hungarian method.## 4. Implementation and Experimental Results

In this section, a case study is conducted to show the benefits and strengths of the proposed three-stage product-to-shelf assignment method. In Section 4.1, the data and case study environment are introduced. Then, a set of experiments for the case study are illustrated in Section 4.2. Finally, sensitive analysis is described in Section 4.3.

#### 4.1. Environment and Data Description

Figure 4 illustrates the layout of a simplified grocery store to demonstrate the feasibility of the proposed shelf space allocation method. There are 110 product items in the store, with each product item belonging to one of 11 categories such as meat, vegetable, fruit, dried food, etc. Products are assigned to a specific zone according to their category. The initial position (location) assignment for products and center coordinates of cells are respectively shown in Figure 4a,b.

A transaction generator is developed to simulate customer shopping behavior. In this generator, four types of customers are modeled. Each with different purchasing probabilities for the various product categories (Table 1), and are assigned different weightings for transaction frequency (respectively 60%, 20%, 15%, and 5%). In this study, the total number of purchase transactions in the generator is set at 5000. Table 2 summarizes part of the simulated purchase transactions where a transaction contains T_ID (transaction identifier), C_ID (customer identifier), and purchased product items. Next, the purchase dataset will be respectively aggregated as a transaction-based dataset (TBD) and a customer-based dataset (CBD) according to unique T_ID or C_ID. After this process, the number of records in TBD is 5000 while the number of records in CBD is 1000.

#### 4.2. A Case Illustration

Based on the different datasets, two types of Product Relationship Networks (PRN) are constructed. A network based on the transaction-based dataset (TBD) is called a transaction-based network (TBN), while one based on the customer-based dataset (CBD) is called a customer-based network (CBN). For the sake of simplicity, only the CBN experiment is reported in this section, and the performance of TBN and CBN will be compared in Section 4.3. When the minimum support count in the Apriori algorithm is set to 50, the product association matrix for CBN can be generated. Based on the matrix, the connection among all products in CBN is visualized in Figure 5. Note that the product item name is shown in the graph instead of the product item number.

Based on the matrix, the closeness centrality and betweenness centrality for all products in CBN can be evaluated using Equations (2) and (3). Next, each product item is classified as an attraction item, an opportunity item, or a trivial item according to Definitions 1 to 3. When α = 10 and β = 5, there are 29 attraction items, 26 opportunity items, and 55 trivial items for CBN. Table 3 shows the classification result for CBN.

Next, the location preference can be calculated using Equations (4)–(7). Based on the location preference values, the Hungarian method is used to solve the assignment problem. Table 4 shows the reassignment result for CBN using betweenness centrality. Among 26 opportunity items, the locations of 15 items (i

_{22}, i_{26}, i_{27}, i_{30}, i_{61}, i_{63}, i_{68}, i_{69}, i_{70}, i_{75}, i_{78}, i_{82}, i_{83}, i_{88}, i_{89}) will be exchanged and the locations of 11 items (i_{3}, i_{13}, i_{15}, i_{23}, i_{24}, i_{41}, i_{43}, i_{47}, i_{65}, i_{72}, i_{73}) will stay the same. For example, item i_{63}will be moved from its original cell (C_{63}) to the new cell (C_{69}), while item i_{3}will stay in its place. Figure 6 shows the locations of the 15 opportunity items that will be re-shelved.#### 4.3. Sensitive Analysis

This section analyzes how parameters in our method affect the final reassignment result.

#### 4.3.1. Analysis of Minimum Support Count

When constructing a Product Relationship Network (PRN), the minimum support count in the Apriori algorithm is an important threshold since it is used to remove the links between nodes with weak association values. A high threshold value produces a network with few links. However, determining an appropriate minimum support count is a difficult task. To address this issue, the concept of “accumulated percentage of active links” is proposed to help users determine the threshold value. Note that an active link is defined as the link between two products whose association is greater than the minimum support count in the PRN.

Figure 7 shows the relationships among the settings of minimum support counts, the number of active links, and the accumulated percentage of activate links in TBN. There are 5995 possible active links among 110 products when the minimum support count is set at 0. If the minimum support count is set at 15, the accumulated percentage of active links will be 30% (= 1799/5995). That is, store managers expect that at most 30% of items (i.e., around 33 items) might be exchanged. Similarly, when the minimum support count is set at 20, the accumulated percentage of active links will be 12% (= 719/5995), which indicates that at most 12% of items (i.e., around 13 items) might be moved. Based on the information in the figure, managers can determine the appropriate minimum support count with consideration of re-shelving cost. Similarly, Figure 8 shows the relationship among the settings of minimum support count, number of active links, and accumulated percentage of activated links in CBN.

Based on the two figures, it is clear that the number of active links falls as the minimum support count increases. However, if the minimum support count is set the same for TBN and CBN, the number of active links in CBN is larger than that in TBN because most association values in the links in CBN are stronger than those in TBN. In addition, when the minimum support count is low, the centrality value will be affected by a large number of nodes with weak associations, thus reducing the significance of the reassignment result. Conversely, when the minimum support count is high, the centrality value is derived based on a smaller number of nodes with strong association, thus increasing the significance of the reassignment result.

#### 4.3.2. Analysis of Product Relationship Networks

To understand the characteristics of TBN and CBN, we use five popular indexes: Density, isolated product, diameter, average shortest distance, and clustering coefficient [31]. Density is the number of links divided by the number of total potential links. Diameter is the maximum distance between any pair of nodes in the network. Average shortest distance is the average of all-pairs shortest distance. A clustering coefficient is a measure of the degree to which nodes in a network tend to cluster together. Table 5 shows the values of the five indexes when minimum support count is 5, 10, 15, 20, 25, and 30 for TBN. Table 6 shows the values of the five indexes when minimum support count is 30, 40, 50, 60, 70, and 80 for CBN.

According to Table 5 and Table 6, when the minimum support count is high, the density of the two product networks will be low since there are few active links in the product network. The network density of the two networks is similar when the minimum support count is 15 in TBN and 60 in CBN. However, the number of isolated nodes in CBN is much higher than in TBN since CBN aggregates customer transactions. Similarly, the average shortest distance and diameter in CBN is shorter than in TBN.

It is clear that the product associations derived from TBN are based on individual transactions. That is, TBN considers each transaction to be equally important so that repeated purchases will be accumulated/counted when conducting association analysis. This makes TBN suitable for stores with fewer customers with higher loyalty. On the other hand, the product associations derived from CBN are based on individual customers. The analysis result derived from CBN will be less affected by customers who repeatedly purchase the same products. Therefore, CBN is suitable for stores with large numbers of one-time customers.

#### 4.3.3. Analysis of Attraction and Opportunity Items

In this research, a product item is classified as attraction item, opportunity item, or trivial item based on its centrality measure and parameters of α and β. An item whose centrality value is higher than α is called an attraction item. An item whose centrality value is between α and β is called an opportunity item. Otherwise, an item is a trivial item. Figure 9 shows the relationship between the number of attraction items and threshold value α in TBN using betweenness centrality. If α is greater than 50, the number of attraction items will not exceed 12, which might be too few for location preference evaluation. Therefore, α < 50 is suggested in this experiment when betweenness centrality is adopted. Table 7 shows the possible outcomes when changing parameters α and β.

Figure 10 shows the relationship between the number of attraction items and the threshold value α in TBN using closeness centrality. If α exceeds 170, the number of attraction items will not exceed 20, which might be too few for location preference evaluation. Therefore, α < 170 is suggested in this experiment when betweenness centrality is adopted. Table 8 shows the possible outcomes when changing parameters α and β.

Attraction items bring customers into the store. Thus the number of attraction items should be maximized and their locations should remain consistent. By contrast, opportunity items should be moved to maximize cross-selling. Reassignment of a large number of opportunity items will entail considerable labor and expense, but limiting the number of opportunity items to be reassigned may limit the impact on purchasing.

## 5. Discussion and Conclusions

To attract customers and survive in a competitive environment, retailers need to implement appropriate retail-mix strategies including store location, product assortment, pricing, advertising and promotion, store design and shelf display, services, and personal selling. Among these, shelf-space allocation is one of the most important factors in determining customer purchasing decisions. Recently, advances in information technology have made it easier for retailers to collect various types of customer data. Mining this data for insight into customer behavior can help retailers solidify ephemeral relationships with customers into long-term loyalty. As part of this effort, retailers have modified their shelf-space management practices using product association analysis. Previous studies have demonstrated that product association analysis can improve the efficiency of shelf space usage and increase cross-selling.

This study solves the persistent product-to-shelf allocation problem by integrating data mining and network analysis, and makes three major contributions. First, the study compares the effectiveness of transaction-based networks (TBN) and customer-based networks (CBN). Experimental results show that the two network types produce very different association values among products. If store managers want to reduce side effects caused by customers repeatedly purchasing the same products, CBN is a better choice than TBN. Conversely, TBN is more useful if store managers treat all transactions as equally important. Second, this research uses network analysis to evaluate product centrality, and uses the resulting centrality value to classify products as attraction items, opportunity items, or trivial items. Attraction items are popular products which attract customer visits, and should be kept in consistent locations making them easy to find. On the other hand, opportunity items should be relocated to increase cross-selling. Third, this study considers product association along with physical proximity and category constraints when solving the product-to-shelf assignment problem.

Some potential extensions for this research are as follows. First, the proposed method uses closeness and betweenness to measure product centrality in the product relationship network. Different centrality measures give different meanings and future studies should apply a wider range of centrality measures. Second, this study assumes product volumes are identical and can be smoothly exchanged. However, in practice, different products might be displayed in different volumes, and future work should consider this issue. Third, some additional limitations that could be addressed are those concerning restrictions on storage conditions of certain products (e.g. frozen or refrigerated products) or consideration of product relocation costs. Meanwhile, it would be interesting to take the height of positioning within a shelf into consideration. Fourth, this study solves the product-to-shelf assignment using the Hungarian method, which would run too slowly given large quantities of data. Finally, the proposed method is now validated and evaluated using simulated behavior data produced by a transaction sequence generator, and future work should apply authentic store transaction data.

## Author Contributions

Conceptualization, H.H., C.-Y.T. and R.J.K.; Formal analysis, J.-S.C.; Funding acquisition, H.H.; Methodology, C.-Y.T.; Supervision, C.-Y.T.; Writing—original draft, J.-S.C.; Writing—review & editing, L.Y.

## Funding

This research was funded by The National Natural Science Foundation of China under Grant No. 51865004, the Major Project of Science and Technology in Guizhou Province under Grant No. [2017]3004 and No. [2018]3002, and the Science and Technology Project of Guizhou Province under Grant No. Talents [2018]5781.

## Conflicts of Interest

The authors declare no conflict of interest.

## Appendix A

Let c

_{i}_{,j}be the cost of assigning the ith item to the jth location. We define the cost matrix to be the n × n matrix. An assignment is a set of n entry positions in the cost matrix, no two of which lie in the same row or column. The sum of the n entries of an assignment is its cost. An assignment with the smallest possible cost is called an optimal assignment. The following five steps show the major operations in the Hungarian method.**Step1.**- Subtract the entries of each row by the minimum of each row.
**Step2.**- Subtract the entries of each column by the minimum of each column.
**Step3.**- Cover all zeroes in the matrix with as few lines as possible. Lines should be horizontal or vertical only.
**Step4.**- A test for optimality. If the number of line is equal to n, choose a combination from the modified matrix in such a way that the sum is zero. If the number of lines is less than n, go to step 5.
**Step5.**- Find the smallest element that is not covered by any of the lines and subtract it from each entry that is not covered by lines. Then, add the entry found at the beginning of step 5 to each entry covered by a vertical and a horizontal line. Next, go back to Step 3.

## References

- Fancher, L. Computerized space management: A strategic weapon. Disc. Merch.
**1991**, 31, 64–65. [Google Scholar] - Corstjens, M.; Doyle, P. A model for optimizing retail space allocations. Manag. Sci.
**1981**, 27, 822–833. [Google Scholar] [CrossRef] - Yang, M.-H.; Chen, W.-C. A study on shelf space allocation and management. Int. J. Prod. Econ.
**1999**, 60, 309–317. [Google Scholar] [CrossRef] - Lim, A.; Rodrigues, B.; Zhang, X. Metaheuristics with local search techniques for retail shelf-space optimization. Manag. Sci.
**2004**, 50, 117–131. [Google Scholar] [CrossRef] - Borin, N.; Farris, P.W.; Freeland, J.R. A model for determining retail product category assortment and shelf space allocation. Decis. Sci.
**1994**, 25, 359–384. [Google Scholar] [CrossRef] - Song, Z.; Kusiak, A. Optimising product configurations with a data-mining approach. Int. J. Prod. Res.
**2009**, 47, 1733–1751. [Google Scholar] [CrossRef] - Agrawal, R.; Srikant, R. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, Santiago de Chile, Chile, 12–15 September 1994; pp. 487–499. [Google Scholar]
- Chen, Y.-L.; Chen, J.-M.; Tung, C.-W. A data mining approach for retail knowledge discovery with consideration of the effect of shelf-space adjacency on sales. Decis. Support Syst.
**2006**, 42, 1503–1520. [Google Scholar] [CrossRef] - Chen, M.-C.; Lin, C.-P. A data mining approach to product assortment and shelf space allocation. Expert Syst. Appl.
**2007**, 32, 976–986. [Google Scholar] [CrossRef] - Cil, I. Consumption universes based supermarket layout through association rule mining and multidimensional scaling. Expert Syst. Appl.
**2012**, 39, 8611–8625. [Google Scholar] [CrossRef] - Murray, C.C.; Talukdar, D.; Gosavi, A. Joint optimization of product price, display orientation and shelf-space allocation in retail category management. J. Retail.
**2010**, 86, 125–136. [Google Scholar] [CrossRef] - Hwang, H.; Choi, B.; Lee, G. A genetic algorithm approach to an integrated problem of shelf space design and item allocation. Comput. Ind. Eng.
**2009**, 56, 809–820. [Google Scholar] [CrossRef] - Tsafarakis, S.; Saridakis, C.; Matsatsinis, N.; Baltas, G. Private labels and retail assortment planning: A differential evolution approach. Ann. Oper. Res.
**2015**, 1–16. [Google Scholar] [CrossRef] - Flamand, T.; Ghoniem, A.; Maddah, B. Promoting impulse buying by allocating retail shelf space to grouped product categories. J. Oper. Res. Soc.
**2016**, 67, 953–969. [Google Scholar] [CrossRef] - Ghoniem, A.; Flamand, T.; Haouari, M. Exact solution methods for a generalized assignment problem with location/allocation considerations. Inf. J. Comput.
**2016**, 28, 589–602. [Google Scholar] [CrossRef] - Zhao, J.; Zhou, Y.-W.; Wahab, M. Joint optimization models for shelf display and inventory control considering the impact of spatial relationship on demand. Eur. J. Oper. Res.
**2016**, 255, 797–808. [Google Scholar] [CrossRef] - Frontoni, E.; Marinelli, F.; Rosetti, R.; Zingaretti, P. Shelf space re-allocation for out of stock reduction. Comput. Ind. Eng.
**2017**, 106, 32–40. [Google Scholar] [CrossRef] - Flamand, T.; Ghoniem, A.; Haouari, M.; Maddah, B. Integrated assortment planning and store-wide shelf space allocation: An optimization-based approach. Omega
**2018**, 81, 134–149. [Google Scholar] [CrossRef] - Sapountzi, A.; Psannis, K.E. Social networking data analysis tools & challenges. Future Gener. Comput. Syst.
**2018**, 86, 893–913. [Google Scholar] - Peng, S.; Yu, S.; Mueller, P. Social networking big data: Opportunities, solutions, and challenges. Future Gener. Comput. Syst.
**2018**, 86, 1456–1458. [Google Scholar] [CrossRef] - Oestreicher-Singer, G.; Sundararajan, A. The visible hand? Demand effects of recommendation networks in electronic markets. Manag. Sci.
**2012**, 58, 1963–1981. [Google Scholar] [CrossRef] - Raeder, T. Market basket analysis with networks. Soc. Netw. Anal. Min.
**2011**, 1, 97–113. [Google Scholar] [CrossRef] - Kim, H.K.; Kim, J.K.; Qiu, Y.C. A product network analysis for extending the market basket analysis. Expert Syst. Appl.
**2012**, 39, 7403–7410. [Google Scholar] [CrossRef] - Tsai, C.Y.; Li, M.H.; Kuo, R.J. A shopping behavior prediction system: Considering moving patterns and product characteristics. Comput. Ind. Eng.
**2017**, 106, 192–204. [Google Scholar] [CrossRef] - Grida, M.; Roshdy, R.; Nawara, G. Artificial bee colony algorithm for solving shelf space allocation model. In Proceedings of the International Conference on Industrial Engineering and Operations, Bandung, Indonesia, 6–8 March 2018; p. 766. [Google Scholar]
- Bianchi-Aguiar, T.; Silva, E.; Guimarães, L.; Carravilla, M.A.; Oliveira, J.F. Allocating products on shelves under merchandising rules: Multi-level product families with display directions. Omega
**2018**, 76, 47–62. [Google Scholar] [CrossRef] - Reisi, M.; Gabriel, S.A.; Fahimnia, B. Supply chain competition on shelf space and pricing for soft drinks: A bilevel optimization approach. Int. J. Prod. Econ.
**2019**, 211, 237–250. [Google Scholar] [CrossRef] - Freeman, L.C. Centrality in social networks conceptual clarification. Soc. Netw.
**1978**, 1, 215–239. [Google Scholar] [CrossRef][Green Version] - Dijkstra, E.W. A Note on Two Problems in Connection with Graphs. Numer. Math.
**1959**, 1, 269–271. [Google Scholar] [CrossRef] - Kuhn, H.W. The Hungarian Method for the Assignment Problem. Nav. Res. Logist.
**2010**, 52, 7–21. [Google Scholar] [CrossRef] - Albert, R.; Jeong, H.; Barabási, A.L. Internet: Diameter of the World-Wide Web. Nature
**1999**, 401, 130–131. [Google Scholar] [CrossRef]

**Figure 4.**Simplified layout in the case study. (

**a**) Initial product shelf assignment; (

**b**) cell coordinates.

Customer Type | Purchase Probability for All Categories |
---|---|

Type I | Meat (10%), Vegetable (10%), Fruit (10%), Dehydrated Food (10%), Dehydrated Drink (10%), Seasonings (10%), Cookie (10%), Drink (10%), Alcohol (10%), Can (5%), Kitchen Tool (5%) |

Type II | Fruit (16%), Dehydrated Food (16%), Dehydrated Drink (8%), Cookie (8%), Drink (8%), Alcohol (16%), Can (8%), Meat (30%), Vegetable (30%), Seasonings (30%), Kitchen Tool (10%) |

Type III | Dehydrated Food (20%), Dehydrated Drink (20%), Cookie (20%), Drink (20%), Meat (5%), Vegetable (5%), Fruit (4%), Seasonings (3%), Can (2%), Kitchen Tool (1%) |

Type IV | Alcohol (40%), Kitchen Tool (40%), Meat (2%), Vegetable (2%), Fruit (4%), Dehydrated Food (1%), Dehydrated Drink (2%), Seasonings (1%), Cookie (3%), Drink (3%), Can (3%) |

T_ID | C_ID | Product Item |
---|---|---|

1 | A02577 | i_{16}, i_{32}, i_{37}, i_{42}, i_{55}, i_{61}, i_{71}, i_{77} |

2 | A06359 | i_{16}, i_{74}, i_{86} |

3 | A11223 | i_{15}, i_{89}, i_{97}, i_{99} |

… | … | … |

4998 | A60825 | i_{86} |

4999 | A69390 | i_{9}, i_{10}, i_{56}, i_{86}, i_{108} |

5000 | A71889 | i_{8}, i_{15}, i_{27}, i_{28}, i_{59}, i_{91}, i_{98} |

Type | Item | Betweenness Value |
---|---|---|

Attraction Item (29) | i_{45} | 278.131 |

i_{31} | 75.547 | |

i_{33} | 75.547 | |

… | … | |

i_{87} | 10.602 | |

i_{28} | 10.082 | |

Opportunity Item (26) | i_{75} | 8.671 |

i_{78} | 8.671 | |

i_{27} | 8.671 | |

… | … | |

i_{73} | 5.225 | |

i_{47} | 5.157 | |

Trivial Item (55) | i_{90} | 4.921 |

i_{19} | 4.485 | |

i_{62} | 4.196 | |

… | … | |

i_{91} | 0 | |

i_{110} | 0 |

Items | Original Cell | New Cell | Items | Original Cell | New Cell |
---|---|---|---|---|---|

i_{22} | C_{22} | C_{26} | i_{70} | C_{70} | C_{63} |

i_{26} | C_{26} | C_{27} | i_{75} | C_{75} | C_{78} |

i_{27} | C_{27} | C_{30} | i_{78} | C_{78} | C_{75} |

i_{30} | C_{30} | C_{22} | i_{82} | C_{82} | C_{83} |

i_{61} | C_{61} | C_{70} | i_{83} | C_{83} | C_{88} |

i_{63} | C_{63} | C_{69} | i_{88} | C_{88} | C_{89} |

i_{68} | C_{68} | C_{61} | i_{89} | C_{89} | C_{82} |

i_{69} | C_{69} | C_{68} |

Minimum Support Count | Density | Isolated Product | Diameter | Average Shortest Distance | Clustering Coefficient |
---|---|---|---|---|---|

5 | 0.905 | 0 | 2 | 1.095 | 0.936 |

10 | 0.621 | 0 | 3 | 1.389 | 0.856 |

15 | 0.382 | 12 | 4 | 1.632 | 0.656 |

20 | 0.124 | 29 | 4 | 1.936 | 0.491 |

25 | 0.034 | 48 | 6 | 2.541 | 0.228 |

30 | 0.007 | 80 | 7 | 2.762 | 0.153 |

Minimum Support Count | Density | Isolated Product | Diameter | Average Shortest Distance | Clustering Coefficient |
---|---|---|---|---|---|

30 | 0.827 | 0 | 2 | 1.173 | 0.974 |

40 | 0.707 | 3 | 3 | 1.257 | 0.951 |

50 | 0.579 | 13 | 3 | 1.258 | 0.911 |

60 | 0.374 | 20 | 3 | 1.445 | 0.829 |

70 | 0.211 | 30 | 3 | 1.62 | 0.801 |

80 | 0.118 | 47 | 5 | 1.886 | 0.767 |

α | β | Number of Attraction Items | Number of Opportunity Items |
---|---|---|---|

30 | 10 | 28 | 37 |

30 | 15 | 28 | 25 |

30 | 20 | 28 | 18 |

40 | 10 | 19 | 46 |

40 | 15 | 19 | 34 |

40 | 20 | 19 | 27 |

50 | 10 | 12 | 53 |

50 | 15 | 12 | 41 |

50 | 20 | 12 | 34 |

α | β | Number of Attraction Items | Number of Opportunity Items |
---|---|---|---|

150 | 135 | 34 | 29 |

150 | 140 | 34 | 9 |

150 | 145 | 34 | 5 |

160 | 135 | 24 | 39 |

160 | 140 | 24 | 25 |

160 | 145 | 24 | 15 |

170 | 135 | 20 | 43 |

170 | 140 | 20 | 29 |

170 | 145 | 20 | 19 |

© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).