Evaluation of the Joint Impact of the Storage Assignment and Order Batching in Mobile-Pod Warehouse Systems

The rapid development of e-commerce has impacted the intelligence level of warehouses. The robotic mobile fulﬁllment system (RMFS) demonstrated that mobile-pod warehouse systems could process a signiﬁcant number of order-picking operations within the same amount of time as other systems, saving money and improving operational eﬃciency. The order-picking mode in such a system is “parts-to-picker,” which is becoming both a prevailing operation mode in industrial warehouses and an encouraging research ﬁeld during these years. One of the most signiﬁcant fundamental factors in RMFS is the operational eﬃciency that is aﬀected by storage assignment and order batching. This paper considers the joint impact of the storage assignment policies and order batching policies on order picking process. Our goal is to minimize the moving times of robots, which reﬂects the order-picking cost or eﬃciency. We propose using order similarity and item similarity to batch orders and assign item storage locations, respectively. Both the order batching and item grouping are tackled by a clustering model which is an integer linear program. We also develop a policy evaluation model to measure the order picking cost. We conduct numerical tests on six order batching and storage assignment policy combinations. A comparative analysis and an ANOVA analysis are then performed on the test results to compare the performances of these policy combinations. We ﬁnd that the Weighted Support Count-based storage allocation combining with the correlation-based order batching achieves the best order-picking performance. Also, the more accurate information about the items and orders we can get from the historical data, the more order-picking workload we can save by exploiting the similarity features.


Introduction
Robotic systems are an inevitable trend of highly developed smart logistics, and mobile-pod warehouse systems are representative of this trend. Traditional warehouse systems mostly use an inefficient picker-to-parts order-picking mode by which a lot of picker moves are wasted to get to the inventory slots. To improve the operational efficiency and save labor, automated warehouses like the AS/RS (Automated Storage and Retrieval System) were introduced. ese systems often use a parts-to-picker picking mode, in which their space utility and operational efficiency can be improved [1]. However, the AS/RS warehouses constitute a large fixed investment, require a long installation period, and have a poor flexibility. Mobile-pod warehouse systems were developed in response to these limitations. A typical representative of these systems is the robotic mobile fulfillment system (RMFS, the pioneer of which is called the Kiva system [1] and now Amazon Robotics). Figure 1 shows such an application scenario which has a concise structure that is based on mobile robots. e robots are components of the parts-to-picker system and deliver products directly to the pickers. erefore, this can save the picker's travel time along aisles and improve the warehouse productivity [2]. Because the system is operational flexible, RMFS has the virtue of incremental scalability, as well as ease of built-in redundancy [3]. Such systems have other advantages, including saving on the cost of labor and improvements in the operational efficiency and order-picking accuracy. is makes them well suited for the tight deadlines of e-commerce [4,5]. For relevant research about RMFS, the reader is referred to the survey work of da Costa Barros and Nascimento [6].
Decreasing the number of round trips of total robots is of great significance. e features of the mobile-pod warehouse system are its flexible mobile pods (also called racks), swift robots, and great central computer control. During operation, a group (can be even thousands) of robots travel on the floor. ey park underneath, lift the pods off the ground, and move along the landmarks on the floor to the workers. ey then return each pod to an available position in the storage area after items on it are picked. e central computer commands all of the robots, allowing them to move pods accurately while preventing collisions and deadlocks [7]. In this operating environment, most of the power is consumed during the robots' moving process. Due to dynamically changing pod positions, it is difficult to account for the real mileage of the robots. erefore, instead of minimizing the mileage, most studies aim to decrease the number of round trips by all robots without loss of accuracy.
Order picking is the process of retrieving products from storage or buffer areas in a warehouse to fulfill the customer orders, typically, in a strict time window. Many factors must be taken into consideration to improve the picking efficiency, such as storage assignment, order batching, and picker routing [6,8,9]. A storage assignment method is the rules which can be used to assign products to storage locations. Order batching is the process of clustering a set of orders into several groups, and orders in each group are then aggregated and picked simultaneously (i.e., handled as super orders). In a mobile-pod warehouse system, the storage assignment obviously affects the order-picking workload. Figure 2 illustrates a toy example in which 5 orders are pending for picking out from a mobile-pod warehouse (a more detailed description of the order-picking process will be elaborated in Section 3.1). e item types in each order are as follows: { }, and O 5 � 4, 5 { }. Two storage allocation policies are compared: the single storage and mixed storage which represent storage of single type of items and multiple types of items (e.g., according to the correlation of items). We assume that the number of items storage in each pod is always sufficient without considering the replenishment issues. In Figure 2(a), each order is handled separately; therefore, the number of round trips by robots is 14 for single storage, but it is only 7 for mixed storage, since one pod can provide multiple kinds of items. In Figure 2(b), the five orders are batched into two groups (by assuming that the capacity for each batch is 7 items type). erefore, the number of round trips by robots is 10 for single storage and only 4 for mixed storage. We conclude from this example that order batching and storage assignment policies significantly affect the efficiency of order picking in mobile-pod warehouses.
Although storage assignment and order batching have been extensively investigated by previous studies (as elaborated in the next section), the dedicated research for mobile-pod warehouse systems is still insufficient. erefore, we fill in this gap in this study. Our contribution can be threefold: (1) We analyze the combined effects of storage assignment and order-packing methods in an emerging robotic warehousing system, which were not well addressed before (2) Based on the characteristics of mobile storage and parts-to-picker processing mode, we recast the two decision problems as a unified clustering model by using item similarity and order similarity as distance metrics, respectively (3) We compared six policy combinations of order batching and storage assignment by numeric experiments, and the conclusions can shed light on industrial applications is paper is organized as follows. In the next section, we review the literature on the storage assignment and order batching problems. In Section 3, we describe the problem we are studying, including its settings and basic assumptions and develop the similarity coefficients used in this paper. In Section 4, clustering models are built to solve the storage assignment and order batching problems, respectively. An evaluation model was built to compute the amount of time saved using our model. Section 5 analyzes the saving results of the different policies. Finally, in Section 6, we draw conclusions and provide insights on further research.

Literature Review
In the RMFS, storage assignment and order batching ultimately affect the efficiency of order picking. Each order may have more than one order line. Petersen and Aase [9] compared various methods to measure their performance, and their results showed that order batching performs better when the order capacity is small. ey used the sensitive analysis method to verify the different factors that influence the performance. Based on this, we consider two main factors, the order batching and the storage assignment, in the order-picking process to find a more effective picking method.

Order Batching.
Recent trends show that customer orders have changed from few-and-large orders to manyand-small orders, so it is important to discuss how to handle order combinations and batching. Generally, when the order size is large, a picker tends to finish a single order picking in one route; otherwise, the picker will need to finish more than one order to reduce the total travel distance and gain increased efficiency [10,11]. Order batching is the process for grouping a set of orders into a small number of subsets so each subset can be retrieved by a single picking tour.
It is not realistic to solve a large order batching problem optimally due to the enormous number of computations involved, which is why many researchers tend to choose the heuristic algorithm to solve it. de Koster et al. [12] evaluated two groups of heuristic algorithms, seed algorithms and time savings algorithms, and their performance was evaluated by two picker routing strategies (S-shape and Largest Gap). e researchers compared the travel distance using these picking strategies. e seed algorithm proposed by Elsayed and Stern [13] was based on the total number of goods at a specific location in two orders in an automatic warehouse system. ey designed heuristic rules and then proposed and evaluated 24 kinds of order batching methods. Ho et al. [14] extended the work on the seed algorithm and evaluated 11 kinds of seed order selection methods and 14 kinds of seed order adding methods.
ese were compared with the previous methods.
Some more sophisticated methods are also used in this field, for example, the metaheuristic algorithms and exact solution approaches (for simplified scenarios). Hsu et al. [15] used the genetic algorithm to solve the order batching problem in the traditional warehouse to find the shortest travel route. Tsai et al. [16] proposed two other genetic algorithms to solve the order batching and picker routing problems simultaneously. Gademann and Velde [17] proposed the branch-and-price optimization algorithm for the order batching problem. ey proved that it was an NP-hard problem, but it was solvable using polynomials if no batch contained more than two orders. Boysen et al. [18] for the first time pointed out that both the order processing sequence and the pod arrival sequence at the picking station notably affect the order-picking efficiency in a robotic partsto-picker system. ey provided a mathematical formulation of the joint problem and proposed a decomposition-based solution approach that incorporates two dynamic programming (DP) algorithms. Füßler and Boysen [19] treated the processing sequence of orders in a single picking station to reduce the number of storage bins transferred from the storage system to fulfill orders. ey dealt with the problem with a general heuristic method. Lam et al. [20] studied an order-picking operations system to assist in formulating an order-picking plan and batch-handling sequence in a manpower warehouse. e study integrates a mathematical model and a fuzzy logic technique to divide the receiving orders into batches and prioritize the batch-handling sequence for picking. Wu et al. [21] considered an automated stereoscopic warehouse system and studied the optimization of order picking; specifically, they used two intelligent search algorithms, called fruit fly optimization and particle swarming optimization, to minimize the order-picking time.
Some order batching methods are based on order associations. Hwang et al. [22,23] proposed heuristic algorithms based on cluster analysis to solve the order batching problems in the AS/RS, and the efficiency and validity of these algorithms were illustrated through computer simulations. Later, Hwang and Kim [24] developed an efficient order batching algorithm based on cluster analysis for the low-level picker-to-part warehousing system. Chen and Wu [25] described the order batching problem based on a priori data mining to develop the association rule and then established an order clustering model based on 0-1 integer programming to maximize the total associations between the orders within each batch. Chen et al. [26] also developed the same approach to obtain the order and then adopted the seed algorithm to develop the order clustering approach. ey then compared the computational results from this approach with those of the other five kinds of heuristic algorithms and drew some useful conclusions. is paper follows that idea: we developed a clustering model with 0-1 integer programming based on the correlation of orders to maximize the correlation of all the batches to obtain the optimal batching.

Storage Assignment.
e storage problem is a research focus in the field of warehouse operations. de Koster [10] classified storage assignment policies into three categories (experience storage, class-based storage, and family  Mathematical Problems in Engineering grouping). Experience storage includes radon storage, closest open location storage, and dedicated storage that rely on the long-term accumulation of experience instead of cargo information. On this basis, Gu et al. [27] added the furthest available storage policy and the longest idle storage policy. e class-based storage policy groups products into classes based on the turnover rate of the fastest moving class that is closest to the depot. Family grouping entails possible relations between products, which means similar products are located in the same region of the storage area. Family grouping strategy originates from Frazele and Sharp [28] who proposed the concept of correlated assignments (CA). ey employed the statistical method to measure the correlation between pairs of SKUs and then sorted the correlation values in decreasing order to assign the storage locations. Family grouping strategy is also adopted in this study.
How to measure the correlation of items is vital for the family grouping-based storage assignment. Shafer and Rogers [29] summarized the methods of measuring the goods' correlation and discussed the evolution of these methods. van Oudheusden et al. [30] proposed a pairwise interchange procedure to improve the closeness relationships of the items in a manufacturing plant. Liu [31] proposed measuring the item similarity by the number of common items in orders and also considered the correlation between customers.
Some studies consider more factors, other than item similarities, for a better storage assignment in specific applications. Wutthisirisart et al. [32] took into consideration the frequency and size of the orders. ey found that orders with more kinds of items should be located far away from the depot, since they typically need more time to handle, while orders with higher inbound/outbound frequency should be closer to the depot. Chiang et al. [33] developed a goods' correlation index using the data mining approach, in which the turnover rate was involved. Later, they proposed another heuristic algorithm on the basis of the goods' correlation [34]. Lee [35] clustered the correlated items into a group and then allocated goods based on each group's COI (cube-perorder index). Rosenwein [36] solved the storage assignment issue using the cluster analysis method. e items in the same group should be as close to each other as possible in order to form an effective pick route. Chuang et al. [37] proposed a two-stage "clustering-assignment" model for the storage assignment problem. e first stage is responsible for clustering items based on the between-item support extracted from customers' orders, and the second stage aims to minimize the picking distance. Tu et al. [38] considered a storage assignment problem in a pick-to-pass order picking system in which a picker picks part in one zone and hands it over to another picker until all items in the order are fulfilled. A genetic algorithm was proposed to solve the storage assignment problem, additionally considering the workload balance between picking lines.
ere are limited research works dedicated to mobilepod warehouse systems that are related to the storage assignment. Weidinger et al. [39] considered the problem of assigning pods to storage positions when a pod returns from a picking station to the storage area. ey minimized the total travel distance of the mobile robots to complete all the tasks. However, they only considered the pod location but not the item location. Similarly, Yuan et al. [40] also focused on the pod location problem in a parts-to-picker system, where the velocity-based storage policies were analyzed. Li et al. [41] also studied the pod location policy in a highdensity mobile-pod system. When applying multiclass closed queueing network models, Roy et al. [42] analyzed both order-picking and replenishment processes in a mobile fulfillment system. Valle and Beasley [43] extended the work of Boysen et al. [18] by additionally considering the order and pod allocation to picking station (or pickers as in the paper). e (first-stage) order and pod allocation solution was then submitted to a (second-stage) pod sequencing problem for each picker where the order sequence was also determined.
is study formulated and solved the two subproblems separately: for the order and pod allocation problem, two heuristics were proposed; meanwhile, for the pod sequencing problem, the proposed formulation explicitly considered the pod inventory positions which were ignored in the work of Boysen et al. [18], and the CPLEX solver was used to generate a feasible (not optimal) solution.
To summarize, most related studies focus on traditional warehousing systems, such as manpower warehouses and AS/RS; however, only limited studies addressed the mobilepod system. e fundamental difference is that a robot can carry only one pod (but with multiple items) per trip to a picking station, while a picker needs to visit multiple storage slots per trip. erefore, measuring the storage assignment and order batching methods is quite different. Even though a few research were dedicated to mobile-pod systems, they did not address allocation items to pods. Our work aims to fill in such a gap.

Problem Description
In this section, we introduce the system conditions, warehouse layout, and basic assumptions. We also discuss the coefficients of similarity used in the storage assignment and order batching.

Mobile-Pod Warehouse System.
A mobile-pod warehouse system conducts a profound reform in the picking mode on the basis of the traditional warehouse system, and the mobile robots and pods constitute a highly dynamic system. e system can be simplified into four parts (without loss of generality, we neglect the replenishment and shipping operations).
ey are the inbound, the storage area, the sorting service area, and the outbound. e layout is shown in Figure 3.
A blue square represents a mobile pod, a grey square means the pod in that position has been removed, and the blank areas between the pods are the aisles where the robots move. e orange squares represent robots without a pod. A blue square embedded in a grey square represents a robot carrying a pod and the arrow indicates its walking direction.
ere are four picking stations in the order sorting service area in this example, and a smiley face represents a picker. Robots in the service area need to wait until the picking tasks are finished by the operators to leave. Figure 4 shows more details of the pod (Figure 4(a)) and the picking station ( Figure 4(b)). e main process of order picking in a mobile-pod warehouse that we consider can be summarized as follows: (1) Storage. Items are replenished to the warehouse and stored in pods. Specifically, each pod can accommodate multiple kinds of items; that is, mixed storage policy is considered (as Figure 3(a) shows). To allocate storage locations (pods) to each item, the storage assignment problem must be tackled, which answers the question of which items should be stored in the same pods. is is equivalent to dividing the item SKUs (Stock Keeping Units) into several nonoverlapping groups. e grouping of items is based on the item similarity, which will be formally defined in Section 3.3.
(2) Batching. A set of orders are divided into batches and each batch will be processed in a picking station simultaneously. e batching of orders is based on the order similarity (see Section 3.4); the logic behind this is that orders with common items are more likely to be fulfilled by one trip of pod moving to the picking station. (3) Picking. For a batch of orders, one or multiple pods are moved from their storage slots to the associated picking station (as shown in Figure 3(b)), to meet the desire of items by the orders. Once all the orders in this batch have been picked, another batch will be processed next.
Our aim of this study is to identify effective storage assignment and order batching methods to minimize the number of moves by all robots. To do so, we turn to maximize the overall order similarity in the order batching problem and to maximize the overall item similarity in the storage assignment problem (see Section 4.1).
en, the number of robot moves is estimated by a saving-based method which will be given in Section 4.2.

Assumptions.
In this study, we made the following assumptions: (1) Each item can only be stored in one mobile pod, and the number of items that can be stored in each pod is limited.
(2) e maximum number of orders in each batch is given due to the limited capacity in the picking station (3) Each picking station can accept the next batch only if the current batch is finished; there are no priorities concerning the picking station sequences (4) Orders that need picking are known and static instead of arriving dynamically (5) Order-picking efficiency is measured by the number of robot trips to and from the picking station, despite the velocity of robots and the amount and the routes of robots 3.3. Item Similarity. Item similarity represents the possibility that two items appear in the same order, which can be evaluated by the information in the historical transaction data. e higher this similarity is, the stronger the association between the two items is, and the more likely the two items should be stored in the same pod. We adopt two types of item similarities as given below.

Jaccard Index. Developed by the Swiss mathematician
Paul Jaccard, the Jaccard Index is used to compare the similarities and differences between sample sets. Frazele and Sharp [28] also used the Jaccard Index to measure the association of goods in their study of storage assignments. Given N orders, O � O 1 , O 2 , · · · , O N , containing P items in total. For any item A and item B, denote a as the number of orders that contain both A and B: where CAB i is a 0-1 variable: Define b as the number of orders that only contain item where CA i is a 0-1 variable: Denote c as the number of orders that only contain item B: where CB i is a 0-1 variable: en, S AB is defined in the Jaccard Index as which is in the range of [0, 1].

Weighted Support Count (WSC). Developed by Ming-
Huang Chiang et al. [34], the WSC represents the association between any pair of goods and it involves the concepts of the support and lift, which are originally from data mining. Given N orders, O � O 1 , O 2 , · · · , O N , containing P items in total. For any item A and item B, the following rules apply: (1) support, defined as the percentage of the orders that have both A and B, represented by P (A ∪ B) here, is expressed as

P(A), the percentage of the orders that contain only
A, is expressed as where A i is a 0-1 variable: P(B), the percentage of orders that contain only B, is expressed as where B i is a 0-1 variable: (2) lift, defined as the ratio of the probability of having B under the condition of having A and the probability of having B, illustrates the type of relationship between the items. Lift AB is defined as If the lift value is greater than 1.0, the actual probability of A and B appearing in the same order is greater than the theoretical probability (A and B are complementary to each other). If the lift value is less than 1.0, A and B are substitutive for each other. If the lift value equals 1.0, A and B are independent of each other. LW AB is the relationship of two items: e WSC coefficient is then defined as As equations (14) and (15) suggest, unlike the Jaccard index, the WSC coefficient can be a negative value that varies between [−1, 1]. A negative WSC coefficient between two items will lead to less probability of assigning them to the same pod.

Order Similarity.
e association between a pair of orders is measured by their similarities, which can be represented by the number of items in common regardless of the quantity of each kind of item. Orders with a high similarity should be allocated to the same batch. More specifically, the order similarity is the product of the proportions of items in common in each of the two orders being measured, within the range of [0, 1]. For orders A and B, containing P kinds of items in total, the following variables were utilized: X ij is the 0-1 variable: Simi AB , the similarity of orders A and B, is expressed as For example, if orders A and B have no items in common, C � 0, Simi AB � 0; if orders A and B are exactly the same, then C/M � 1, C/N � 1, and Simi AB � 1; if orders A and B are partly the same, then 0 < Simi AB < 1.

e Clustering Model.
e main ideas of order batching and storage assignment problems are consistent, since they are both based on associations. erefore, a common method can be used to solve the two problems simultaneously: clustering analysis.
We use the storage assignment problem as an example. As assumed in the problem description, one kind of item can only be allocated to one cluster, and the items in one cluster are stored in the same pod. We first calculate the item similarities according to the measures defined in Section 3 and then cluster all items with the objective to maximize the sum of all the item similarities in each pod. e order batching problem is approached in a similar way, that is, to maximize the sum of all the order similarities in each batch. We can then build the clustering model for the storage assignment problem using the parameters shown as follows: P: number of the kinds of items in the storage area K: number of pods in the storage area C: maximum number of items that can be stored in one pod Define the 0-1 variable x ij ; x ij � 1 if item i is assigned to cluster j; otherwise x ij � 0 Define the 0-1 variable y j ; y j � 1 if item j is selected as a cluster center; otherwise y j � 0 We can then use the Jaccard Index and WSC coefficient as the cost coefficients in the objective function separately. e objective function maximizes the sum of all the similarities between the items and their cluster centers and is expressed as To make sure that every item has been assigned to one (and only one) cluster, we must build the constraint: e number of clusters is constrained to K, the number of pods, which leads to constraints: x ij ≤ y j , i, j � 1, . . . , P.
Constraint (23) represents the capacity limit of the pod: With variable-type constraints (24) and (25), the model is complete: y j � 0, 1, j � 1, . . . , P. (25) e order batching problem can also use this model (19)- (25), with only minor alterations in the meaning of the parameters. Specifically, in the order batching problem, C is the maximum number of orders simultaneously handled in the picking station, P is the number of orders, K is the number of batches which can be estimated as up rounding P/C.

e Policy Evaluation Model.
We need to evaluate the effect of the storage assignment and order batching policies. During the order-picking process, order batching was conducted first so that orders in each batch are aggregated in terms of items. en, items were fetched per batch based on the given storage assignment policy which means picking multiple items needed from one pod containing such items. In this study, we propose evaluating the system performance by the saved number of round trips by the robots, which consists of savings from the order batching policy (Batch Save) and from the storage assignment policy (Storage Save).
Save � Batch Save + Storage Save. (26) Suppose that g ∈ G item set, set of storage items; o ∈ O order set, set of original customer orders; b ∈ B batch set, set of multiple batches gained from dividing Mathematical Problems in Engineering original orders; and k ∈ K pod set, set of pods (a pod can store multiple items).
We here give an example to show the policy evaluation method.

Order Batching Process. Let
and then the saved number of round trips from any batch is e saved number from the entire order batching process is For example, suppose that there are nine orders waiting to be picked, and they are Suppose that the batching rules obtained after solving the model are en the three batches contain different items as B ' is process reduced the number of round trips the robots made from 4 + 3 + 3 + 2 + 2 + 4 + 3 + 3 + 2 � 26 to 4 + 3 + 2 � 9, which shows the advantage of order batching.

Storage Assignment Process. Define
as the number of the saved round trips by batch b when pod k arrives. en, the saved number from the entire storage assignment process is For the above example, if the items are located based on the storage assignment model, the location assignments are 1, 2, 3 { } and 4, 5 { }. Under this situation, for the batch orders { }, the robot only needs to take 2 + 2 + 1 � 5 round trips to finish the orders. But if one pod only contains one kind item, the round trips of the robot will be 4 + 3 + 2 � 9.

Experiments and Data Analysis
We solve the models built in Section 4 using the commercial solver Cplex and then simulate the order batching and storage assignment process and gather the experimental data. Based on the data, we evaluate the performance of the different policies through both intuitive and ANOVA analysis.

Experimental Settings.
e experimental instances are generated randomly. Specifically, Orders with capacities limited to 1-4 item lines are randomly generated, with each line corresponding to a unique item. In order to simulate real demands patterns, items are classified into three types: best sellers, secondary best sellers, and ordinary goods, which held 10%, 25%, and 65% storage capacity, respectively. ey appear with a frequency ratio of 6 : 3 : 1 as shown in Table 1.
We determine a certain combination of the orderpicking policies for comparison. For order batching, we consider three policies: no batching, random batching (orders are randomly grouped), and batching by the correlation rule (i.e., by the proposed order similarity). For storage assignment, we consider two policies: random storage and storage by the correlation rule (i.e., by the Jaccard index or the WSC coefficient). By crossing over the batching and storage policies, we form 3 × 2 � 6 orderpicking policies, as shown in Table 2. For example, Policy 2 means that the goods are stored and batched both by correlation policies.
We then design 4 instance types for the numerical test to evaluate the effects of these policies under different problem scales. e instance types are created by changing the parameters, like the number of orders, items, and pods. We first use a large number of orders and items to obtain the association rules and then use these rules as inputs to feed the clustering model and the evaluation model. Instance type 1 had the smallest scale and instance type 4 had the largest scale. Table 3 lists their details.
For each of the four instance types, we randomly conduct ten experiments under each of the above six policies and each of the two item similarity measures, resulting in e results of these experiments are then used to do the following numeric studies.

Comparison of Policies.
We compare the performances of the six order-picking policies with the generated instances. Tables 4 and 5 show the results by using the Jaccard Index and WSC coefficient, respectively.
e percentage values represent that the ratio of the number of round trips can be saved (saving degree). e best policies are highlighted by bold fonts. e comparison of Tables 4 and 5 shows that the saving results are better when we use the WSC coefficient. is is because there may exist complementary, substitutive, or independent relationships between items, and mining these associations when assigning storage can improve the system performance. We further analyze the data gained by using the WSC coefficient.
rough a horizontal comparison of Table 5, Policies 2 and 3 have the best saving effects (both using the correlation rule for storage allocation), and the larger-scale system shows a better performance. e saving results were over 80%, which means that every 100 round trips of the robots can be reduced to 20. Policy 6 performs the worst (and performs poorly on a larger scale), which directly indicates the advantage of the joint storage assignment and order batching.
We further compare the results of instance types 1 and 2 and instance types 3 and 4. We find that all six policies performed worse in type 1 than in type 2, and the same happens in types 3 and 4. e difference is the number of orders used to develop the rules: types 2 and 4 are ten times types 1 and 3. is means that if the system provides enough order data for association rule mining, the advantage of the storage assignment will be more evident, which may result from more accurate association rules (like customer preference) being obtained from more order data.
In the following, we observe the influence of different order batching policies when we fix the correlative storage policy (WSC). An intuitive chart is drawn in Figure 5, where X-axis and Y-axis stand for the index of the experiment number and the saving degree, respectively. Note that numbers 1-10, 11-20, 21-30, and 31-40 represent the random instances with types 1, 2, 3, and 4, respectively. e saving degree is the percentage of saving compared with the worst cases under each instance.
Notice that the saving results of the correlative storage policy are greatly affected by the order batching policy. e average saving result is only 28.25% with the no-batching policy, whereas it can reach 80.00% with the random or correlative batching policy.
For more detailed comparison analysis, we report the result of a pairwise comparison in Table 6.
From Table 6, we conclude the following insights: (1) Without order batching, the use of correlative storage performs much better than the use of random storage, which can be thousands of percentage points. Larger test scales can result in more obvious advantages (1669.57%-5829.74%). (2) With random order batching, correlative storage can still perform an average of 10% better than a random storage policy. A larger test scale and an increasing number of items can both improve the advantage   (11.97%-17.83%) of the correlative storage policy. is proves that the accuracy of the correlative rules is related to the number of orders, and these rules perform better with more items.
(3) Under the correlative storage policy, the advantage of the correlative order batching policy increases from 10.85% to 21.24% as the numbers of orders and items increased. is indicates that the accuracy of the correlative rule is directly affected by the size of order data volume. (4) With the random storage assignment, the performance of correlative batching is better than that of random batching when the test scale is small. No big difference exists when the test scale is large. e correlative batching has a considerable advantage over the policy of no batching at any test scale and a larger advantage with a larger test scale. (5) With the correlative storage assignment, the correlative order batching results are similar to those with a random policy. e correlative order batching has less advantage (about 1-2 times) than the no batching policy (compared with the random storage policy).

ANOVA Analysis.
We also perform ANOVA (shown in this section) due to the sample randomness. We intend to  No-batching correlative batching random batching Figure 5: Comparison of the order batching policies on the system performance. We apply double factor variance analysis. Suppose that the two factors, the order-picking policy and the numerical instance, influencing system performance are not independent of each other (i.e., their interaction needs consideration).
We first propose the hypothesis.

Hypothesis of row factors:
H 0 : Row factor (example) has no significant influence on the degree of system performance. H 1 : Row factor (example) has significant influence on the degree of system performance.

Hypothesis of column factors:
H 0 : Column factors (order-picking strategy) have no significant influence on the degree of system performance. H 1 : Column factors (order-picking strategy) have a significant influence on the degree of system performance.

Hypothesis of interaction:
H 0 : ere is no interaction between the two factors. H 1 : ere is an interaction between the two factors.
We then construct test statistics. Because of the article space limitation, we omitted the mechanical steps and went straight to the analysis of variance.
We use a significance level of α � 0.05. e analysis is derived by Excel and the results are shown in Table 7 (we skip the calculating processes). e results are all significant.
SS: sum of the squares, df: degree of freedom, MS: mean square, F: F statistics, P value: P value used for the test, and F crit: critical value given level α.
We utilized the F value to make decisions and got three conclusions from Table 7. First, for the "Sample" row factor, the F test value is 4.602848 > F 0.05 (3, 216) � 2.646398. So, we reject the original hypothesis H 0 of the row factor, which reflects that the influence of the row factor is significant. Second, for the "Column" (order selection policy) factor, the F value 19846.64 > F 0.05 (5, 216) � 2.255861. us, we reject the original hypothesis H 0 of the column factor. is means that the order selection policy significantly influences the degree of system performance. Last but not least, we analyze the test value of interaction factor: F � 27.43351 > F 0.05 (15, 216) � 1.712905. We should reject the original hypothesis H 0 of the interaction factor, which demonstrates that interaction of instances and selection policy significantly influences system performance.
erefore, the analysis confirms the conclusions drawn in Section 5.2.

Conclusions
is work studies how the order-picking policy in a mobilepod warehouse differs from traditional manual or automated warehouse (e.g., AS/RS) systems. Firstly, we focus on the joint impact of storage assignments and order batching policies on order picking process, which is still not well addressed in the mobile-pod warehouses. Secondly, we propose a unified clustering models to handle the storage assignment and order batching problems, followed by an effective policy evaluation model. Last but not least, we conduct numerical experiments to test the six crossover policies and draw some practical conclusions, which can shed light on industrial applications. e conclusions are summarized as follows: (1) Among the six order-picking policies, the combination of the correlative storage assignment policy and the correlative order batching policy performs the best (2) For the two item similarity measures, the WSC coefficient performs better than the Jaccard Index (3) More historical data helps obtain accurate correlation information and make better storage and batching decisions, which can significantly improve the order-picking efficiency ere are some extensions that can be studied in future research. First, we assumed that one kind of item could only be stored in one mobile pod, but items stored in several pods are also common in practice. Since single and dedicated storage locations may result in low efficiency in replenishment and order picking, this is an area that requires further study. Second, we did not consider the specific quantity of each kind of items or parameters like volume. ese extensions can be made by adding quantity and space constraints.
Data Availability e data are generated randomly based on the experiments.

Conflicts of Interest
e author declares that there are no conflicts of interest.