A Polling-Based Dynamic Order-Picking System considering Priority Orders

Ran, Wenxue; Liu, Sen; Zhang, Zhe

doi:https://doi.org/10.1155/2020/4595316

Complexity

On this page

Abstract Introduction Literature Review Numerical Example and Discussion Conclusions Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2020 | Article ID 4595316 | https://doi.org/10.1155/2020/4595316

A Polling-Based Dynamic Order-Picking System considering Priority Orders

Wenxue Ran,¹Sen Liu,¹and Zhe Zhang²

Academic Editor: Roberto Natella

Received21 Oct 2019

Revised01 Jun 2020

Accepted30 Jun 2020

Published24 Jul 2020

Abstract

Nowadays, how to offer extremely fast response to customer orders has become a major challenge for warehouse management, especially in e-commerce. Due to the time urgency aspect of some “VIP” orders that need priority processing, one of the most important issues for logistics distribution centres is how to improve the VIP order-picking priority without reducing the common order-picking efficiency. With this consideration, this article put forward a new priority polling model to describe and analyse this problem. We divide orders into priority and common categories according to their time urgency. A mathematical model is established for such a system by applying polling theory, a probability generating function, and an embedded Markov chain. Numerical analysis shows that this priority polling-based picking system can improve the picking efficiency and is well suited to practical operations.

1. Introduction

In recent years, China’s e-commerce has developed rapidly. According to data from the China International E-commerce Centre, in 2018, consumers spent more than 9 trillion yuan shopping online, and it is expected that the scale of customers preferring to use online platforms will continue to increase in the future. With the growth of e-commerce, customers’ expectations for order delivery have also increased; thus, e-commerce firms must have the ability to respond to consumers quickly. JD.com, one of the online platform giants, processes hundreds of thousands of orders every day.

However, the characteristics of e-commerce business, i.e., smaller order sizes and more varieties, put great pressure on logistics centres’ order processing activities, which leads to order delivery delays [1]. Therefore, reducing the order-to-delivery time to customers with smaller order sizes and more varieties becomes the primary challenge for distribution centres [2–4]. In general, due to the high operational cost, order picking is considered to be a very important activity in a warehouse, and some studies have even found that the cost of order picking could come to 60% of the total operational cost [5–7], especially under the environment of e-commerce. In addition, the importance of order sorting must be fully understood in the design of the warehouse [8–10].

Currently, many products are sold both online and offline, and online retailers face difficult challenges of how to organize the logistics supply, both among and after the receipt of order [4, 11]. First, customers’ impulse purchases can lead to the release and cancellation of orders within a certain time horizon [12] which means that the distribution centre could lose opportunity to pick the orders, which will lead to frequent changes in its production plan. Second, firms usually desire to provide rapid and timely delivery in the shortest possible time for the “sudden” late online orders [13]. This is because the Internet makes the probability of customers cancelling orders much higher than in the traditional buying mode since customers can buy another product immediately with a single click, which is much easier than in physical sales [14]. Third, logistics distribution centres have often encountered this type of situation in the e-commerce era. In a batch of orders, a typical order can be processed step by step, but some “VIP” orders need to be prioritized. As mentioned above, the frequent cancelling of orders by customers seriously affects the quality of logistics services, which threatens the commitment of logistics providers to clients, especially the owners of VIP orders. Furthermore, the importance of an order is influenced by the customers at different levels. In other words, VIP orders are more important to the e-commence firms than “non-VIP” orders because the loss of VIP customers will lead to more profit losses. Consequently, different types of products require different picking methods.

However, scholars have found that the traditional methods do not deal well with the suddenly appearing VIP orders; Kim et al. [15] introduced a new inventory replenishment method for an automated picking gantry crane, which allowed the late but priority orders to jump the current queue. It was mainly used in short cycle time environments, and they did not consider the fairness of ordinary orders. Hence, polling systems began to be used in picking system studies. Nevertheless, as far as we know, only limited studies have been performed in this area. The pioneering work of Gong and De Koster [11] analysed a dynamic order-picking system based on a polling model, in which the order pickers walk around the picking area to sort out all the backlogged orders in their picking paths. The research results showed that compared with traditional batch-picking methods (as indicated by Le-Duc and de Koster [16]), the proposed polling system-based dynamic order-picking model can effectively bring down the order throughput time. Gong et al. [13] also introduced stochastic variables in a polling system to analyse such picking models and in an approximate way described the complete order waiting time distribution and the accuracy of the polling-based order-picking systems. Claeys et al. [17] designed a polling system in a new service discipline for analysing the order flow time problem of parts-to-picker and used periodic time to deduce the random boundary, which proved to be helpful in setting the target for the storage area throughput.

Nevertheless, the existing polling systems studies on order picking do not consider the situation in regard to priority orders, whereas in a real situation, some VIP orders need to be prioritized over others. Therefore, to solve this problem, we propose a novel combined picking model based on a polling system. We divide the order queues into priority queues (priority orders) and multiple ordinary queues (ordinary orders). Priority orders refer to orders that need to be processed with priority, such as some VIP orders, which need to be processed immediately. Ordinary orders refer to orders that do not need to be processed immediately and have loose time windows. We propose an “exhaustive parallel 1-limited” based dynamic order-picking model, which combines a polling system with the probability generating function approach and the Markov chain to solve this type of picking problem. Due to the service strategy of “exhaustive parallel 1-limited” service strategy, the novel model can treat ordinary orders fairly while improving the picking efficiency of priority orders. The numerical analysis and discussion prove the practicability and scientificity of the method proposed in this article.

The organization of the study is structured as follows. Section 2 gives the literature review. Section 3 introduces the proposed polling system-based picking model. A numerical example is demonstrated in Section 4. Section 5 gives the conclusions and discussion.

2. Literature Review

The first related stream of the literature is on the picking activity, which involves stock-to-picker systems, order batching, inventory allocation policies, and order-picking sequencing [7, 8, 18–20]. In a stock-to-picker system, there are three types of order-picking strategies as follows: stock-to-picker, picker-to-stock, and automated dispensing systems [21–23]. In storage assignment policies, there are several categories, i.e., random storage, dedicated storage, closest open location storage, family grouping, and class-based storage [24–26]. The idea of order batching involves grouping orders to be picked in a separate route, thereby reducing the theoretical time per pick, with the purpose of determining the best order batching configuration to minimize the distance or travel time [18, 27–29]. Order-picking sequencing programs focus on the path/route taken when travelling to the pick locations while considering the item extraction order; these apply to warehouses with fully automated picking systems and manual picking operations [30–32]. In recent years, many scholars have realized the significance of mankind factors in order picking, and the study of mankind factors is increasingly gaining popularity [6, 33–37]. For example, Grosse and Glock [38, 39] presented a method to model and discuss the influence of laborer learning, forgetting, and remembering on the storage assignment strategies and order-picking time. However, the methods mentioned in the above studies fail to handle the situations with smaller order sizes and more varieties that are characteristic of e-commerce.

To improve the order-picking efficiency, scholars began using polling systems. A polling system can effectively describe the queue arrival and processing, i.e., a system of multiple queue arrivals in a cycle by a single server, and includes three processes, as follows: queue arrival, serving queue, and switching service object [40]. Much research exists on polling systems, which are used widely in many systems, such as computer and telecommunications networks [1, 41–43]. There are several representative control strategies: gated, exhaustive, limited, k-limited, and time-limited. For the gated control strategy, the machine dispenses only the products in series which are turned up when it is checked at a queue [44]. For the exhaustive control strategy, the machine dispenses all products in series in a queue till it is empty. With regard to a limited control strategy, one product in a queue at most is dispensed at a cycle. Under the k-limited control strategy, the machine will switch to next queue when k units of products within the current queue have been serviced or no one needs service. However, under a time-limited control strategy, the machine services the current queue according to time rather than the amount of products [45]. Nevertheless, this stream of the literature did not consider the situation in regard to VIP orders, while our paper addresses the issue by trading off the picking service for priority orders and ordinary orders.

3. Model of the Proposed Priority Order-Picking System

3.1. Problem Statement

This study is based on the automatic control strategy of picking equipment in the Baisha logistics distribution centre in Changsha, Hunan Province, China. The Baisha logistics distribution centre is a subsidiary of Hunan Tobacco Company, and its “delivery range” covers Changsha city. At present, most Chinese logistics distribution centres are automating their business processes, and the picking goods are regular unit materials in cartons. In the case of Baisha, for example, the orders are made up of different numbers and brands of unit materials, which are placed by customers through e-commerce and mobile Internet, and the picking delivery time is periodic and punctual. The company promises that the e-commerce orders will be delivered within 24 hours because many retailers are using e-commerce for temporary replenishment.

The traditional order-picking process is to batch large numbers of orders and release them in the workshop. With increasing number of orders, the order batch formation time and order delivery time need to be shortened to ensure that customer demand is met. More efficient picking systems should be studied. Hence, we propose an “exhaustive parallel 1-limited” based dynamic order-picking system that is similar to the system of Gong and De Koster [11], which is described as a “dynamic picking system (DPS).” In a DPS, orders are picked in batches and arrive continuously online, whereafter they are sorted according to client’s requirement [11, 18]. The “exhaustive parallel 1-limited” based DPS can be explained as follows: the picking system is composed of N ordinary picking machines and one priority picking machine. The newly arrived orders include ordinary orders, which have loose time windows, and priority VIP orders, which need to be processed immediately. For example, at a certain moment, the cache holds an ordinary order queue and a priority order queue which are waiting for picking service. When the picking machine starts to work, the priority order queue first begins to accept service until all orders within the queue are served (the exhaustive control strategy); then, the machine turns to pick the ordinary order queue, but only handles one order (the 1-limited control strategy), and then switches to serve a next priority order queue.

Based on the polling system, we divide the picking operation into three processes as follows: the order arriving process, the picking process, and the order polling switch process. First, all three processes are stochastic, and they depend on the consumer’s purchase timing, the picker’s efficiency, and the picker’s adjustment flexibility, respectively. Second, the process of the previous order will obviously affect the queuing time of the next order. These characters illustrate that the picking model satisfies the conditions of memorylessness and conditionally independent, which are required by the Markov chain.

In the polling system, priority orders and ordinary orders are dealt with in parallel operations, with priority orders under an exhaustive control strategy and ordinary orders under a parallel 1-limited control strategy. Figure 1 represents the studied “exhaustive parallel 1-limited” based order-picking model.

Each arriving order is assumed to have a Poisson distribution; when the picking system begins to work, if ordinary orders need the picking operation, the ordinary picking machines pick them under the 1-limited control strategy (the ordinary order-picking task is not empty). For the picking operation of priority orders, the priority picking machine picks them under an exhaustive control strategy. The exhaustive control strategy reflects the priority of the VIP orders. The 1-limited service policy can judge the arrival situation of the current order queue of the picking machine. With the current order queue arrivals, the picking machine begins to operate. If the current order queue is empty, then the picking machine transfers services to the next order queue. The 1-limited control strategy can then avoid repeated picking and disorder in the ordinary orders.

In addition, there are several basic conditions for the polling system-based picking model as follows:(1)We assume that one picking machine only can pick one order queue at the same time because a complete order queue includes priority order queues and ordinary order queues. In the mass production environment, the picking system, after finishing a complete order queue, can switch to the next one; otherwise, it will cause disorder in the order queues. Hence, the priority order queues and ordinary order queues cannot be picked at the same time by one picking machine.(2)The picked goods are all the same kind. The orders are determined by the stochastic needs of the customers, and the quantity of orders is multiples of the unit materials. For example, in this study, one order is composed of different numbers and brands of cigarettes in cartons, and a pack of cigarettes denotes one unit of materials. Each order does not affect each other and has the same probability distribution.(3)The picking times of the priority order queue and ordinary order queue change with different control strategies. The former is picked by the priority unit in the “exhaustive” strategy, while the latter is picked by the ordinary unit in the “1-limited” strategy.(4)The unit order that enters the order queues is normalized, independent of each other, and follows the same distribution. When one order involves under picking, the order-picking time is independent from the other orders, which also have the same probability distributions. The switch time between contiguous order queues is independent and has the same probability distribution.(5)The order quantities are not fixed and do not produce information loss.

3.2. Notations and Definitions

Ordinary order queue and priority order queue are simplified to ordinary queue and priority queue, respectively, and all the notations of this paper are as follows: : the quantity of unit materials in ordinary queue i (i = 1, 2, …, N) at moment t_n. : the quantity of unit materials in the priority queue at moment t_n. : the quantity of unit materials in the priority queue at moment when the picking machine is shifting from ordinary queue i to the priority queue. : the time that the picking machine is serving ordinary queue i. : the time that the picking machine is serving the priority queue. : the time consumed when the picking machine switches from ordinary queue i to the priority queue. : the quantity of unit materials in ordinary order that need to be picked in queue j in V_i time (i = 1, 2, …, N, h). : the quantity of unit materials of priority order that need to be picked in queue j in V_h time. : the quantity of unit materials that are switched to queue j in u_i time (i = 1, 2, …, N, h). : the state of ordinary queue i. : the state of the priority queue. : the mean time of the arrived ordinary queue j (j = 1, 2, …, N). : the mean time of the arrived priority queue. : the mean time that the picking machine is serving ordinary queue j (j = 1, 2, …, N), . : the mean time that the picking machine is serving priority the queue. : the switch time between ordinary queue j (j = 1, 2, …, N) and another queue, . : the probability generating function of the time of the arrived ordinary queue j. : the probability generating function of the time of the arrived priority queue. : the probability generating function of the time that the picking machine is serving ordinary queue j. : the probability generating function of the time that the picking machine is serving the priority queue. : the probability generating function of the switch time among ordinary queue i and another queue. Q: the total number of orders. : the probability distribution function of the priority queue’s state. t_n: the time stamp of the order queue’s arrival. and : the integer coefficient without practical concern. is contained in a subset of n, which denotes the more detailed division of n. is contained in a subset of t, which denotes the more detailed division of t.

Note: the “queue … switched to … queue” means that the entire process of an order queue is switched to the next one because there is a time gap between an order queue and the next one when the machine is picking orders.

Let the order arrival process be a Markov stochastic process at moments , , and () with a Poisson distribution and no aftereffect. In practice, the number of order VC queues is relatively determined. Therefore, a discrete-time countable state variable can structure an embedded Markov chain, and the system state variable at the next moment is only related to that at the previous moment. According to the literature [46], the Markov process has the characteristics of nonperiodic and ergodic in a steady state of the system and has a particular steady-state distribution. This means that when the ordinary orders i (1, 2, …, N) are being picked at moment t_n, ordinary orders are waiting for picking. At this moment, the state variables of the system and their probability generating function are and ( is the first-order partial derivative of with respect to ), respectively. Similarly, the state variables of the system and their probability generating function at moment are and ( is the first-order partial derivative of with respect to ), respectively.

3.3. Probability Generating Function of the Picking System

3.3.1. Probability Generating Function with Picking Priority Orders

Set the total time for the picking machine to complete the picking services of k orders within priority order queue as and the time consumed for picking the first order within ordinary order queue as . Since the priority order queue adopts the exhaustive control strategy, the picking machine needs to serve the orders which are inserted in the -th time slot as well as the orders entered into the cache during the picking operation. The operation time they need is . The time axis is divided by unit time slot, and the object of analysis is discrete-time system. First, the picking machine at time t_n, according to the 1-limited service policy, picks the ordinary order queue. Now, the state variables of the DPS are . At time , the ordinary order end picking activity and the picking machine switch to pick the priority order h under an exhaustive control strategy. And the state variables of the DPS are . After picking, the ordinary order queue i + 1 is polled at time t_n+1. Now, the system’s state variables are . Note that the system’s state variable at time t_n+1 is only correlated to that at time , which is a Markov process without aftereffect. Thus, we can derive the state transition equation of the picking system as follows:

Referring to the work of Takagi [47], the condition of a stable system operation is given by , and is defined as the quantity of priority queues’ probability generating function waiting for picking at moment . We have , where denotes the probability distribution of the system state at moment . Through simplification, we can gain the probability generating function of the picking machine as follows:

3.3.2. Probability Generating Function in Picking Ordinary Orders

When the picking machines pick order i + 1 at moment t_n+1 under the exhaustive control strategy, the state transition equation of the DPS at moment t_n+1 is as follows: . Using the same method as Takagi [48], we have which denotes the quantity of ordinary queues’ probability generating function waiting for picking at moment . Since the orders arrive at each queue and wait in line based on the independent Poisson process, the service time provided by the picking machine for each order is independent from the others, and the system state variables’ probability generating function can be formulated as follows:where i = 1, 2,…, N.

The random variables of the time require the picking machines serving the orders with the exhaustive control strategy in the priority queue to follow a probability distribution , which is the same distribution and independent. Then, the probability distribution function can be obtained by calculatingwhere .

The first-order derivative of when is as follows:giving the following:

The second-order derivative of is as follows:

That is,

Solving the above equation gives the following:

3.4. The Characteristic Parameters of the System Generating Function Calculation

3.4.1. Mean Queue Length of Priority Orders (MQLPO)

MQLPO refers to the number of orders of queue j at moment , i.e., the average amount of the priority queue’s orders waiting for service in the buffer. First, by definition, the second-order partial derivatives of and are gained, accordingly, as follows:

Plugging equations (1), (2), (10), and (12), we have the following equation:where and . Then, we can obtain the MQLPO as follows:

3.4.2. Mean Cyclic Period (MCP)

The MCP refers to the statistical average time of the N+1 order to complete a picking action, which consists of the picking time and polling time. In this model, when the queue buffer is not entirely empty, the query conversion time can be saved, so a small mean cyclic period (MCP) can be obtained. According to the generating function of system state probability, we can obtain the following equation based on the relationship of the probability generating function:

Therefore, the MCP can be formulated as follows:

3.4.3. System Throughput (ST)

The ST refers to the number of finished orders in a unit time. The ST reflects the theoretical picking capability of the picking machine and can be expressed as follows:

3.4.4. Mean Queue Length of Ordinary Orders (MQLOO)

MQLOO refers to the mean queue length of the ordinary orders. To determine the MQLOO, first we can represent the generating function’s first-order partial derivatives as follows:

Plugging equations (1) and (2) into (17), we have the following equation:where , and and can be obtained by calculating . Then, we can then formulate MQLOO as follows:

3.4.5. Mean Waiting Time of Priority Orders (MWTPO) and Mean Waiting Time of Ordinary Orders (MWTOO)

MWTPO denotes the priority orders’ mean waiting time, and MWTOO denotes the ordinary orders’ mean waiting time. Let be the waiting time between orders being picked over those to be sent out, and let be the probability generating function; and are the average waiting time delays of the customers’ priority queues and ordinary queues, respectively.

Then, by using the same solving method of the MWT as in Takagi [48], exists. Then, we have the derivation , which refers to the average time which denotes the time interval between an order arriving at the queue i and finishing its picking service. Furthermore, we can obtain , which denotes the difference among the order VC queue’s arrival time and the unit time interval. According to , we can calculate MWTOO as follows:

By using the same MWT solving method as in Takagi [47], we first calculate the mean picking time of order arriving between moment t_n and t_m, as follows: . Then, we calculate the mean delivery time of order arriving between moment t_m and t_o, as follows: . According to , we can calculate MWTPO as follows:

4. Numerical Example and Discussion

4.1. Numerical Example

This section describes how to use the proposed polling systems in actual practice. To facilitate the numerical analysis, we use the order-picking operation of a logistics distribution centre as an example to illustrate the validity of the method.

There are some instructions for the numerical example, which are as follows: all order queues consist of two group orders of the same product, as shown in Table 1, where one group order is in the priority order queue and the other is in the ordinary order queue, as in an actual situation. The outer package of the unit material has a length of 290 mm, a width of 98 mm, and a height of 50 mm, and the order conveyor speed is 60 m/min; the picking speed per unit material is 3 seconds, the order switch time is 1.2 minutes, and the number of picking stations is 10. The computing process uses the same normalized parameters, which are , , and .

Table 1 provides the actual order structure data, supported by the Baisha logistics distribution centre. When the system is stable, then based on the “exhaustive parallel 1-limited” control strategy, we can calculate the characteristic parameters of the system generating function.

Table 2 shows the comparison of the numerical results using the data of Table 1, and we can find that the theoretical values are in close proximity to the actual values from the logistics distribution centre, thus indicating that the proposed “exhaustive and 1-limited” based polling model is valid.

Next, we use the proposed “exhaustive parallel 1-limited” based picking system for further numerical analysis, and the simulation results (Figures 2–6) and analysis are as follows.

(a)

(b)

(c)

(a)

(b)

(c)

(a)

(b)

(c)

(a)

(b)

(c)

(a)

(b)

(c)

Figure 2 shows the change trend between MQLPO and , wherein Figure 2(a) is based on the change in the priority orders’ queue quantity N, Figure 2(b) is based on the change in the picking time () of the priority orders’ queue, and Figure 2(c) is based on the change in the switching time () between priority orders’ queue and the other. As shown in Figure 2, when the other variables are fixed, the MQLPO of the order queue with larger variable (N//) increases sharply with the ’s growth compared to the other queues. In addition, if exceeds a certain threshold ( in (c)), the diversity of does not cause a significant difference in the MQLPO between the order queues.

Figure 3 shows the variation trend between MQLOO and , wherein Figure 3(a) is based on the change in the ordinary orders’ queue quantity N, Figure 3(b) is based on the change in the picking time of () the ordinary orders’ queue, and Figure 3(c) is based on the change in the switching time between the ordinary orders’ queue and another queue (). As shown in Figure 3, when the other variables are fixed, the MQLOO of the order queue with a larger variable (N//) increases sharply with the ’s growth compared to the other queues.

Comparing Figures 2 and 3, we find that with the increase in the variables (N, , ), the curves of MQLOO () and MQLPO () all become steeper, i.e., the curves of MQLOO () and MQLPO () with the larger variables (N//) have greater slopes as increases. Through further analysis, we also find that in the process of increasing , the MQLPO and MQLOO continue to grow, but the MQLPO maintains a small increase and steady change, and the MQLOO has a sudden increase, especially when the queues’ quantity is relatively large. This finding reveals that the MQL in ordinary orders is more sensitive to changes in compared to priority orders.

Figure 4 reveals the variation trend between MCP and , wherein Figure 4(a) is based on the change in the priority orders’ queue quantity N, Figure 4(b) is based on the change in the picking time () of the priority orders’ queue, and Figure 4(c) is based on the change in the switching time of the priority orders queue with different . As shown in Figure 4, when the other variables are fixed, the MCP of the order queue with the larger variable (N//) increases sharply with the ’s growth compared to the other queues.

Figure 5 represents the variation trend between MWTPO and , wherein Figure 5(a) is based on the change in the priority orders’ queue quantity N, Figure 5(b) is based on the change in the picking time () of the priority orders’ queue, and Figure 5(c) is based on the change in the switching time between the priority orders’ queue and other queues (). We can see from Figure 5 that under a stable system condition, the MWTPO increases in line with the value of the variable (N//). In addition, when the other variables are fixed, the MWTPO of the order queue with a larger variable (N//) increases sharply with ’s growth compared to the other queues.

Figure 6 demonstrates the variation trend between MWTOO and , wherein Figure 6(a) is based on the change in the ordinary orders’ queue quantity N, Figure 6(b) is based on the change in the picking time () of the ordinary orders’ queue, and Figure 6(c) is based on the change in the switching time between the ordinary orders’ queue and the other queues ().We can see from Figure 6 that under a stable system condition, the MWTOO increases in line with the value of the variable (N//). Furthermore, when the other variables are fixed, the MWTOO of the order queue with a larger variable (N//) increases sharply with the ’s growth compared to the other queues.

In Figures 5 and 6, we can see that with the increase of the variable (N//), the curves of MWTOO () and MWTPO () all become steeper. For example, from Figures 5(a) and 6(a), we can find that keeping all other variables constant, when N increases from 10 to 20, the curves of MWTPO as well as MWTOO become steeper. This result means that the MWTPO and MWTOO will grow fast with 's increase under a large variable (N//). Through further analysis, we also find that in the process of increasing , the MWTPO and MWTOO continue to grow, but MWTPO maintains a small increase and steady change, and MWTOO suddenly increases (compared to the curve of MWTPO (), the curve of MWTOO () has a greater slope as is increasing).

From Figures 2 to 6, we can find that with the increase of the variable (N//), the curves of MQLOO (), MQLPO (), MCP (), MWTOO (), and MWTPO () all become steeper. In addition, under a stable system condition, the MQLOO, MCP, and MWTOO of the ordinary picking stations increase nonlinearly with increasing station numbers and arrived orders; the MQLPO, MCP, and MWTPO of the priority picking stations decrease slightly. Through the above analysis, we find that the fewer the number of queues is, the smaller the MCP is, and the whole dynamic order-picking system is more stable and fast-responding.

4.2. Discussion

According to the numerical results, we find the below conclusions:(1)The numerical examples show that compared with the other polling system conditions, such as , , , and , the new model under the “exhaustive and 1-limited” service strategy system has a more stable performance for the condition . Therefore, stable operation of the proposed picking system needs to meet certain conditions, and distribution centre managers should reduce the picking time of one order and increase the picker’s efficiency of switching objects for decreasing the system load.(2)From the nature of the “exhaustive and 1-limited” polling system, we can find in a complete polling picking operation cycle of N + 1 queues, the priority order queues had N opportunities to be picked based on the “exhaustive” strategy, and each ordinary order queue had only one opportunity to be picked based on the “1-limited” strategy. Therefore, this makes the varieties of MQLPO and MWTPO far less than the varieties of MQLOO and MWTOO, which proves that the proposed picking system can ensure the picking priority of VIP orders to gain higher picking efficiency, while the N ordinary order queues only have one opportunity to be picked in each polling cycle, and this can avoid repeated picking and disorder in ordinary orders. Thus, the proposed picking system has a good picking ability.(3)The analysis of Figures 5 and 6 shows that increasing the variables (N//) will extend the MWT and MQL of the priority orders and common orders. This result suggests that the distribution centre should consider the time of order picking and the speed of picking machine switching between the picking objects, especially the number of picking stations. A large number of picking stations can provide more sorting channels for a variety of order queues; however, more picking stations will result in a rise of the mean waiting time towards the two types of orders. In addition, compared to ordinary order queues, the MWT of the priority order queues has less increases with the growth of . Therefore, the dynamic order-picking system has better robustness for priority orders. This suggests that the novel model can resolve a good deal of priority orders emerging in a short time while maintaining a stable order waiting time. This advantage can help e-commerce companies keep running during the peak periods of online shopping, such as China's “Singles Day” and “Black Friday” in the United States.(4)The ordinary order-picking system has fair service features, which is particularly important for a good picking system to trade off the difference of picking service between ordinary orders. Although an ordinary order queue has only one opportunity to be picked in ordinary order queue query cycles, the “1-limited” strategy is adequate to guarantee the equity of the ordinary order-picking service. Thus, the proposed picking system has better fairness, which shows that the new model can settle the priority challenge of VIP orders without overextending the waiting time for ordinary users, which is significant in maintaining customer loyalty for logistics enterprises.

5. Conclusions

In this study, we apply a polling system to analyse a DPS model considering priority orders. First, we divide the arrival orders into ordinary orders and priority orders. Priority orders refer to those orders that need priority processing, and ordinary orders refer to those orders that need not be processed immediately and have loose time windows. Correspondingly, we divide the picking machines into priority picking machines, under the 1-limited control strategy, and ordinary picking machines, under the exhaustive control strategy. A probability generating function is then established to analyse the system.

Our study extends the method and theory of the polling system in a dynamic order-picking model and contributes to the existing research in two aspects: First, the prior studies [11, 13] did not consider a situation in the presence of priority orders by using the polling system in picking models. However, we propose a polling-based picking model that not only emphasizes the service quality for VIP orders but also takes into account the efficiency in servicing ordinary orders. Second, we propose an “exhaustive parallel 1-limited” based dynamic order-picking model that combines the polling system, the probability generating function approach, and the Markov chain. The numerical analysis results reveal the practicality and effectiveness of the proposed approach.

In the end, this study has a number of limitations. For instance, there are various constraints for the proposed picking system, for example, the constraints of the order arrival process, the picking process, and the picking machine switching process. The generating function also changes correspondingly in line with the constraint change. Therefore, this may cause the problem-solving methods to be more complicated and cannot offer an effective solution. Hence, future work should pay more attention to relax the proposed polling picking system’s constraints so that it is more consistent with the actual situation. In addition, with regard to the proposed polling-based model, we use an approximate calculation and simulation experiment method to compute the system characteristic parameters, which may bring some inaccuracy to the order-picking result. At present, the common methods for solving the polling-based model are the buffer occupancy method, station-time method, descendant set method, embedded Markov chain method, mean value analysis method, and computer simulation method [49–51]. However, these methods can only solve the general polling-based model, such as the first- and second-order characteristic parameters. For the third-order characteristic parameters, due to the complexity of the calculation, only approximate solutions are obtained. Future research may consider focusing on the solution methods of the complex polling-based model to improve the calculation precision of the polling-based system parameters.

Data Availability

All relevant data are provided within the article.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This study was supported by the National Natural Science Foundation of China under project nos. 71661029, 71862035, and 71502159 and the Yunnan Fundamental Research Project under grant no. 2019FB085.

References

Y. S. Cheung, “Joint polling and contention based feedback algorithm to exploit multiuser diversity,” Journal of Communications, vol. 4, no. 5, pp. 348–356, 2009.
View at: Publisher Site | Google Scholar
J. M. Tarn, M. A. Razi, and H. J. Wen, “E‐fulfillment: the strategy and operational requirementsﬁllment: the strategy and operational requirements,” Logistics Information Management, vol. 16, no. 5, pp. 350–362, 2003.
View at: Publisher Site | Google Scholar
S. Perez and P. D. Wright, “In-store pickup and returns for a dual channel retailer,” Ieee Transactions on Engineering Management, vol. 64, no. 4, pp. 491–504, 2017.
View at: Publisher Site | Google Scholar
S. Moons, K. Ramaekers, A. Caris, and Y. Arda, “Integration of order picking and vehicle routing in a B2C e-commerce context,” Flexible Services and Manufacturing Journal, vol. 30, no. 4, pp. 813–843, 2018.
View at: Publisher Site | Google Scholar
J. I. U. Rubrico, T. Higashi, H. Ota, and J. Otad, “Online rescheduling of multiple picking agents for warehouse management,” Robotics and Computer-Integrated Manufacturing, vol. 27, no. 1, pp. 62–71, 2011.
View at: Publisher Site | Google Scholar
E. Ardjmand, H. Shakeri, M. Singh, and O. Sanei Bajgiran, “Minimizing order picking makespan with multiple pickers in a wave picking warehouse,” International Journal of Production Economics, vol. 206, pp. 169–183, 2018.
View at: Publisher Site | Google Scholar
G. Baruffaldi, R. Accorsi, and R. Manzini, “Warehouse management system customization and information availability in 3pl companies,” Industrial Management & Data Systems, vol. 119, no. 2, pp. 251–273, 2019.
View at: Publisher Site | Google Scholar
J. J. Bartholdi and S. T. Hackman, “Warehouse & distribution science release,” Industrial Management & Data Systems, vol. 94, 2011.
View at: Google Scholar
D. Fussler and N. Boysen, “Efficient order processing in an inverse order picking system,” Computers & Operations Research, vol. 88, pp. 150–160, 2017.
View at: Google Scholar
Y.-C. Ho and J.-W. Lin, “Improving order-picking performance by converting a sequential zone-picking line into a zone-picking network,” Computers & Industrial Engineering, vol. 113, pp. 241–255, 2017.
View at: Publisher Site | Google Scholar
Y. Gong and R. De Koster, “A polling-based dynamic order picking system for online retailers,” IIE Transactions, vol. 40, no. 11, pp. 1070–1082, 2008.
View at: Publisher Site | Google Scholar
J. R. Otto and Q. B. Chung, “A framework for cyber-enhanced retailing: integrating E-commerce retailing with brick-and-mortar retailing,” Electronic Markets, vol. 10, no. 3, pp. 185–191, 2000.
View at: Google Scholar
Y. Gong, E. Winands, and R. D. Koster, “A real-time picking and sorting system in e-commerce distribution centers,” Electronic Markets, vol. 10, 2012.
View at: Google Scholar
P. J. Xu, R. Allgor, and S. C. Graves, “Benefits of Reevaluating Real-Time Order Fulfillment Decisionsﬁts of reevaluating real-time order fulﬁllment decisions,” Manufacturing & Service Operations Management, vol. 11, no. 2, pp. 340–355, 2009.
View at: Publisher Site | Google Scholar
B.-I. Kim, S. S. Heragu, R. J. Graves, and A. Onge, “Realization of a short cycle time in warehouse replenishment and order picking,” International Journal of Production Research, vol. 41, no. 2, pp. 349–364, 2003.
View at: Publisher Site | Google Scholar
T. Le-Duc and R. M. B. M. de Koster, “Travel time estimation and order batching in a 2-block warehouse,” European Journal of Operational Research, vol. 176, no. 1, pp. 374–388, 2007.
View at: Publisher Site | Google Scholar
D. Claeys, I. Adan, and O. Boxma, “Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations,” European Journal of Operational Research, vol. 254, no. 3, pp. 895–906, 2016.
View at: Publisher Site | Google Scholar
R. De Koster, T. Le-Duc, and K. J. Roodbergen, “Design and control of warehouse order picking: a literature review,” European Journal of Operational Research, vol. 182, no. 2, pp. 481–501, 2007.
View at: Publisher Site | Google Scholar
J. Gu, M. Goetschalckx, and L. F. Mcginnis, “Research on warehouse design and performance evaluation: a comprehensive review,” European Journal of Operational Research, vol. 203, no. 3, pp. 539–549, 2010.
View at: Publisher Site | Google Scholar
W. Lu, D. Mcfarlane, V. Giannikas, and Q. Zhang, “An algorithm for dynamic order-picking in warehouse operations,” European Journal of Operational Research, vol. 203, 2015.
View at: Google Scholar
R. De Koster, “Performance approximation of pick-to-belt orderpicking systems,” European Journal of Operational Research, vol. 72, no. 3, pp. 558–573, 1994.
View at: Publisher Site | Google Scholar
J. C.-H. Pan and M.-H. Wu, “A study of storage assignment problem for an order picking line in a pick-and-pass warehousing system,” Computers & Industrial Engineering, vol. 57, no. 1, pp. 261–268, 2009.
View at: Publisher Site | Google Scholar
R. Manzini, R. Accorsi, M. Gamberi, and S. Penazzi, “Modeling class-based storage assignment over life cycle picking patterns,” International Journal of Production Economics, vol. 203, 2015.
View at: Google Scholar
E. Atmaca and A. Ozturk, “Defining order picking policy: a storage assignment model and a simulated annealing solution in AS/RS systems,” Applied Mathematical Modelling, vol. 37, no. 7, pp. 5069–5079, 2013.
View at: Publisher Site | Google Scholar
D. Battini, M. Calzavara, A. Persona, and F. Sgarbossa, “Order picking system design: the storage assignment and travel distance estimation (SA&TDE) joint method,” International Journal of Production Research, vol. 53, no. 4, pp. 1077–1093, 2015.
View at: Publisher Site | Google Scholar
F. Guerriero, O. Pisacane, and F. Rende, “Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints,” Applied Mathematical Modelling, vol. 39, no. 23-24, pp. 7375–7389, 2015.
View at: Publisher Site | Google Scholar
J. Won and S. Olafsson, “Joint order batching and order picking in warehouse operations,” International Journal of Production Research, vol. 43, no. 7, pp. 1427–1442, 2005.
View at: Publisher Site | Google Scholar
L. Tang and H. Gong, “A hybrid two-stage transportation and batch scheduling problem,” Applied Mathematical Modelling, vol. 32, no. 12, pp. 2467–2479, 2008.
View at: Publisher Site | Google Scholar
R. W. Grubbström, “Dynamic lotsizing with a finite production rate,” International Journal of Production Economics, vol. 149, no. 3, pp. 68–79, 2014.
View at: Publisher Site | Google Scholar
V. I. Nieuwenhuyse and R. B. M. D. Koster, “Evaluating order throughput time in 2-block warehouses with time window batching,” International Journal of Production Economics, vol. 121, no. 2, pp. 654–664, 2009.
View at: Google Scholar
C. Theys, O. Bräysy, W. Dullaert, and B. Raa, “Using a TSP heuristic for routing order pickers in warehouses,” European Journal of Operational Research, vol. 200, no. 3, pp. 755–763, 2010.
View at: Publisher Site | Google Scholar
S. Rath and W. J. Gutjahr, “A math-heuristic for the warehouse location-routing problem in disaster relief,” Computers & Operations Research, vol. 42, pp. 25–39, 2014.
View at: Publisher Site | Google Scholar
C. Chackelson, A. Errasti, D. Ciprés, and F. Lahoz, “Evaluating order picking performance trade-offs by configuring main operating strategies in a retail distributor: a Design of Experiments approach,” International Journal of Production Research, vol. 51, no. 20, pp. 6097–6109, 2013.
View at: Publisher Site | Google Scholar
E. H. Grosse and C. H. Glock, “The effect of worker learning on manual order picking processes,” International Journal of Production Economics, vol. 51, 2014.
View at: Google Scholar
S. Hong, “Two-worker blocking congestion model with walk speed m in a no-passing circular passage system,” European Journal of Operational Research, vol. 235, no. 3, pp. 687–696, 2014.
View at: Publisher Site | Google Scholar
P. H. P. Yeow and D. T. Goomas, “Ergonomics improvement in order selection in a refrigerated environment,” Human Factors & Ergonomics in Manufacturing & Service Industries, vol. 24, no. 3, pp. 262–274, 2014.
View at: Google Scholar
T. Van Gils, A. Caris, K. Ramaekers, K. Braekers, and R. B. M. De Koster, “Designing efficient order picking systems: the effect of real-life features on the relationship among planning problems,” Transportation Research Part E-Logistics and Transportation Review, vol. 125, pp. 47–73, 2019.
View at: Google Scholar
E. H. Grosse, C. H. Glock, and M. Y. Jaber, “The effect of worker learning and forgetting on storage reassignment decisions in order picking systems,” Computers & Industrial Engineering, vol. 66, no. 4, pp. 653–662, 2013.
View at: Publisher Site | Google Scholar
E. H. Grosse, C. H. Glock, M. Y. Jaber, and W. P. Neumann, “Incorporating human factors in order picking planning models: framework and research opportunities,” International Journal of Production Research, vol. 53, no. 3, pp. 695–717, 2014.
View at: Publisher Site | Google Scholar
M. M. Srinivasan, “Nondeterministic polling systems,” Management Science, vol. 37, no. 6, pp. 667–681, 1991.
View at: Publisher Site | Google Scholar
Y. A. Bozer and J. H. Park, “Expectedmove request waiting times in single-device, polling-basedmaterial handling systems,” IIE Transactions, vol. 33, no. 5, pp. 55–63, 1999.
View at: Google Scholar
D. Xu, N. Shi, and R. K. Cheung, “Heavy traffic analysis of a single vehicle loop in an automated storage and retrieval systemﬁc analysis of a single vehicle loop in an automated storage and retrieval system,” OR Spectrum, vol. 29, no. 3, pp. 489–512, 2007.
View at: Publisher Site | Google Scholar
P. Piccinini, R. Gamberini, A. Prati, B. Rimini, and R. Cucchiara, “An automated picking workstation for healthcare applications,” Computers & Industrial Engineering, vol. 64, no. 2, pp. 653–668, 2013.
View at: Publisher Site | Google Scholar
I. Eliazar, “Gated polling systems with Levy inflow and inter-dependent switchover times: a dynamical-systems approach,” Queueing Systems, vol. 49, no. 1, pp. 49–72, 2005.
View at: Publisher Site | Google Scholar
K. K. Leung, “Cyclic-service systems with nonpreemptive, time-limited service,” IEEE Transactions on Communications, vol. 42, no. 8, pp. 2521–2524, 1994.
View at: Publisher Site | Google Scholar
O. Boxma, J. Bruin, and B. Fralix, “Sojourn times in polling systems with various service disciplines,” Performance Evaluation, vol. 66, no. 5, pp. 621–639, 2009.
View at: Publisher Site | Google Scholar
H. Takagi, “Queuing analysis of polling models,” ACM Computing Surveys (CSUR), vol. 20, no. 1, pp. 5–28, 1988.
View at: Publisher Site | Google Scholar
H. Takagi, “Mean message waiting times in symmetric multi-queue systems with cyclic service,” Performance Evaluation, vol. 5, no. 4, pp. 271–277, 1985.
View at: Publisher Site | Google Scholar
N. Chernova, S. Foss, and B. Kim, “A polling system whose stability region depends on the whole distribution of service times,” Operations Research Letters, vol. 41, no. 2, pp. 188–190, 2013.
View at: Publisher Site | Google Scholar
J.-P. L. Dorsman, S. C. Borst, O. J. Boxma, and M. Vlasiou, “Markovian polling systems with an application to wireless random-access networks,” Performance Evaluation, vol. 41, 2015.
View at: Google Scholar
Z. Liu, Y. Chu, and J. Wu, “Heavy-traffic asymptotics of a priority polling system with threshold service policy,” Computers & Operations Research, vol. 65, pp. 19–28, 2016.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2020 Wenxue Ran et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

1186

Downloads

1012

Citations