Nothing Special   »   [go: up one dir, main page]
Next Article in Journal
Obtaining Information about Operation of Centrifugal Compressor from Pressure by Combining EEMD and IMFE
Previous Article in Journal
Fractional-Order Chaotic Memory with Wideband Constant Phase Elements
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Entropy
Volume 22
Issue 4
10.3390/e22040423
entropy-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles thumb_up
...
Endorse textsms
...
Comment
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Sensitivity Analysis of Selected Parameters in the Order Picking Process Simulation Model, with Randomly Generated Orders

by
Mariusz Kostrzewski
Faculty of Transport, Warsaw University of Technology, Koszykowa 75, 00-662 Warszawa, Poland
Entropy 2020, 22(4), 423; https://doi.org/10.3390/e22040423
Submission received: 11 March 2020 / Revised: 6 April 2020 / Accepted: 7 April 2020 / Published: 9 April 2020
Browse Figures
Graphical abstract
"> Figure 1
<p>The changes in the order picking process time in case of the analyzed sample, with the indication of the number of items picked per order of <span class="html-italic">j</span>th number.</p> "> Figure 2
<p>Execution of 100 picking lists for data sample, given in function <math display="inline"><semantics> <mrow> <mi>f</mi> <mo>=</mo> <mi>f</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> in the case of total order picking process time (<span class="html-italic">t</span>).</p> "> Figure 3
<p>Execution of 100 picking lists for data sample, given in function <math display="inline"><semantics> <mrow> <mi>f</mi> <mo>=</mo> <mi>f</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> in the case of the average value of order picking process time.</p> "> Figure 4
<p>Execution of 100 picking lists per data sample, given in function <math display="inline"><semantics> <mrow> <mi>f</mi> <mo>=</mo> <mi>f</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> in the case of the average value of order picking process time—part of the plot (the maximum value on <math display="inline"><semantics> <mrow> <mover accent="true"> <mrow> <mi>t</mi> <mrow> <mo>(</mo> <mrow> <mi>P</mi> <mi>S</mi> </mrow> <mo>)</mo> </mrow> </mrow> <mo stretchy="true">¯</mo> </mover> </mrow> </semantics></math> axis would be almost 60 min).</p> ">
Versions Notes

Abstract

:
Sensitivity analysis of selected parameters in simulation models of logistics facilities is one of the key aspects in functioning of self-conscious and efficient management. In order to develop simulation models adequate of real logistics facilities’ processes, it is important to input actual data connected to material flows on entry to models, whereas most models assume unified load units as default. To provide such data, pseudorandom number generators (PRNGs) are used. The original generator described in the paper was employed in order to generate picking lists for order picking process (OPP). This ensures building a hypothetical, yet close to reality process in terms of unpredictable customers’ orders. Models with applied PRNGs ensure more detailed and more understandable representation of OPPs in comparison to analytical models. Therefore, the author’s motivation was to present the original model as a tool for enterprises’ managers who might control OPP, devices and means of transport employed therein. The outcomes and implications of the contribution are connected to presentation of selected possibilities in OPP analyses, which might be developed and solved within the model. The presented model has some limitations. One of them is assumption that one mean of transport per one aisle is taken into consideration. Another limitation is the indirectly randomization of certain model’s parameters.

Graphical Abstract">

Graphical Abstract

1. Introduction

The introduction of the paper consists of three interrelated parts. At first, the significance of the order picking process was described. Secondly, prior research on the order picking process was identified. Thirdly, comprehensive discussion on the use of simulation approach for order picking is provided and objectives of the paper are defined.

1.1. Significance of Order Picking Process

An order picking process is considered as one of the most important research interests in the field of internal logistics. This is due to the fact that an order picking process engages most of the resources of all processes taken in logistics facilities, as confirmed in Alicke et al. (2001) and Ulbrich et al. (2016) [1,2]. Moreover, this process is considered to be the most time consuming, as it is given in Lu et al. (2016) and Roodberger and de Koster (2001) [3,4], and at the same time highly cost consuming. Chiang et al. (2011) in [5] estimated the cost of order picking—the authors of this study stated that the costs incurred during order picking processes vary from 55% to 75% of total cost for all logistics processes in logistics facilities (also in Kostrzewski 2014 and Drury 1988 [6,7]). In turn, Gałązka and Jakubiak (2010) [8] reported that these costs are estimated in the range of 55%–65% in comparison to the mentioned total cost. Other authors estimated the costs of order picking compared to a total operating cost in a warehouse at the level of 55% [9,10,11,12], 60% [7], 65% [13] and even 60%–70% according to [14]. These values are within the ranges mentioned above. On the other hand, Daly (1993) in [15] stated that the order picking process consumes 60% of labor intensity out of all processes in a logistics facility, such as a warehouse. The order picking process was also analyzed as the costliest warehouse activity in Marchet et al. (2015) [16] According to the research data stated above, over the years, the costs incurred during order picking process still fluctuate around half to three quarters of the total operating costs incurred for all logistics processes occurring in a warehouse (the quoted data date from the second half of 80s of the previous century—[7], and the last study cited in this paper that concerns of such extreme values was published in 2011—[5]). On the one hand, it could be argued that either the reduction of these costs is difficult in actual conditions, or that the changes proposed by various researchers are not implemented. On the other hand, further research on this subject matter is necessary, with the aim of the continuous and multi-faceted improvement of said process, particularly given that, according to Wruck et al. (2017) [17] (quoted in van Gils et al. 2018 [18]), high labor cost in the case of order picking processes may be treated as one of many results for the underperformance of logistics systems and as a consequence may lead to customers’ demands not being met.

1.2. Prior Research on Order Picking Process

The thematic scope of scientifically compiled studies on the order picking process is very broad. Various researchers deal with studies of the mentioned process connected to e.g., strategies used to achieve an efficient order picking process (e.g., [8,19]), cost estimation based on highly detailed and hierarchical analytical or numerical models, and the reduction of the duration of these processes (or indirectly, reduction of the travel distance between picking points, as in: [3,20,21,22]). The optimization or sub-optimization of the order picking process, achieved through the use of accurate methods of operational research or as a result of the implementation of heuristic methods, is also one of the topics that researchers take into consideration in the scientific literature. Numerous publications deal with issues related to analyses of logistics and transport processes in logistics facilities such as warehouses. For example, in [23], Chew and Tang (1999) analyzed time of freight transport process in a warehouse. They, as many other researchers, also took into consideration an order picking process. They applied queue theory and suggested arrangement of picking area in such manner, so that load units’ allocation was arranged for customers with similar expectations for ordered products. Transformations of the proposed model, designed for a single down-aisle, were presented in Le-Duc and de Koster (2007) [24]. The authors implemented this model for the full route of means of transport, as part of a picking operation. In [23], Chew and Tang (1999) examined a monobloc warehouse, i.e., without taking into account a transverse corridor between two blocks consisting of rows of racks situated in parallel to each other. In [24], Le-Duc and de Koster (2007) introduced a transverse corridor and analyzed two-block type of warehouse. An interesting new layout problem called “discrete cross aisle warehouse design” is addressed in Öztürkog et al. (2019) [25]—authors developed a new warehouse layout that ensures the travel distance reduction for an order picking process. Authors proved, that in comparison to traditional two-block layouts, the new one provides 7% savings in travelling length, on average, in the case of the order picking process. The issues of estimation of order picking process time and the attempt to reduce it, apart from the aforementioned research, were dealt with in Gibson and Sharp (1992) [26], where authors took into account the ABC analysis as one of the stock management methods applied in a warehouse. Many other authors attempted to reduce order picking process time, such as Davarzani and Norrman (2015) [27] and Tompkins et al. (2010) [9]. Davarzani and Norrman (2015) in [27] presented a wide range of order picking solutions, investigated both in practice and theory, and they mentioned researchers who have shown cost and time efficiency of employing these particular solutions for warehousing technologies (Chow et al. 2006 [28]). Tompkins et al. (2010) defined order picking costs as 55% of total warehouse operating costs in [9]. Numerous other researchers also investigated these areas of interests. Therefore, it can be stated that the subject matter of the order picking process continues to be an issue of high interest. It is because this topic is still not sufficiently researched. Order picking is one of the most complicated processes occurring in logistics facilities, and that is why it requires ongoing research, continuous process optimization, etc. Moreover, it is a very complex process. It is not without reason that a vast amount of research has been devoted to this aspect and the topic is still being exploited, even if only a few of articles representing this subject are mentioned in this contribution (a more extensive discussion of this subject matter is provided in the next paragraph). In addition, it has been recognized in House and Karrenbauer (1978) [29] (p. 192), that time is the only variable that can be used to describe a logistics system. The authors added that in the past, logisticians have described systems as a function of distance, but over time it became obvious that distances were attributes not homogeneous enough within the logistics networks. The author of this paper is not of the opinion that time should be considered as the only variable that can serve to describe the logistics system, but as one of the more important ones. However, the importance of this kind of variable is proven by van Gils et al. (2018) [18], who stated that the order picking process time is a performance indicator in more than 73% of references analyzed by themselves, overcoming indicators from other groups such as cost, productivity and service (according to van Gils et al. (2018) [18], this classification was distinguished by Staudt et al. 2015 [30]).
As the classical way of order picking modeling shows (Fijałkowski 1995 [31]), calculations obtained with the use of analytical models, and in particular analytical models concerning order picking processes, are most often carried out on the basis of a predetermined structure of orders (averaged quantities of lines in a picking list and quantities of items to pick per one line are treated as non-variant, constant values, unique and unambiguous in the scale of the whole picking system). Yet, in real conditions, there is a significant variation in both the quantities of items per line in each order (further in the paper this parameter is noted as p i j —each time, subscript j is designated to a consecutive number of experiment in a sample, and subscript i is designated to the quantities of items), and the varied range of items to pick (later in the paper this parameter is noted as w j ). In comparison to the referenced simulation models the author’s approach to generation of order picking lists is more detailed and thus more adequate to actual conditions. Three main ways of picking lists generation were identified in the literature: generalized random picking lists, uniform distribution picking lists and picking list based on historic data. The list of research papers in which these different approaches were identified is synthetized in Table 1 (other ways of picking lists generation were also mentioned in the last row of Table 1). The performed analysis shows, that the application of generalized random picking lists (e.g., based on the Monte Carlo simulation method) was evidently applying pseudorandom number generators (PRNG), or there is no clear indication of how a particular random picking list was achieved. This means that, in the case of several elaborations mentioned in Table 1, ‘random’ is not specified as such, therefore the author of this paper assumes the application of particular PRNG built-in software in the referred research. When uniform distribution picking lists were identified in literature, a picking list with such uniform distribution was mentioned in the certain research. The last group of historical picking lists; particular picking lists were compiled on the basis of actual data collected from entrepreneurs, who, the author assumes, agreed to collaborate with mentioned researchers during their research. Table 1 clarifies three different approaches to generating order picking lists. Previous research showed that for uniform distribution generators, the results are repetitive [32]. Meanwhile, Karkula (2013) [33] (p. 70) stated that uniform distribution is applied as default to generate pseudorandom numbers, which is key information resulting from the literature review.
As a result of the literature review presented in Table 1, it can be stated that the majority of the reviewed research was applied with the use of a unified distribution picking list (as was speculated in [33]), together with a generalized random picking list. Numerous researchers mentioned that random numbers are used for picking lists generated in their research. Those who did not apply either probability distribution or the pseudorandom numbers generator applied historical data obtained from real-world logistics facilities. However, it is worth pointing out that it is not always possible to obtain data from real-world systems (which mostly results in trade secrets’ procedures). Therefore, the author of the paper, in his research, decided to face the up-to-date problem of order picking, namely the development of a hypothetical simulation model, in order to describe it in the most realistic way possible, with taking into consideration the actual, unpredictable size of picking orders.
In the paper, as a result of employing simulation methods to model order picking processes, the interdependence of physical objects (infrastructural and moveable) in a particular warehouse system is presented. In addition, the sensitivity of this system’s operating parameters to changes within the system is considered. Moreover, the impact of these changes on the achievement of objectives of the system operations is presented. These changes are understood in particular as: means of transport failures or stoppages, human factor problems, variability of picking lists, etc. The author assumed that this type of sensitivity was assessed on the basis of values obtained during the order picking process duration analysis.
As mentioned above, the research discussed in this paper was carried out using simulation methods. Discussion on the potential of using simulation methods and tools to build simulation models can be found in [32,33,100,101], among many others. Therefore, discussion on the mentioned potential and tools is omitted in this paper, especially since it is a matter of modeling and simulation theory, of which the description would require a very long dispute. It is not without a reason that books devoted to the theory of simulation, which is implemented into the research in this article, are quoted here [32,33,101], indicating only a few of them (since there are numerous publications on the topic). It is important, however, to emphasize the fact that the simulation model discussed in this paper is a stochastic model. In case of stochastic models, the random variables that influence mechanisms involved in the implementation of logistics processes are of great importance. It is not possible to detect a linear pattern of event occurrences in the processes in this particular simulation model. An important element in the construction of such a model is the selection of a suitable generator of pseudorandom values. The choice of the PRNG, which was used in the presented research, was preceded by numerous experiments with the application of different PRNGs, based on selected probabilistic distributions (mentioned in Table 1). These experiments were discussed in previous publications [32,102,103].

1.3. Objectives of the Research

There are several objectives of the research and the paper that correspond to each other. First of all, it is the literature review which aims at determining the importance of order picking processes’ consideration, in particular the implementation of these processes in the form of simulation models of hypothetical warehouses, reflecting real-world warehouses. Secondly, the research contributes to verifying the applicability of a selected pseudorandom number generator (PRNG) in the simulation model, in order to reflect real-world processes in said simulation model. To be more specific, PRNG is used to give a stochastic character to the processes that are reflected in the form of a simulation model for analyses of the order picking process in a high-bay warehouse. A discussion on PRNGs can be found e.g., in: [101] (according to best knowledge of this paper’s author, PRNGs in connection to order picking process analyses and research are not often published—the only paper found in the Science Direct scientific database was the paper [102]—accessed in February 2020). The stochastic character of several variables used in the simulation model in this paper is given in each subsequent simulation experiment. The above-mentioned variability is subjected to order picking parameters, including: the number of lines (rows) in the picking orders’ list (in short: picking list) and the quantity of items (products of one type) to pick. Thirdly, selected parameters that are generated based on a particular PRNG are analyzed in the aspect of sensitivity of selected parameters of a simulation model (these selected parameters are connected to the randomness of a simulation model). Therefore, the whole research is guided by one generalized, basic objective of research, which is stated as follows: modelling of an order picking process in a hypothetical logistics system that reflect real-world ones.
The subsequent sections discuss the following topics. Section 2 discusses the simulation model based on an analytical (conceptual) model. Author of this paper explains how the individual components of an analytical model are reflected in a simulation model. Subsequently, a problem of verification and validation of a simulation model used in the research is described in Section 3. PRNGs are applied in order to emphasize the stochastic nature of a simulation model, dedicated to the analysis of an order picking process in a high-bay warehouse. Stochastic character is assigned to variables in each subsequent simulation experiment. These variables include quantities of items to pick and numbers of rows in picking lists, per se. Thus, Section 5 deals with the use of the best matched PRNG in the analysis of sensitivity of operating parameters in the hypothetical logistics system which is under consideration herein. The last section consists of a summary and suggestions for further research on discussed issues.

2. Conceptual and Simulation Models

Simulation models are used when it is not possible, or it would be difficult to obtain, an analytical solution to a certain investigated problem, or when a comparison of analytical and simulation solutions is recommended. The latter applies to this research. The procedure for the use of simulation methods in warehouse design and research is described in [32,104], and therefore it is omitted in this contribution. The basic contents of simulation theory are also omitted. These include the main simulation types, advantages and disadvantages of simulation methods’ (and models’) implementation and other aspects of simulation modeling, which can be found e.g., in [32,33,104]. The aforementioned aspects of simulation methods and theory are omitted in the paper due to the fact that these are topics which are already extensively described in literature.
The simulation model discussed in this paper was developed in accordance with the Discrete Event System Specification (DEVS) within the Plant Simulation software. The DEVS structure is defined in [101]. The means of transport that is used here is EKX_515k, an electric three-way stock-picker lift-truck [105]. Therefore, the order picking system researched here deals with a picker-to-parts type of system. A picker-to-parts system is understood as one in which order picker travels along an aisle in order to retrieve parts/products/units/entities. In over 80% of logistics facilities in Western Europe, where order picking processes take place, these processes are carried out by employees [12]; meanwhile, the scientific literature is more focused on picking with the use of AS/RS (the acronym stands for an automated storage and retrieval system), AVS/RS (the acronym stands for an autonomous vehicle storage and retrieval system) systems [12]. The latter kind of system is used in large majority of logistics facilities in Western Europe [12,16]—therefore, it also needs to be properly analyzed by researchers.
The simulation model that was built for the research allows one to generate 100 picking lists per each simulation model execution. The number of lines in each picking order reaches the scope of w j = 1 ÷ 10, and the quantities of items to pick (per line) are within the scope of p i j = 1 ÷ 10. In general, in comparison to literature, e.g., [74], the number of customer orders is fixed to 100, whereupon the quantities of items per order is distributed uniformly over the set {1, 2, …, 10}. Picking lists are generated as a result of the initiation of the Generate orders procedure. The procedure inputs picking lists into the Orders table, which contains all of the orders, the quantities of the items ( p i j ) per line in each of the hundred orders, and the varied range of items ( w j ). In order to generate quantities of items per single order line, the adequate transformation of the logistics map (the origins of which are in chaos theory) into PRNG was proposed. The construction of the simulation model is preceded by a description of a conceptual model, which is based on aforementioned analytical relationships (analytical model).
The core equation of the simulation model is converted and redefined the logistic differential equation, which is discussed in [32]. The elements of both analytical (or conceptual, which is based on the analytical model) and simulation models are presented and discussed in the paper. A description of the models requires an input of the following parameters. Each time, subscript/parameter j is designated to the consecutive number of an experiment in a sample, and subscript/parameter i is designated to the quantities of items. Some elements of the investigated analytical model were presented in [104] and the full model was given in [32]. Since the language of these two publications is Polish, the author considers them worth quoting and briefly describing in this paper.
In this paper, the problem is discussed on the example of a pseudorandom number generator, in which a discrete equivalent of logistic differential equation is applied. The logistic differential equation is known as the simplest model of chaos. In Gutenbaum (2003) [106] (p. 96), it was found that relatively simple, strongly nonlinear deterministic differential equations are good models of some complex dynamic processes. In addition, it was noted that this type of mathematical equation, within a certain range of initial conditions and coefficients, allows one to obtain solutions with features of random processes. Processes of this type are qualified as chaos, in fact deterministic chaos, and their scientific basis derives from hydrodynamic flow studies in meteorology; Lorenz (1963) [107]. Deterministic chaos usually refers to nonlinear deterministic differential equations describing dynamic systems. It is understood as an irregular motion derived from a nonlinear system, in which dynamics uniquely determine the evolution of a system in time if the system’s history is known, and the real causes of irregularities are the characteristics of nonlinear systems, which are the exponential divergence of initially close trajectories in a limited area of a phase space; Schuster (1993) [108].
The solution of the logistic differential equation resembles a random sequence which can be used successfully in order to generate random numbers. The equation is defined in [106] (p. 96), and given here under discussion is Equation (1).
y j = α · ( a − y j − 1 ) · y j − 1 ;   j = 1 , J ¯
where: α —coefficient of growth that vary as α ∈ 0 ; 4 , a —state of saturation, y j —value at jth iteration step (e.g., population increase in biology or material flow increase in logistics)—it is a number between zero and one that represents the ratio of current size of the material flow to the maximum possible volume of material flow. This equation, also known as logistic mapping, is a modification of the linear function y j = α · y j − 1 . Element ( a − y j − 1 ) maintains consecutive values in the iteration of a jth step in the form of a decimal fraction in the range ( 0 ; 1 〉 (when a = 1 then y j ∈ ( 0 ; 1 〉 ). This equation is called an iterative (iterated function), since a result from a previous step is necessary to obtain a result in a following step. The logistic representation is thus characterized by a feedback loop. Its differential form can be described by the differential equation of the form y ˙ = f ( y ) , given here as Equation (2).
d y d t = α · ( a − y ) · y
As a result of using Equation (1) for successive values of the growth coefficient α , attractors are obtained, which draw subsequent elements of the yj series (as the value of α attractors increases more and more often, they accept bifurcation values). At α < 1, the attractor is a point and is equal to 0. At 1 < α < 3, the attractor is a point and is equal to 1 − 1 α . In turn, for α = 3, the fixed point loses stability and the bifurcation of the value yj starts, while above orbit loses stability, and for higher values of α than α = 1 + 6 , bifurcation is multiplied. In the case of the value α = 4, the structure becomes chaotic, and the so-called strange attractor covers the whole range of values y j ∈ ( 0 ; 1 〉 , which strengthens the randomness of the obtained results. Therefore, for the purposes of this research, α = 4 was assumed. To adjust the form of the equation to this research, it is modified in accordance with the relationship indicated as the converted and redefined logistic differential equation given later in the paper.
The author assumes that W (Equation (3)) is the set of numbers of rows in the picking list, where j is the number of experiments in the one hundred-element sample test, and w j is the number of rows in the picking list in the case of a jth experiment in the sample (one experiment is understood here as the realization of an order picking process for one picking list). In the simulation model, parameter w j is the cardinality of picked items p i j of ith type in jth experiment, in cases where values of p i j are greater than zero.
W = { w 1 , … , w j , … , w J } ;   w j = c o u n t ( p i j | p i j > 0 ) ;   j = 1 , J ¯ ;   i = 1 , I ¯ ;   w j ∈ N + + { 0 }
P is the set of quantities of items to pick. The notation for this set is given as Equation (4). It is a stochastic value X ( e p ) , generated according to the PRNG, described in detail in the following section. In the case of implementation of the analytical model, the average value of all quantities of picked items in jth experiment p j ¯ should be used, as in Equation (5), where p j ¯ is an average value of p i j . In the implementation of the simulation model, it is not necessary to use p j ¯ , since construction of the simulation model allows the use of plain p i j .
P = { p 11 , … , p i j , … , p I J } ;   p i j = X ( e p ) ;   j = 1 , J ¯ ;   i = 1 , I ¯ ;   p i j ∈ N + + { 0 }
p j ¯ = E ( p 11 , … , p i j , … , p I J ) ;   j = 1 , J ¯ ;   i = 1 , I ¯
In the simulation model, the transformation of the logistics map (defined in [32]) is used as PRNG for p i j estimation (Equation (4)). This transformation is presented in the paper as converted and redefined logistic differential equation—Equation (6). Parameter of type p i j * accepts decimal values in Equation (6) and moreover p i j * < 1 , thus a multiplier by 10 is entered to obtain p i j according to the structure of the experiment, that is: p i j ∈ 〈 0 ; 10 〉 , p i j ∈ N + + { 0 } . It should be stressed that the random numbers p i j * are merged into a fraction located in the interval between 0 and 1. In Karkula (2013) [33] (p. 70), it is stated that uniform distribution is the basic distribution used to generate pseudorandom numbers of other distributions (the algorithm for generating an uniform random number between 0 and 1 is described in L’Ecuyer (1988) [109]).
p i j = X ( e p ) = ⎡ 10 · 4 · ( 1 − p ( i − 1 ) ( j − 1 ) * ) · p ( i − 1 ) ( j − 1 ) * ⎤ ;   p 11 * ∈ ( 0 ; 1 〉 ;   j = 1 , J ¯ ;   i = 1 , I ¯
The set T E X of order picking process times is given as Equation (7). It is a set of elements t ( j , w j , p j ¯ , E X ) described on the set of positive real numbers, where EX means that the analytical model is implemented in MS Excel software. This model is based on the classical approach of order picking process time calculation [31], given as Equation (8). The parameters used in this equation are as follows:
  • mean value of lift-truck acceleration or stop, A;
  • length of a rack in warehouse, L;
  • mean time of lift-truck driving forward or backward (with lowered cabin and forks), F 1 ;
  • mean time of lift-truck driving forward or backward (with lifted cabin and forks), F 3 ;
  • rack height (from the ground to the bottom of the highest rack storey), H ;
  • free lift of forks, h 2 ;
  • medium value of load unit lifting up time, U ;
  • medium value of load unit lowering time, D ;
  • mean time of lift-truck fork ejection or rotation, N;
  • time of picking list reading by employee, t p r o ;
  • time of reading the next row in a picking list, t r o ;
  • time of single item picking, t p l .
    T E X = { t ( 1 , w 1 , p 1 ¯ , E X ) , … , t ( j , w j , p j ¯ , E X ) , … , t ( J , w J , p J ¯ , E X ) } ;   j = 1 , J ¯ ; t ( j , w j , p j ¯ , E X ) ∈ T E X → ℜ +
    ∀ p i j ∈ P   ∀ w j ∈ W   ∀ j ∈ 1 , J ¯     ∀ i ∈ 1 , I ¯ :   t ( j , w j , p j ¯ , E X ) = ( w j + 1 ) · A + L · ( F 1 + F 3 ) + ( n · H + h 2 ) · ( U + D ) + 6 · N + t p r o + w j · ( t r o + p j ¯ · t p l )
The set T P S of order picking process time is given here as Equation (9). It is a set of elements t ( j , w j , p 1 j , … , p i j , … , p I j , f , M T T R , P S ) , described on a set of positive real numbers, where: p 1 j , … , p i j , … , p I j correspond to quantities of items of ith types picked in jth experiment. The parameter f is an estimated percentage of simulation time, during which a mean of transport failure may occur, or a time when a mean of transport is fully incapable for work. The parameter MTTR stands for a mean time to repair (an average time from a failure moment to a repair completion of a defective device of a mean of transport or downtime, that is not necessarily caused by a system’s failure), when means of transport serving order picking processes are out-of-order. PS means that this equation is implemented in the Plant Simulation software. Stochastic differentiation of parameters f and MTTR is beneficial to the simulation model because these make the model more realistic, contrary to analytical calculations in their pure form.
T P S = { t ( j , w j , p 11 , … , p i 1 , … , p I 1 , f , M T T R , P S ) , … , t ( j , w j , p 1 j , … , p i j , … , p I j , f , M T T R , P S ) , … , t ( J , w J , p 1 J , … , p i J , … , p I J , f , M T T R , P S ) } ;   j = 1 , J ¯ ;   i = 1 , I ¯ ;   t ( j , w j , p 1 j , … , p i j , … , p I j , f , M T T R , P S ) ∈ T P S → ℜ +
This part of the model is based on the classic approach to the order picking process time calculation [31], however it takes into account the complete information on orders in the randomly generated picking list, not just averaged values of lines’ numbers in the picking list or quantities of items to pick (per one line). This model also provides randomly generated downtimes in the work of means of transport. This manner of calculation is given in the generalized form in Equation (10).
∀ p i j ∈ P   ∀ w j ∈ W   ∀ j ∈ 1 , J ¯   ∀ i ∈ 1 , I ¯ :   t ( j , w j , p 1 j , … , p i j , … , p I j , f , M T T R , P S )
In order to compare the analytical and simulation models, a goodness-of-fit test for two mean values comparison was used. For each hundred-element sequence of corresponding experiments, average order picking time values were computed for both types of the models. The average value of the order picking process time is defined and expressed as t ( E X ) ¯ in Equation (11), according to the conceptual (analytical) model. The other average value regarding the simulation model is given as Equation (14).
t ( E X ) ¯ = E ( t ( j , w j , p j ¯ , E X ) ) = ( ∑ j = 1 J t ( j , w j , p j ¯ , E X ) ) J ;   j = 1 , J ¯
The dispersion of individual measurements around mean value for the conceptual model s t ( E X ) is calculated according to the Equation (12) and for the simulation model s t ( P S ) according to the Equation (15). The mean squared error of the mean value equations in the analytical and the simulation models, that indicate the degree of accuracy of the mean value, are s t ( E X ) ¯ (Equation (13)) and s t ( P S ) ¯ (Equation (16)), respectively.
s t ( E X ) = [ 1 J − 1 ∑ j = 1 J ( t ( j , w j , p j ¯ , E X ) − t ( E X ) ¯ ) 2 ] 0.5 ;   j = 1 , J ¯
s t ( E X ) ¯ = [ 1 J ( J − 1 ) ∑ j = 1 J ( t ( j , w j , p j ¯ , E X ) − t ( E X ) ¯ ) 2 ] 0.5 ;   j = 1 , J ¯
t ( P S ) ¯ = E ( t ( j , w j , p 11 , … , p i 1 , … , p I 1 , f , M T T R , P S ) , … , t ( j , w j , p 1 j , … , p i j , … , p I j , f , M T T R , P S ) , … , t ( J , w J , p 1 J , … , p i J , … , p I J , f , M T T R , P S ) ) = ( ∑ j = 1 J t ( j , w j , p 1 j , … , p i j , … , p I j , f , M T T R , P S ) ) J ;   j = 1 , J ¯ ;   i = 1 , I ¯
s t ( P S ) = [ 1 J − 1 ∑ j = 1 J ( t ( j , w j , p 1 j , … , p i j , … , p I j , f , M T T R , P S ) − t ( P S ) ¯ ) 2 ] 0.5 ;   j = 1 , J ¯ ;   i = 1 , I ¯
s t ( P S ) ¯ = [ 1 J ( J − 1 ) ∑ j = 1 J ( t ( j , w j , p 1 j , … , p i j , … , p I j , f , M T T R , P S ) − t ( P S ) ¯ ) 2 ] 0.5 ;   j = 1 , J ¯ ;   i = 1 , I ¯
For both models, experiments were executed based on the following data:
  • mean value of lift-truck acceleration or stop, A = 0.0475 [min] (value based on [31]);
  • length of a rack in warehouse, L = 150 [m];
  • mean time of lift-truck driving forward or backward (with lowered cabin and forks), F1 = 0.0079 [min/m] (the value of mean of transport velocity, i.e., v = 10.5 km/h, given in [105] has been converted to the F1 parameter, which is used in the analytical calculations; in turn, the velocity of the modeled mean of transport has been noted as vsym = 0.8547 [m/s], which is related to the simultaneous considerations on the mean of transport forward or backward movement with the lifted cabin and forks);
  • mean time of lift-truck driving forward or backward (with lifted cabin and forks), F3 = 0.0116 [min/m] (due to lack of data in the catalog [105], the value is estimated on the basis of the analogy indicated in [31], i.e., from the F1/F13 ratio);
  • rack height (from the ground to the bottom of the highest rack storey), H = 14.5 [m] (the adoption of this value is dictated by the fact that the lifting height in the catalog [105] is 14 570 [mm]);
  • free lift of forks, h2 = 0.8 [m] (value based on [105]);
  • medium value of load unit lifting up time, U = 0.0833 [min/m] (the lifting velocity vU = 0.2 [m/s] given in [105] is used to determine this value);
  • medium value of load unit lowering time, D = 0.0417 [min/m] (the lowering velocity vD = 0.4 [m/s] given in [105] is used to determine this value);
  • mean time of lift-truck fork ejection or rotation, N = 0.13 [min] (value based on [31]);
  • time of picking list reading by employee, t p r o = 0.0852 [min] (value based on [31]);
  • time of reading the next row in a picking list, t r o = 0.118 [min] (value based on [31]);
  • time of single item picking, t p l = 0.118 [min] (value based on [31]).

3. Verification and Validation of Simulation Model

Among the conditions, which enable the practical application of simulation models, validation and verification are mentioned [32]. Validation is only possible when the actual system was tested. The system presented in this paper is hypothetical, so it is only possible to verify the work of the simulation model and the verification without validation is accepted to be sufficient (this section is based on [32]).
For the purpose of verification, the values mentioned at the end of the previous section of this paper are implemented in conceptual (analytical) and simulation models. In addition, the estimated percentage of simulation time during which means of transport may be idle is assumed to be a random parameter f = random (0;0.1). The MTTR is assumed as a constant value and is equal to MTTR = 2 [min] in the case of means of transport implementation and MTTR = 1 [min] in the case of items picking and loading operations. Without saying, these times occur only in case of temporary damage, downtime or failure of implemented means of transport. Differently to the part of the research described in the following section, the PRNGs included in the software are used for the simulation model verification. In Plant Simulation, two PRNGs create a random integer, using the multiplicative linear congruential generator (MLCG), based on the algorithm given in [109].
As a result of Equation (11), the average order picking process time is computed, and its value is equal to t ( E X ) ¯ = 19.85 [min]. As part of the verification of the simulation model, 100 simulation scenarios are executed with identical, constant data, as for the analytical model. Average order picking process time obtained during simulations is equal to t ( P S ) ¯ = 19.16 [min] ( s t ( P S ) = 0.30 [min], s t ( P S ) ¯ = 0.03 [min]). The difference between values of parameters such as t ( E X ) ¯ and t ( P S ) ¯ , which is equal to 3.5%, is negligible. This is due to the implementation of potential equipment failures and possible temporary downtimes in the process, connected to e.g., human behavior, physiological needs of lift trucks operators, etc.
In this research, the ordinary simulation lasted only 3 or 4 s (this corresponds to the process time which duration is about 27 h in the actual processes). The technical parameters of the computer used for experimentation were: INTEL®Core™ i3 CPU M370 @ 2.40 GHz, 4.00 GB RAM.

4. Discussion on Sensitivity Analysis of Selected Parameters in the Simulation Model

In applied sciences, sensitivity allows one to determine how large changes in the output of a system are caused by small changes in the reference signal at the input. Sensitive systems are characterized by very large changes on the output, in response to small changes at the input.
In order to analyze the sensitivity of selected parameters of the simulation model, parameters of f and MTTR are assumed to be subjected to changes.
As the f coefficient is subjected to changes in subsequent experiments, from now on it is marked as f ( k ) , where k is the subsequent simulation experiment. In [32], twelve simulation experiments were carried out, under which values of all parameters of the simulation model were not subjected to variability, except for the f ( k ) coefficient. In this paper, twenty-one experiments of such kind are presented. The mentioned constant values (not subjected to variability) are the same as in Section 2, and values of p i j are presented in Figure 1 and Table 2. It is assumed that in each k experiment, the increment Δ f ( k ) would be equal to 5% in most of the cases. The only exception is the extreme value of 100%, which would mean that the system is completely suspended, therefore f ( k = 21 ) = 99%. The results of sensitivity analyses are presented in Table 3.
The total order picking process time as a result of the one hundred picking lists execution (given in Figure 1) is of particular interest to the author. This operation, without any disturbances i.e., f ( k = 1 ) = 0%, would take 26.5 h, and with 99% of disturbances, it would take more than twenty times longer (Table 3). Based on the mentioned data and taking limited assumptions into consideration, the author suggests that changes of the total order picking process time in function of f ( k ) are characterized by exponential growth, as can be observed in Figure 2. The same applies to the average order picking process time t ( P S ) ¯ , given in the function of f ( k ) in Figure 3 and Figure 4.
The use of means of transport is reasonable at the maximum value of f ( k = 1 ) = 30% (empirically proven in [32]). This is due to the fact that the difference between the average order picking process time for the current and previous picking list in a given sample (e.g., absolute value from t ( P S ) ¯ | f ( k = 7 ) minus t ( P S ) ¯ | f ( k = 6 ) from Table 3) should not be lower than the degree of accuracy of the mean value (in reference to the example from the bracket, this is s t ( P S ) ¯ | f = 30 % ). The above results confirm the results of the study presented in [32]. For this paper, changes of the MTTR parameter are also introduced. Another 18 experiments are executed for the purpose described above, since now k is equal to k = 1 , K ¯ = 22 , 39 ¯ .
Table 4 shows that when f ( k ) is equal to, or less than 30%, process realization does not cause major problems, regardless of the MTTR value. Such a conclusion is drawn after familiarizing with t ( P S ) ¯ values. Taking into account the highest value of MTTR = 243 [min], i.e., c.a. four hours, it can be noticed that with two work shifts in the investigated logistics facility, this value does not exceed 30% of the time of means of transport incapacity, because a four-hour period is equal to 25% of the work shifts time. The shape of Table 3 has changed in comparison to Table 4, because in the case of MTTR analysis, it is also worth analyzing the means of transport workload in aspects of working time, waiting for the next order and downtime resulting from unforeseen circumstances (failure time). It is worth noting that the increase of MTTR values does not have as tremendous influence on the reduction of the means of transport working time as the f ( k ) values. In order to eliminate potential problems with process handling, a redundant replacement of means of transport or employees is made available. The values indicated in Table 4 and the above explanations confirm the results of earlier studies on the f ( k ) coefficient.

5. Conclusions

This paper considers important matters from the point of view of stochastic simulation models creation and experimentations employing them. Most of the analytical or simulation models assume unified load units for the whole system ([29]; e.g., in [110]). Moreover, simulation models ensure more detailed and more understandable representation of order picking processes and operations in comparison to analytical models [18]. This is a matter of high importance for warehouse managers, who can use simulation models as decision support tools, in order to design efficient logistics facilities such as warehouses, or in order to improve the existing, real-world facilities of this kind (by analyzing the interaction between operations and processes in a simulation mode without any risk of such analyses in real-world facilities). The model presented in the paper can be used especially by industries which deal with handling of multiple small units, in particular selected major industries such as: electronic industry, food industry, textile industry, automotive industry, chemical industry (pharmaceutical industry), steel industry and construction industry. With regard to the International Standard Industrial Classification of All Economic Activities [111], these industries would be focused on sections such as: Manufacturing (Section C: Division 10 Manufacture of food products, Division 11 Manufacture of beverages, Division 12 Manufacture of tobacco products, Division 13 Manufacture of textiles, Division 26 Manufacture of computer, electronic and optical products, Division 27 Manufacture of electrical equipment, Division 29 Manufacture of motor vehicles, trailers and semi-trailers—automotive industry, Division 30 Manufacture of other transport equipment, Division 21 Manufacture of pharmaceuticals, medicinal chemical and botanical products, Division 25 Manufacture of fabricated metal products, except machinery and equipment) and Construction (Section F). According to the Global Industry Classification Standard [112], these industries would belong to the following industrial sectors: Information Technology (Sector 45: Industry group 4520 Technology Hardware & Equipment, Industry No. 452,030 Electronic Equipment, Instruments & Components), Consumer Staples (Sector 30: Industry group 3020 Food, Beverage & Tobacco, Industry No. 302,020 Food Products and No. 302,030 Tobacco), Health Care (Sector 35: Industry group 3520 Pharmaceuticals, Biotechnology & Life Sciences, Industry No. 352,020 Pharmaceuticals), Consumer Discretionary (Sector 25: Industry group 2520 Consumer Durables & Apparel, Industry No. 252,030 Textiles, Apparel & luxury goods), Materials Industry (Sector 15: group 1510 Materials for steel industry) and Industrials (Sector 20: Industry group 2010 Capitals goods for automotive and constructions).
The model presented in this paper is different from other models in the aspect of real-world-like facilities simulation and computation. The PRNG application is an important input to the research presented in the paper. This input is a crucial issue concerning the development of simulation models which correspond to actual conditions in real-life logistics facilities. Without such actual conditions, especially in the case of hypothetical systems, an analysis of the sensitivity of system parameters would not be valid (it should be noted that the model has not been validated since it is a model of the hypothetical warehouse, however it was verified [32]; in contrast to other research papers e.g., [113], the workers and equipment are not assumed to work in modeled warehouse in a constant manner, which is due to the application of the PRNG; therefore the simulation model may be more adequate for reflecting real-life situations and, at the same time, more relevant to actual working conditions). The original PRNG was used to generate picking lists with randomly selected numbers of rows and quantities of items to pick. This ensures building a hypothetical, yet close to reality, order picking process, in terms of unpredictable customers’ orders. Use of this PRNG also ensures the reflection of the real facility conditions in a simulation model. The PRNG is connected to chaos and nonlinear dynamics, whereas most of the research on the subject assumes a unified load unit being processed in the order of the picking process. The simulation model enables process analysis with non-unified load units and with real-world picking lists. In addition, the sensitivity analysis of chosen processes’ parameters ensures the system’s smooth functioning, from the viewpoint of order picking process reliability. The important aspect of this paper connected to the PRNG application was the execution analyses of the f ( k ) indicator. The value of f ( k ) reflects the estimated percentage of simulation time during which a mean of transport failure may occur, or a time when a means of transport is fully incapable for work. In short, it reflects the random idleness of the means of transport used in the research. The higher the f ( k ) value is, the more hazardous the order picking process is in relation to picking orders not realized in the allowed/assumed time. Therefore, managers are able to control the process, devices and means of transport used in the process, by analyzing the value of this indicator. They control the process in order to not gain high values of the indicator, especially higher than its critical value. As was mentioned before, the author’s previously presented research suggested that the critical value is f ( k ) = 30%. Execution of the model with higher values of f ( k ) significantly extends the total order picking process time, as can be observed based on the values given in Table 2 and Figure 2, Figure 3 and Figure 4. Again, when f ( k ) is equal to, or less than 30%, process implementation does not cause major problems, regardless of the MTTR value. In other words, changes in duration of the process do not have much negative impact on its implementation, while f ( k ) increases up to about 30%—above this value, decision-making managers might decide that one particular aisle in a warehouse should be operated by several redundant devices. Nevertheless, this would be very difficult in technological and organizational terms (in the case of e.g., use of an electric three-way stock-picker lift-truck discussed in this research), due to narrow aisles. It could be practically impossible to introduce redundant equipment (in the case of rack stacker cranes or an automated storage and retrieval system AS/RS), because of the fact that one rack stacker crane per aisle is applied to operation in a warehouse. Theoretically, it is possible to assign one rack stacker crane in order to work in several aisles; nevertheless, changes of allocation from one aisle, in which a certain stacker crane operates, to another one is not applied in actual logistics systems. This is because of the complex technological systems, the potential need for wide cross aisles at both ends of a storage zone, and long set-up times for such a device [31]). Based on the results of the model considered in this research, certain decision-making managers may also decide whether a device or mean of transport is suitable for further operation in said technological process after repairs, or whether it should be disposed of and replaced with a new device. It is worth noting that other research showed that a 10% increase of the f ( k ) values results in a decrease of half of the mean time to failure and mean time before failure values (results of this research are discussed in greater detail in [114]).
The limitations of the simulation model are as follows. In the model, one mean of transport and one aisle are taken into consideration, therefore for future research, the full area will be taken into consideration for the presented model. In accordance to boundary values of the parameters p i j and w j , it can be stressed that higher values of these parameters can be used for analyses, since it is possible that these higher values affect the results—on the other hand, the boundary values were selected to reflect the actual (real-life) processes in order picking areas of a warehouse. Moreover, the limitation of the second of these parameters is that the parameter w j is indirectly random, i.e., via the randomness of the parameter p i j . For future research, the PRNG might generate values of w j as well. At last, when mentioning limitations, the author suggests the uniform distribution in order to generate p i j * . Moreover, for future research, the author is considering analyses of the availability of the system, devices and means of transport.
The research potential of the issues discussed in this paper is much wider. In the future research, it is important to validate obtained results in an existing logistics facility and enriching the sensitivity analysis with changes of other parameters, as well as using software other than Plant Simulation, especially in order to compare the results. In forthcoming research, the author will reshape the simulation model in order to analyze the use of autonomous mobile robots and autonomous guided vehicles as, e.g., in [115]. It will also be profitable to transfer simulation methodology presented in this paper to other logistics facilities, e.g., freight terminals, since activity planning and optimization in these facilities can be realized by such simulation methods [116,117].

Funding

This research received no external funding. The research was financed by the author’s private funds.

Acknowledgments

The author would like to gratefully acknowledge the reviewers, who provided helpful comments and insightful suggestions on the draft of the manuscript. Moreover, he would like to thank Nowak W.J. for the support in the translation of the paper.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Alicke, K.; Arnold, D.; Knöss, A.; Töpfer, F. Optimierung von manuellen Kommissionierbereichen. Logistik für Unternehmen 2001, 15, 54–57. [Google Scholar]
  2. Ulbrich, A.; Galka, S.; Günthner, W.A. Simulation of Multi-Level Order Picking Systems Within Rough Planning for Decision Making. Available online: https://bit.ly/2GGGebA (accessed on 21 March 2016).
  3. Lu, W.; McFarlane, D.; Giannikas, V.; Zhang, Q. An algorithm for dynamic order picking in warehouse operations. Eur. J. Oper. Res. 2016, 248, 107–122. [Google Scholar] [CrossRef]
  4. Roodbergen, K.J.; de Koster, R.M.B.M. Routing order pickers in a warehouse with a middle aisle. Eur. J. Oper. Res. 2001, 133, 32–43. [Google Scholar] [CrossRef] [Green Version]
  5. Chiang, D.M.-H.; Lin, C.-P.; Chen, M.-C. The adaptive approach for storage assignment by mining data of warehouse management system for distribution centres. Enterp. Inf. Syst. 2011, 5, 219–234. [Google Scholar] [CrossRef]
  6. Kostrzewski, M. Mathematical Models of Time Computing in Two-Dimensional Order Picking Process in High-Bay Warehouses; Sas, J., Ed.; Quantitative Methods in Logistics Management; AGH University of Science and Technology Press: Kraków, Poland, 2014; pp. 55–69. [Google Scholar]
  7. Drury, J. Towards More Efficient Order Picking; IMM Monograph No. 1, Report; The Institute of Materials Management: Cranfield, Great Britain, UK, 1988; pp. 1–69. [Google Scholar]
  8. Gałązka, M.; Jakubiak, M. Simulation as a method of choosing the order picking concept. Logist. Transp. 2010, 11, 81–88. [Google Scholar]
  9. Tompkins, J.A.; White, J.A.; Bozer, Y.A.; Tanchoco, J.M.A. Facilities Planning, 4th ed.; Wiley: New York, NY, USA, 2010; pp. 1–864. [Google Scholar]
  10. Frazelle, E.H. World-Class Warehousing; Logistics Resources International: Atlanta, GA, USA, 1996; pp. 1–256. [Google Scholar]
  11. Bartholdi, J.J.; Hackman, S.T. Warehouse & Distribution Science, 0.98th ed.; The Supply Chain & Logistics Institute, H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology: Atlanta, GA, USA, 2016; Available online: https://www.warehouse-science.com/book/index.html (accessed on 20 December 2016).
  12. de Koster, R.; Le-Duc, T.; Roodbergen, K.J. Design and control of warehouse order picking: A literature review. Eur. J. Oper. Res. 2007, 182, 481–501. [Google Scholar] [CrossRef]
  13. Coyle, J.J.; Bardi, E.J.; Langley, C.J. The Management of Business Logistics, 6th ed.; West Publishing: Minneapolis, MN, USA, 1996; pp. 1–631. [Google Scholar]
  14. Chen, T.-L.; Cheng, C.-Y.; Chen, Y.-Y.; Chan, L.-K. An efficient hybrid algorithm for integrated order batching, sequencing and routing problem. Int. J. Prod. Econ. 2015, 159, 158–167. [Google Scholar] [CrossRef]
  15. Daly, F. Warehousing: The strategic weapon for customer service. Ind. Eng. J. 1993, 25, 61–62. [Google Scholar]
  16. Marchet, G.; Melacini, M.; Perotti, S. Investigating order picking system adoption: A case-study-based approach. Int. J. Logist. Res. App. 2015, 18, 82–98. [Google Scholar] [CrossRef]
  17. Wruck, S.; Vis, I.F.A.; Boter, J. Risk control for staff planning in ecommerce warehouses. Int. J. Prod. Res. 2017, 55, 6453–6469. [Google Scholar] [CrossRef] [Green Version]
  18. van Gils, T.; Ramaekers, K.; Caris, A.; de Koster, R.B.M. Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review. Eur. J. Oper. Res. 2018, 267, 1–15. [Google Scholar] [CrossRef] [Green Version]
  19. Quader, S.; Castillo-Villar, K.K. Design of an enhanced multi-aisle order picking system considering storage assignments and routing heuristics. Robot. Comput. Integr. Manuf. 2018, 50, 13–29. [Google Scholar] [CrossRef]
  20. Venkitasubramony, R.; Adil, G.K. Design of an order picking warehouse factoring vertical travel and space sharing. Int. J. Adv. Manuf. Technol. 2017, 91, 1921–1934. [Google Scholar] [CrossRef]
  21. Zhang, Y. Correlated Storage Assignment Strategy to reduce Travel Distance in Order Picking. IFAC-PapersOnLine 2016, 49, 30–35. [Google Scholar] [CrossRef]
  22. Pan, J.Ch.-H.; Shih, P.-H.; Wu, M.-H. Storage assignment problem with travel distance and blocking considerations for a picker-to-part order picking system. Comput. Ind. Eng. 2012, 62, 527–535. [Google Scholar] [CrossRef]
  23. Chew, E.P.; Tang, L.Ch. Travel time analysis for general item location assignment in a rectangular warehouse. Eur. J. Oper. Res. 1999, 112, 582–597. [Google Scholar] [CrossRef]
  24. Le-Duc, T.; de Koster, R.M.B.M. Travel time estimation and order batching in a 2-block warehouse. Eur. J. Oper. Res. 2007, 176, 374–388. [Google Scholar] [CrossRef]
  25. Öztürkog, Ö.; Hoser, D. A discrete cross aisle design model for order-picking warehouses. Eur. J. Oper. Res. 2019, 275, 411–430. [Google Scholar] [CrossRef]
  26. Gibson, D.R.; Sharp, G.P. Order batching procedures. Eur. J. Oper. Res. 1992, 58, 57–67. [Google Scholar] [CrossRef]
  27. Davarzani, H.; Norrman, A. Toward a relevant agenda for warehousing research: Literature review and practitioners’ input. Logist. Res. 2015, 8, 1–18. [Google Scholar] [CrossRef] [Green Version]
  28. Chow, H.K.H.; Choy, K.L.; Lee, W.B.; Lau, K.C. Design of a RFID case-based resource management system for warehouse operations. Expert. Syst. Appl. 2006, 30, 561–576. [Google Scholar] [CrossRef]
  29. House, R.G.; Karrenbauer, J.J. Logistics system modelling. Int. J. Phys. Distrib. Logist. Manag. 1978, 8, 189–199. [Google Scholar] [CrossRef]
  30. Staudt, F.H.; Alpan, G.; Mascolo, M.D.; Rodriguez, C.M.T. Warehouse performance measurement: A literature review. Int. J. Prod. Res. 2015, 53, 5524–5544. [Google Scholar] [CrossRef]
  31. Fijałkowski, J. Technologia Magazynowania, Wybrane Zagadnienia; Oficyna Wydawnicza Politechniki Warszawskiej: Warsaw, Poland, 1995; pp. 1–327. [Google Scholar]
  32. Kostrzewski, M. Modelowanie i Badanie Wybranych Elementów i Obiektów Logistycznych z Wykorzystaniem Metod Symulacyjnych, 1st ed.; Oficyna Wydawnicza Politechniki Warszawskiej: Warszawa, Poland, 2018; pp. 1–212. [Google Scholar]
  33. Karkula, M. Modelowanie i Symulacja Procesów Logistycznych, 1st ed.; Wydawnictwa Akademii Górniczo-Hutniczej: Kraków, Poland, 2013; pp. 1–281. [Google Scholar]
  34. Ardjmand, E.; Bajgiran, O.S.; Youssef, E. Using list-based simulated annealing and genetic algorithm for order batching and picker routing in put wall based picking systems. Appl. Soft Comput. 2019, 75, 106–119. [Google Scholar] [CrossRef]
  35. Boysen, N.; Stephan, K. The deterministic product location problem under a pick-by-order policy. Discrete Appl. Math. 2013, 161, 2862–2875. [Google Scholar] [CrossRef]
  36. Fumi, A.; Scarabotti, L.; Schiraldi, M.M. The effect of slot-code optimization in warehouse order picking. Int. J. Eng. Bus. Manag. 2013, 5, 1–10. [Google Scholar] [CrossRef]
  37. Le-Duc, T. Design and Control of Efficient Order Picking Processes. Ph.D. Thesis, ERIM Ph.D. Series Research in Management, Rotterdam, The Netherlands, 2005; pp. 1–174. [Google Scholar]
  38. Lorenc, A. Method of effectiveness evaluation of products picking process for pick by order type in warehouse on basis of a picking list. In Proceedings of the International Conference on Industrial Logistics, Zakopane, Poland, 28 September–1 October 2016; pp. 156–167. [Google Scholar]
  39. Hsu, C.-M.; Chen, K.-Y.; Chen, M.-C. Batching orders in warehouses by minimizing travel distance with genetic algorithms. Comput. Ind. 2005, 56, 169–178. [Google Scholar] [CrossRef]
  40. Pansart, L.; Catusse, N.; Cambazard, H. Exact algorithms for the order picking problem. Comput. Oper. Res. 2018, 100, 117–127. [Google Scholar] [CrossRef] [Green Version]
  41. Pawlewski, P. Simulation model to optimize picking operations in a distribution center. Prz. Organ. 2015, 10, 37–43. [Google Scholar] [CrossRef]
  42. Petersen, C.G.; Aase, G. A comparison of picking, storage, and routing policies in manual order picking. Int. J. Prod. Econ. 2004, 92, 11–19. [Google Scholar] [CrossRef]
  43. Rojanapitoon, T.; Teeravaraprug, J. A computer simulation for economical order picker routing when considering travel distance and vehicle energy consumption. Int. J. Eng. Technol. 2018, 7, 33–37. [Google Scholar] [CrossRef]
  44. Schwerdfeger, S.; Boysen, N. Order picking along a crane-supplied pick face: The SKU switching problem. Eur. J. Oper. Res. 2017, 260, 534–545. [Google Scholar] [CrossRef]
  45. Tarczyński, G. Warehouse real-time simulator—How to optimize order picking time (Working Paper). SSRN Electron. J. 2013, 1–18. [Google Scholar] [CrossRef]
  46. Urzúa, M.; Mendoza, A.; González, A.O. Evaluating the impact of order picking strategies on the order fulfilment time: A simulation study. Acta Logist. Int. Sci. J. Logist. 2019, 6, 103–114. [Google Scholar] [CrossRef]
  47. van Gils, T.; Caris, A.; Ramaekers, K.; Braekers, K.; de Koster, R.B.M. Designing efficient order picking systems: The effect of real-life features on the relationship among planning problems. Transp. Res. E Logist. 2019, 125, 47–73. [Google Scholar] [CrossRef]
  48. van Gils, T.; Caris, A.; Ramaekers, K.; Braekers, K. Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse. Eur. J. Oper. Res. 277, 814–830. [CrossRef]
  49. van Gils, T.; Ramaekers, K.; Braekers, K.; Depaire, B.; Caris, A. Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions. Int. J. Prod. Econ. 2018, 197, 243–261. [Google Scholar] [CrossRef]
  50. van Nieuwenhuyse, I.; de Koster, R.B.M. Evaluating order throughput time in 2-block warehouses with time window batching. Int. J. Prod. Econ. 2009, 121, 654–664. [Google Scholar] [CrossRef]
  51. Wang, M.; Zhang, R.-Q.; Fan, K. Improving order-picking operation through efficient storage location assignment: A new approach. Comput. Ind. Eng. 2020, 139, 106186. [Google Scholar] [CrossRef]
  52. Weidinger, F.; Boysen, N.; Schneider, M. Picker routing in the mixed-shelves warehouses of e-commerce retailers. Eur. J. Oper. Res. 2019, 274, 501–515. [Google Scholar] [CrossRef]
  53. Bahrami, B.; Aghezzaf, E.; Limere, V. Using simulation to analyze picker blocking in manual order picking systems. Procedia Manuf. 2017, 11, 1798–1808. [Google Scholar] [CrossRef]
  54. Bòdis, T.; Botzheim, J.; Földesi, P. Necessity and complexity of order picking routing optimisation based on pallet loading features. Acta Univ. Sapientiae Inform. 2017, 9, 162–194. [Google Scholar] [CrossRef] [Green Version]
  55. Choe, K.; Sharp, G.P. Small Parts Order Picking: Design and Operation. Available online: http://www.isye.gatech.edu/logisticstutorial/order/article.htm (accessed on 21 January 2019).
  56. Dąbrowska, A.; Giel, R.; Plewa, M. The picking process model in e-commerce industry. In Engineering in Dependability of Computer Systems and Networks. DepCoS-RELCOMEX 2019. Advances in Intelligent Systems and Computing, 1st ed.; Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J., Eds.; Springer: Cham, Switzerland, 2020; Volume 987, pp. 123–131. [Google Scholar] [CrossRef]
  57. Füßler, D.; Boysen, N. Efficient order processing in an inverse order picking system. Comput. Oper. Res. 2017, 88, 150–160. [Google Scholar] [CrossRef]
  58. Giannikas, V.; Lu, W.; Robertson, B.; McFarlane, D. An interventionist strategy for warehouse order picking: Evidence from two case studies. Int. J. Prod. Econ. 2017, 189, 63–76. [Google Scholar] [CrossRef] [Green Version]
  59. Guan, M.; Li, Z. Genetic Algorithm for scattered storage assignment in Kiva mobile fulfillment system. Am. J. Oper. Res. 2018, 8, 474–485. [Google Scholar] [CrossRef] [Green Version]
  60. Güller, M.; Hegmanns, T. Simulation-based performance analysis of a miniload multishuttle order picking system. Procedia CIRP 2014, 17, 475–480. [Google Scholar] [CrossRef] [Green Version]
  61. Henn, S. Algorithms for on-line order batching in an order picking warehouse. Comput. Oper. Res. 2012, 39, 2549–2563. [Google Scholar] [CrossRef]
  62. Henn, S.; Schmid, V. Metaheuristics for order batching and sequencing in manual order picking systems. Comput. Ind. Eng. 2013, 66, 338–351. [Google Scholar] [CrossRef]
  63. Henn, S.; Wäscher, G. Tabu search heuristics for the order batching problem in manual order picking systems. Eur. J. Oper. Res. 2012, 222, 484–494. [Google Scholar] [CrossRef] [Green Version]
  64. Hong, S.; Kim, Y. A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system. Eur. J. Oper. Res. 2017, 257, 185–196. [Google Scholar] [CrossRef]
  65. Lee, I.G.; Chung, S.H.; Yoon, S.W. Two-stage storage assignment to minimize travel time and congestion for warehouse order picking operations. Comput. Ind. Eng. 2020, 139, 106129. [Google Scholar] [CrossRef]
  66. Lin, C.-C.; Kang, J.-R.; Hou, C.-C.; Cheng, C.-Y. Joint order batching and picker Manhattan routing problem. Comput. Ind. Eng. 2016, 95, 164–174. [Google Scholar] [CrossRef]
  67. Onal, S.; Zhang, J.; Das, S. Modelling and performance evaluation of explosive storage policies in internet fulfilment warehouses. Int. J. Prod. Res. 2017, 55, 5902–5915. [Google Scholar] [CrossRef]
  68. Öncan, T. MILP formulations and an iterated local search algorithm. Eur. J. Oper. Res. 2015, 243, 142–155. [Google Scholar] [CrossRef]
  69. Öncan, T.; Cağirici, M. MILP formulations for the order batching problem in low-level picker-to-part warehouse systems. IFAC Proc. Vol. 2013, 46, 471–476. [Google Scholar] [CrossRef]
  70. Pan, J.C.-H.; Shih, P.-H.; Wu, M.-H.; Lin, J.-H. A storage assignment heuristic method based on genetic algorithm for a pick-and-pass warehousing system. Comput. Ind. Eng. 2015, 81, 1–13. [Google Scholar] [CrossRef]
  71. Parikh, P.J.; Meller, R.D. A travel-time model for a person-onboard order picking system. Eur. J. Oper. Res. 2010, 200, 385–394. [Google Scholar] [CrossRef]
  72. Roodbergen, K.J.; Vis, I.F.A. A model for warehouse layout. IIE Trans. 2006, 38, 799–812. [Google Scholar] [CrossRef]
  73. Rubrico, J.I.U.; Higashi, T.; Tamura, H.; Ota, J. Online rescheduling of multiple picking agents for warehouse management. Robot. Comput. Int. Manuf. 2011, 27, 62–71. [Google Scholar] [CrossRef]
  74. Scholz, A.; Schubert, D.; Wäscher, G. Order picking with multiple pickers and due dates—Simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems. Eur. J. Oper. Res. 2017, 263, 461–478. [Google Scholar] [CrossRef] [Green Version]
  75. Tarczyński, G. Estimating order-picking times for return heuristic - equations and simulations. LogForum. 2015, 11, 295–303. [Google Scholar] [CrossRef]
  76. Yu, M. Enhancing Warehouse Performance by Efficient Order Picking. Ph.D. Thesis, ERIM Ph.D. Series Research in Management, Rotterdam, The Netherlands, 2008; pp. 1–191. [Google Scholar]
  77. Žulj, I.; Kramer, S.; Schneider, M. A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. Eur. J. Oper. Res. 2018, 264, 653–664. [Google Scholar] [CrossRef]
  78. Ashayeri, J.; Strijbosch, L.W.G.; Jacobs, E.; van Asten, L. Redesigning storage assignment and order-picking policies of a miniload AS/RS system: A case study. In Progress in Material Handling Research, 1st ed.; Graves, R.J., McGinnis, L.F., Medeiros, D.J., Ward, R.E., Wilhelm, M.R., Eds.; Braun-Brumfield Inc.: Ann Arbor, MI, USA, 1998; pp. 61–85. [Google Scholar]
  79. Battini, D.; Calzavara, M.; Persona, A.; Roncari, M.; Sgarbossa, F. Dual-tray vertical lift module for order picking: A performance and storage assignment preliminary study. In Proceedings of the XX Summer School "Francesco Turco"—Industrial Systems Engineering, Naples, Italy, 16–18 September 2015; pp. 85–90. Available online: https://pdfs.semanticscholar:3c95/661ea92d0c6f13c647c98c0d8a53f2ae14a1.pdf (accessed on 6 February 2019).
  80. Battini, D.; Calzavara, M.; Persona, A.; Sgarbossa, F. Dual-tray vertical lift modules for fast order picking. In Proceedings of the 14th IMHRC Proceedings, Karlsruhe, Germany, 12–16 June 2016; Available online: https://digitalcommons.georgiasouthern.edu/pmhr_2016/6 (accessed on 6 February 2019).
  81. Bottani, E.; Volpi, A.; Montanari, R. Design and optimization of order picking systems: An integrated procedure and two case studies. Comput. Ind. Eng. 2019, 137, 106035. [Google Scholar] [CrossRef]
  82. Burinskienė, A. Order picking process at warehouses. Int. J. Logist. Syst. Manag. 2010, 6, 162–178. [Google Scholar] [CrossRef]
  83. Burinskienė, A.; Davidavičienė, V.; Raudelinienė, I.; Meidutė-Kavaliauskienė, I. Simulation and order picking in a very-narrow- aisle warehouse. Ekon. Istraz. 2018, 31, 1574–1589. [Google Scholar] [CrossRef] [Green Version]
  84. Gómez-Montoya, R.A.; Correa-Espinal, A.A.; Hernñndez-Vahos, J.D. Picking routing problem with k homogenous material handling equipment for a refrigerated warehouse. Rev. Fac. Ing. Univ. Ant. 2016, 80, 9–20. [Google Scholar] [CrossRef]
  85. Huang, M.; Guo, Q.; Liu, J.; Huang, X. Mixed model assembly line scheduling approach to order picking problem in online supermarkets. Sustainability 2018, 10, 3931. [Google Scholar] [CrossRef] [Green Version]
  86. Masood, T.; Weston, R.; Rahimifard, A. A computer integrated unified modelling approach to responsive manufacturing. Int. J. Ind. Syst. Eng. 2010, 5, 287–312. [Google Scholar] [CrossRef] [Green Version]
  87. Renaud, J.; Ruiz, A. Improving product location and order picking activities in a distribution centre. J. Oper. Res. Soc. 2008, 59, 1603–1613. Available online: www.jstor:stable/20202246 (accessed on 6 February 2020). [CrossRef]
  88. Santini, B.; de Moura Filho, J.P. A tool for analyzing picking operations within a distribution center. In Proceedings of the 2012 Winter Simulation Conference, Berlin, Germany, 9–12 December 2012; Laroque, C., Himmelspach, J., Pasupathy, R., Rose, O., Uhrmacher, A.M., Eds.; [Google Scholar]
  89. Takakuwa, S.; Takizawa, H.; Ito, K.; Hiraoka, S. Simulation and analysis of non-automated distribution warehouses. In Proceedings of the 2000 Winter Simulation Conference, Orlando, FL, USA, 10–13 December 2000; Joines, J.A., Barton, R.R., Kang, K., Fishwick, P.A., Eds.; pp. 1177–1184. [Google Scholar]
  90. Fosso Wamba, S.; Chatfield, A.T. RFID-enabled Warehouse Process Optimization in the TPL Industry. In Proceedings of the 43rd Hawaii International Conference on System Sciences, Kolua, Kauai, HI, USA, 5–8 January 2010; pp. 1–10. [Google Scholar] [CrossRef] [Green Version]
  91. Wasusri, T.; Theerawongsathon, P. An application of discrete event simulation on order picking strategies: A case study of footwear warehouses. In Proceedings of the 30th European Conference on Modelling and Simulation, Regensburg, Germany, 31 May–3 June 2016; Claus, T., Herrmann, F., Manitz, M., Rose, O., Eds.; pp. 1–7. [Google Scholar]
  92. Zuñiga, J.B.; Martínez, J.A.S.; Salais Fierro, T.E.; Marmolejo Saucedo, J.A. Optimization of the Storage Location Assignment and the Picker-Routing Problem by Using Mathematical Programming. Appl. Sci. 2020, 10, 534. [Google Scholar] [CrossRef] [Green Version]
  93. Cano, J.A.; Correa-Espinal, A.A.; Gómez-Montoya, R.A. An evaluation of picking routing policies to improve warehouse efficiency. Int. J. Ind. Eng. Manag. 2017, 8, 229–238. [Google Scholar]
  94. Charu, T.; Panagiotopoulos, T.; Kotipalli, P.; Haynes, M.; Starner, T. RF-Pick: Comparing Order Picking Using a HUD with Wearable RFID Verification to Traditional Pick Methods. West Point Res. Pap. 2018, 69, 168–175. Available online: https://digitalcommons.usmalibrary:usma_research_papers/69 (accessed on 6 February 2020).
  95. Chen, M.; Wu, H. An association-based clustering approach to order batching considering customer demand patterns. Omega 2005, 33, 333–343. [Google Scholar] [CrossRef]
  96. Furmans, K.; Huber, C.; Wisser, J. Queueing Models for manual order picking systems with blocking. Logist. J. 2009, 1, 1–16. [Google Scholar] [CrossRef] [Green Version]
  97. Kawczyński, Ł.; Aguilar-Sommar, R. Comprehensive design of an order picking line by simulation. IFAC Proc. 2006, 39, 365–370. [Google Scholar] [CrossRef]
  98. Tappia, E.; Roy, D.; Melacini, M.; de Koster, R.B.M. Integrated Storage-order Picking Systems: Technology, Performance Models, and Design Insights. Eur. J. Oper. Res. 2018, 274, 947–965. [Google Scholar] [CrossRef]
  99. Yu, M.; de Koster, R.B.M. The impact of order batching and picking area zoning on order picking system performance. Eur. J. Oper. Res. 2009, 198, 480–490. [Google Scholar] [CrossRef]
  100. Banks, J.; Carson, J.S.; Nelson, B.L.; Nicol, D.M. Discrete Event System Simulation, 3rd ed.; Prentice-Hall: Upper Saddle River, NY, USA, 2000; pp. 1–600. [Google Scholar]
  101. Zeigler, B.P. Theory of Modeling and Simulation, 1st ed.; Wiley Interscience: New York, NY, USA, 1976; pp. 1–510. [Google Scholar]
  102. Kostrzewski, M. Comparison of the order picking processes duration based on data obtained from the use of pseudorandom number generator. Transp. Res. Procedia 2019, 40, 317–324. [Google Scholar] [CrossRef]
  103. Kostrzewski, M. Zastosowanie metod symulacyjnych w badaniu wybranych procesów magazynowych w magazynie wysokoregałowym. Prace Nauk. Politech. Warsz. Transp. 2016, 111, 301–312. [Google Scholar]
  104. Kostrzewski, M. Zastosowanie wybranego generatora liczb pseudolosowych w analizie procesu komisjonowania. Prace Nauk. Politech. Warsz. Transp. 2017, 117, 129–138. [Google Scholar]
  105. Jungheinrich, Electric Order Picker/ Tri-Lateral Stacker (1250–1500 kg). Available online: http://www.centralgroup.co.nz/site/centralfor/files/EKX513.pdf (accessed on 14 March 2017).
  106. Gutenbaum, J. Modelowanie Matematyczne Systemów, 3rd ed.; Akademicka Oficyna Wydawnicza EXIT: Warsaw, Poland, 2003; pp. 1–420. [Google Scholar]
  107. Lorenz, E.N. Deterministic Nonperiodic Flow. J. Atmos. Sci. 1963, 20, 130–148. [Google Scholar] [CrossRef] [2.0.CO;2" target='_blank'>Green Version]
  108. Schuster, H.G. Chaos Deterministyczny; Wydawnictwo Naukowe PWN: Warsaw, Poland, 1993. [Google Scholar]
  109. L’Ecuyer, P. Efficient and Portable Combined Random Number Generators. Commun. ACM 1988, 31, 742–750. [Google Scholar] [CrossRef]
  110. Facchini, F.; De Pascale, G.; Faccilongo, N. Pallet Picking Strategy in Food Collecting Center. Appl. Sci. 2018, 8, 1503. [Google Scholar] [CrossRef] [Green Version]
  111. United Nations. International Standard Industrial Classification of All Economic Activities, Revision 4, 1st ed.; United Nations (Department of Economic and Social Affairs, Statistics Division): New York, NY, USA, 2008; pp. 1–291. Available online: https://unstats.un:unsd/publication/seriesM/seriesm_4rev4e.pdf (accessed on 4 April 2020).
  112. S&P Global Market Intelligence. GICS® Global Industry Classification Standard, 1st ed.; S&P Global Market Intelligence: New York, NY, USA, 2018; pp. 1–48. Available online: https://www.spglobal.com/marketintelligence/en/documents/112727-gics-mapbook_2018_v3_letter_digitalspreads.pdf (accessed on 4 April 2020).
  113. Lee, C.K.; Zhang, S.; Ng, K.K. In-Plant Logistics Simulation Model for the Catering Service Industry Towards Sustainable Development: A Case Study. Sustainability 2019, 11, 3655. [Google Scholar] [CrossRef] [Green Version]
  114. Kostrzewski, M.; Gnap, J.; Varjan, P.; Likos, M. Application of simulation methods for study on availability of one-aisle machine order picking process. Communications 2020, 22, 107–114. [Google Scholar] [CrossRef] [Green Version]
  115. Li, Z.P.; Zhang, J.L.; Zhang, H.J.; Hua, G.W. Optimal Selection of Movable Shelves under Cargo-to-Person Picking Mode. Int. J. Simul. Model. 2017, 16, 145–156. [Google Scholar] [CrossRef]
  116. Dinu, O.M.; Rosca, E.; Popa, M.; Rosca, M.A.; Rusca, A. Assessing materials handling and storage capacities in port terminals, MODTECH International Conference–Modern Technologies in Industrial Engineering V, Book Series: IOP Conf. Ser. Mater. Sci. Eng. 2017, 227, 012039. [Google Scholar] [CrossRef] [Green Version]
  117. Filina-Dawidowicz, L. Rationalization of servicing reefer containers in sea port area with taking into account risk influence. Pol. Marit. Res. 2014, 21, 76–85. [Google Scholar] [CrossRef] [Green Version]
Entropy 22 00423 g001 550
Figure 1. The changes in the order picking process time in case of the analyzed sample, with the indication of the number of items picked per order of jth number.
Figure 1. The changes in the order picking process time in case of the analyzed sample, with the indication of the number of items picked per order of jth number.
Entropy 22 00423 g001
Entropy 22 00423 g002 550
Figure 2. Execution of 100 picking lists for data sample, given in function f = f ( k ) in the case of total order picking process time (t).
Figure 2. Execution of 100 picking lists for data sample, given in function f = f ( k ) in the case of total order picking process time (t).
Entropy 22 00423 g002
Entropy 22 00423 g003 550
Figure 3. Execution of 100 picking lists for data sample, given in function f = f ( k ) in the case of the average value of order picking process time.
Figure 3. Execution of 100 picking lists for data sample, given in function f = f ( k ) in the case of the average value of order picking process time.
Entropy 22 00423 g003
Entropy 22 00423 g004 550
Figure 4. Execution of 100 picking lists per data sample, given in function f = f ( k ) in the case of the average value of order picking process time—part of the plot (the maximum value on t ( P S ) ¯ axis would be almost 60 min).
Figure 4. Execution of 100 picking lists per data sample, given in function f = f ( k ) in the case of the average value of order picking process time—part of the plot (the maximum value on t ( P S ) ¯ axis would be almost 60 min).
Entropy 22 00423 g004
Table
Table 1. Selected ways of picking lists generating identified in the literature.
Table 1. Selected ways of picking lists generating identified in the literature.
Way of Picking List ApplicationReferences that Mention Particular WayNecessary Comments
generalized random picking lists[19,24,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52]Fumi et al. (2013) [36] mentioned the variable picking list. Le-Duc and de Koster (2007) [24] applied random picking lists which consisted of only one line. Pawlewski (2015) [41] defined the methodology of the simulation model building, while implementing the design step of creating examples of picking lists (random or historical). Quader et al. (2016) [19] used a fixed and random picking list. Urzuà et al. (2019) [46] applied a random picking list based on historical data.
uniform distribution picking lists[53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77]Giannikas et al. (2017) [58] mentioned the uniform demand for the stock keeping unit. Lee et al. (2020) [65] applied uniform distribution picking list indirectly by implementation of uniform pick-up time. In the case of Žulj et al. (2018) [77], picking lists were indirectly connected to uniform distribution.
picking lists based on historic data[41,46,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92]Battini et al. (2016) and Battini et al. (2015) [79,80] suggested that the actual time needed to pick an item from a vertical lift tray was the average value. Burinskienė (2010) [82] mentioned the picking list data base. Gómez-Montoya et al. (2016) [84] mentioned a variable picking list connected to empirical data. Urzêa et al. (2019) [46] applied a random picking list based on historical data.
other[93,94,95,96,97,98,99]Cano et al. (2017) [93] applied ad hoc picking lists. Charu et al. (2018) [94] mentioned non-uniform distribution. Chen and Wu (2005) [95] applied normal distribution picking lists. Furmans et al. (2009) [96] applied lognormal distribution and suggested pick times that follow exponential distribution. In the case of Kawczyński and Aguilar-Sommar (2006) [97], the number of products per order is variable, and it is assumed to be described by exponential distribution. Tappia et al. (2019) [98] applied pick times that follow an exponential distribution. Yu and de Koster (2009) [99] applied a random picking list with Poisson order arrivals.
Table
Table 2. Numbers of product p i j of ith type (from 1st type to 10th type) in jth experiment (described in the columns headers) per order (j)—the same sample is identical to that given in Figure 1.
Table 2. Numbers of product p i j of ith type (from 1st type to 10th type) in jth experiment (described in the columns headers) per order (j)—the same sample is identical to that given in Figure 1.
j{pj1, pj2, pj3, pj4, pj5, pj6, pj7, pj8, pj9, pj10}j{pj1, pj2, pj3, pj4, pj5, pj6, pj7, pj8, pj9, pj10}j{pj1, pj2, pj3, pj4, pj5, pj6, pj7, pj8, pj9, pj10}
1{5,9,10,6,2,8,8,0,3,3}35{4,7,5,0,4,5,1,2,9,9}69{7,4,8,9,0,1,4,2,5,4}
2{9,4,8,7,9,1,4,6,4,8}36{1,9,10,7,1,7,9,7,6,4}70{0,2,2,6,7,1,5,4,6,4}
3{0,6,10,6,8,10,3,1,7,4}37{3,2,6,9,1,8,6,0,7,6}71{1,3,6,3,7,9,2,9,2,2}
4{3,5,5,3,9,9,4,6,4,1}38{2,9,4,10,0,9,9,2,5,2}72{10,3,9,8,8,0,9,9,2,8}
5{1,9,2,6,8,8,8,3,9,0}39{3,5,3,0,9,8,1,2,4,3}73{9,6,9,9,3,2,10,3,2,8}
6{7,1,10,6,9,2,6,0,0,3}40{9,3,5,5,9,1,1,7,2,5}74{4,1,8,4,1,5,9,3,1,2}
7{3,2,7,3,3,9,3,6,6,5}41{10,2,10,8,9,0,5,2,1,4}75{1,6,2,6,6,10,2,6,3,8}
8{0,4,4,5,6,6,1,6,6,2}42{4,3,4,6,9,1,8,10,0,8}76{8,6,0,4,3,3,6,3,1,5}
9{0,6,6,10,7,6,1,10,2,4}43{2,6,10,3,2,6,9,6,8,7}77{2,10,1,10,6,5,6,3,7,6}
10{5,8,2,9,1,10,0,7,1,4}44{6,2,3,1,2,6,2,0,5,3}78{0,1,2,8,2,5,10,5,1,7}
11{9,0,1,7,3,8,9,9,6,8}45{1,6,3,4,1,5,4,4,4,3}79{7,9,6,2,5,2,9,7,0,8}
12{9,7,2,7,9,10,4,5,6,5}46{1,1,4,7,4,4,6,8,1,7}80{5,3,7,9,7,3,7,6,9,9}
13{6,1,5,7,2,5,6,2,3,9}47{8,6,0,0,4,5,9,6,7,0}81{3,5,2,4,9,8,7,7,6,4}
14{6,1,4,5,7,10,5,7,9,6}48{4,5,0,2,9,8,4,5,1,6}82{4,6,0,5,5,8,6,4,6,1}
15{8,4,6,7,9,9,8,8,4,7}49{1,9,6,2,8,2,5,4,6,3}83{8,5,7,9,1,0,4,5,1,3}
16{2,9,10,3,4,5,2,10,5,3}50{3,7,3,9,7,9,7,2,2,9}84{8,7,1,7,4,9,2,0,3,9}
17{5,5,4,6,10,2,6,4,5,1}51{5,5,9,8,7,8,4,0,7,2}85{8,2,4,8,10,7,3,6,9,3}
18{2,6,7,9,2,0,1,4,0,5}52{5,7,3,8,9,9,1,4,6,7}86{7,4,8,9,8,4,2,7,1,3}
19{3,2,4,9,5,4,5,8,4,2}53{7,9,8,1,2,8,6,9,5,5}87{7,8,9,2,7,9,1,9,9,7}
20{3,5,3,1,5,8,9,5,3,9}54{2,3,3,10,9,2,8,9,4,5}88{1,3,9,7,6,4,7,4,10,0}
21{10,5,5,5,8,1,9,7,10,2}55{9,0,0,9,2,8,6,0,6,2}89{4,9,3,5,3,5,5,3,3,1}
22{10,10,5,7,1,2,2,5,6,7}56{6,5,8,7,5,5,2,6,10,2}90{8,8,6,9,4,9,3,4,0,4}
23{2,3,8,4,7,6,6,8,5,8}57{8,4,3,3,4,7,7,9,8,7}91{3,9,4,9,0,1,10,6,9,0}
24{4,8,5,3,10,6,4,4,2,3}58{5,4,6,7,1,1,7,8,6,8}92{8,8,2,7,5,4,7,1,4,6}
25{7,3,7,9,0,2,3,5,2,0}59{3,0,9,9,4,1,2,0,3,8}93{1,6,8,8,4,7,9,8,9,6}
26{6,7,2,6,2,2,4,2,6,9}60{8,3,7,0,6,9,10,3,8,9}94{4,2,5,8,2,8,6,8,9,4}
27{7,5,5,4,7,9,1,0,1,5}61{8,9,7,6,5,6,8,4,7,2}95{2,0,5,4,0,10,2,7,3,5}
28{4,1,4,5,4,6,4,3,9,8}62{4,10,5,2,7,10,1,9,8,3}96{1,6,9,0,4,1,10,6,2,5}
29{5,7,8,8,2,8,6,6,3,5}63{9,9,4,1,6,7,8,3,8,4}97{7,10,10,1,8,2,3,5,3,8}
30{3,6,0,5,2,9,0,1,7,4}64{7,9,2,7,9,3,5,8,7,7}98{6,1,1,7,4,1,8,0,1,10}
31{6,2,8,9,8,4,3,8,2,9}65{4,0,9,6,5,5,5,6,9,9}99{8,7,3,9,7,7,2,6,2,2}
32{10,9,7,7,2,2,10,4,6,5}66{7,8,4,1,1,3,8,6,3,3}100{3,8,2,10,2,10,6,2,5,8}
33{4,5,9,1,1,2,4,1,10,10}67{1,4,6,3,7,2,4,2,8,1}--
34{5,8,3,8,6,9,6,2,1,3}68{2,8,1,5,2,10,3,1,8,8}--
Table
Table 3. List of statistical parameters concerning the order picking process time values, according to the simulation model, determined for 100 orders in case of data sample, in the function of f.
Table 3. List of statistical parameters concerning the order picking process time values, according to the simulation model, determined for 100 orders in case of data sample, in the function of f.
k f = f ( k ) [%]Total Order Picking Process Time for Sample (t) t ( P S ) ¯ | f ( k ) [min] s t ( P S ) | f ( k ) [min] s t ( P S ) ¯ | f ( k ) [min] | t ( P S ) ¯ | f ( k + 1 ) + − t ( P S ) ¯ | f ( k ) | [min]
[min][h]
101591.6826.5315.921.280.130.00
251635.8527.2616.361.320.130.44
3101668.7127.8116.681.510.150.33
4151656.4127.6116.561.330.130.12
5201727.4528.7917.271.440.140.71
6251727.5228.7917.281.560.160.00
7301854.4830.9118.541.800.181.27
8351824.9730.4218.251.640.160.30
9401931.2232.1919.311.670.171.06
10452033.8933.9020.341.730.171.03
11502108.1635.1421.081.800.180.74
12552265.9237.7722.662.030.201.58
13602345.7939.1023.462.080.210.80
14652663.1244.3926.632.390.243.17
15702775.4246.2627.752.630.261.12
16753077.3551.2930.772.930.293.02
17803525.1558.7535.253.400.344.48
18854011.1766.8540.113.880.394.86
19905649.0094.1556.495.650.5716.38
20957849.27130.8278.498.900.8922.00
219931966.38532.77319.6648.384.84241.17
Table
Table 4. Use of mean of transport (EKX_515k, electric three-way stock-picker lift-truck).
Table 4. Use of mean of transport (EKX_515k, electric three-way stock-picker lift-truck).
k f = f ( k ) [%]MTTR [min]Operational [%]Failed [%] t ( P S ) ¯ | f ( k ) [min] s t ( P S ) | f ( k ) [min] s t ( P S ) ¯ | f ( k ) [min]
WorkingWorking
2210177.5412.4210.0416.840.940.09
2310378.7511.0610.1917.371.070.11
2410980.1910.619.2018.011.010.10
25102776.2514.479.2818.090.770.08
26108181.969.298.7516.820.950.10
271024367.7417.4814.7816.660.980.10
2820162.3817.4520.1717.500.790.08
2920360.5119.2620.2317.930.770.08
3020960.6018.3421.0619.141.570.16
31202763.2818.0218.7019.731.160.12
32208165.0016.9418.0619.301.730.17
332024358.1321.0220.8516.660.980.10
3430147.1222.6530.2318.650.530.05
3530346.3322.8030.8718.921.470.15
3630945.6323.2831.0920.272.150.22
37302751.0722.3026.6320.541.800.18
38308152.4021.6825.9222.152.480.25
393024355.4021.4123.1918.612.490.25

Share and Cite

MDPI and ACS Style

Kostrzewski, M. Sensitivity Analysis of Selected Parameters in the Order Picking Process Simulation Model, with Randomly Generated Orders. Entropy 2020, 22, 423. https://doi.org/10.3390/e22040423

AMA Style

Kostrzewski M. Sensitivity Analysis of Selected Parameters in the Order Picking Process Simulation Model, with Randomly Generated Orders. Entropy. 2020; 22(4):423. https://doi.org/10.3390/e22040423

Chicago/Turabian Style

Kostrzewski, Mariusz. 2020. "Sensitivity Analysis of Selected Parameters in the Order Picking Process Simulation Model, with Randomly Generated Orders" Entropy 22, no. 4: 423. https://doi.org/10.3390/e22040423

APA Style

Kostrzewski, M. (2020). Sensitivity Analysis of Selected Parameters in the Order Picking Process Simulation Model, with Randomly Generated Orders. Entropy, 22(4), 423. https://doi.org/10.3390/e22040423

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop