
The article presents the issue of selecting picking points as one of the sub-problems related to the order picking process. An exemplary algorithm for selecting picking points will be presented. Using a calculation example, the impact of the aforementioned algorithm on the length of picking routes for various spatial layouts of the picking zone and using different picking route determination algorithms will be analyzed.
Order picking is defined as the compilation of specific subsets of items from the assortment (i.e., the total set of available items) based on an order picking task. The concept of picking is directly related to the concept of order fulfillment – order fulfillment is part of the picking process, responsible for the process itself related to selecting the appropriate number of items from specific storage locations and assembling them into a separate, distinct whole. In other words, to perform order fulfillment, one must know which picking points to visit and in what order. The algorithm determining the picking route is responsible for establishing the order. However, the selection of specific picking points is obvious only in the case where exactly one picking location is assigned to one item.
In such a situation, the very arrangement of the assortment in the picking zone clearly indicates the available picking points (a 1-to-1 relationship between items and picking locations). Otherwise (a 1-to-many relationship for items and picking locations), a choice must be made as to which location (out of all available picking locations containing a given item) the picking should be performed from. It is easy to see that the way in which specific picking points are selected will have an impact (among other things) on the length of the picking route for a given order. It can be stated that regardless of the picking route selection algorithm used, the route determined for points selected according to Figure 2a will be significantly longer than the route between the points presented in point 2b. Since improving the efficiency of the picking zone is most often identified with finding ways to reduce the length of picking routes, it is clear that the issue of selecting individual points will have an impact on the efficiency of the entire picking process.
Literature review
The issue of selecting picking points itself is practically absent in both Polish and foreign literature. The process preceding the determination of picking points is the arrangement of the assortment within the picking zone, while the activity following the selection of picking locations is the determination of the picking route (alternatively: the application of an order grouping algorithm, and only then the determination of the picking route). Both of these issues are widely described in the literature. In the calculation part, an algorithm for distributing the assortment in the picking zone based on classes was used, as well as the following methods for determining the picking route: optimal route (based on the algorithm presented in [5]) and “combined+” route (as an example of a heuristic algorithm) – see [2], [12].
The article contains 33,030 characters.
Source: Logistyka Magazine







