You are currently viewing a new version of our website. To view the old version click .
Sustainability
  • Article
  • Open Access

14 September 2023

A Model for an Order-Picking Problem with a One-Directional Conveyor and Buffer

,
and
1
Department of Process Management, Wroclaw University of Economics and Business, Komandorska St. 118/120, 53-345 Wroclaw, Poland
2
Faculty of Mechanical Engineering, Poznan University of Technology, Piotrowo 3, 60-138 Poznan, Poland
*
Author to whom correspondence should be addressed.
This article belongs to the Special Issue Advances in Sustainability Research from Poznan University of Technology

Abstract

Customers seek items at low prices, excellent quality, and customization in today’s market. Additionally, the need for quick product delivery is rising because of the expansion of e-commerce. Order picking is an essential element of order fulfillment and is regarded as one of the most costly and time-consuming tasks for warehouses. The study aims to create a model for the ordering in logistics that involves the group of racks with assigned one-way conveyor and buffers. The focus of this study is on improving the customer order completion time because of appropriate tasks assigned to pickers. The simulation was performed using the CPLEX solver. The findings highlight the need for picking operations to manage time resources, as well as the importance of sustainable work of order pickers in logistic centers in fostering sustainable performance outcomes.

1. Introduction

One of the most important aspects of e-commerce transactions overall is logistics. A free, open, international, and inclusive platform is being built by the logistics industry. This platform enables e-commerce transactions between customers and small and medium-sized businesses [1].
The success of any e-commerce company depends on carefully planned logistics. The expansion of e-commerce presents the logistics system with both new difficulties and possibilities [2].
Customers anticipate their ordered goods to be supplied in a shorter time frame as a result of the market economy’s ongoing development and the improvement of science and technology [3,4,5,6,7]. As a result, in order to remain competitive, manufacturers need to be able to create a wide range of goods at a low cost and react fast to client demands.
Customer service in logistics includes satisfying demands for timeliness, dependability, communication, and comfort. Customers have high expectations for e-commerce logistics, and a brand’s ability to compete in this fiercely competitive e-business market depends on its ability to provide logistical services. However, the cost of logistics increases with the service level.
Academic research is becoming increasingly and more focused on the platform service supply chain as a result of its growing significance in generating economic value [8]. Supply networks of today must adapt to constant and quick change. The platform service supply chains must keep enhancing or optimizing their operational and strategic choices, such as those involving cooperation, pricing, and production, from an economic standpoint. Because of rising client expectations, this is difficult.
More complicated distribution networks have developed as a result of the emergence of new channels and structures for distribution. For instance, commodities are frequently carried straight from a distribution center to the end consumer or even from a distribution center to a postal office depot, where they are then delivered to clients by a mailman [9].
The alternatives available to grocery retailers to satisfy online demand are varied: use existing distribution centers, establish online distribution centers, buy products from numerous suppliers at various locations, or leverage existing physical shops. Products can be chosen from shop inventory when dealing with a limited quantity of orders. If there is clearly a greater demand for products in certain stores, then it is reasonable to pack orders directly from warehouses [10].
In contrast to conventional distribution networks, wholesalers and retailers are frequently disregarded because of this. Moreover, in an e-commerce setting, clients place smaller, more regular orders [11]. The quantity of consignments rises as a result [9]. Very stringent requirements for the corporate capacity of production and on-time completion are put forth by the increasingly market-centric order completion technique [12,13].
Distribution centers are increasingly using compact storage technologies. They are space-efficient, flexible in regulating demand, and help to reduce direct variable expenses [14]. Retail performance is now correlated with supply chain effectiveness due to the enormous logistical challenges brought about by this trend [15].
Finding and filling in the order-picking problem knowledge gaps could result in more comprehensive and useful solutions for order-picking. The majority of research examines the order-picking issue using the method where parts are assigned to pickers. The picker travels the logistic center and selects items listed in the order. Nonetheless, zone-picking regulations are used in many logistic hubs, and the picker only picks items from his zone for certain orders. Therefore, in this study, we delve into the procedure for getting the container from the conveyor to the picking areas where the pickers are able to pick up the orders. We want to contribute by carrying out studies, experiments, and analyses that close the gaps concerning order picking in distribution centers with conveyors and propose insightful information to practitioners in business and supply chains.
The rest of this paper is organized as follows. In Section 2, the existing literature related to the topics addressed in this research is reviewed. In Section 3, we set the research steps. In Section 4, the definition and formulation of the investigated order-picking problem are presented. Section 5 provides the results of the computational experiment using the CPLEX solver. Discussion and application of the proposed model are given in Section 6. Section 7 presents a summary of the work and discusses possibilities for further work.

3. Research Procedure and Methods

The research is provided according to the following steps:
  • Gather the literature on order picking and sustainable logistics applicable to the warehouse and the distribution center.
  • Define the order-picking strategies.
  • Give the detailed investigated order-picking problem definition applicable to the distribution center.
  • Formulate the order-picking problem with a one-directional conveyor and buffers.
  • Draw various layouts of the distribution center that are applicable to the formulated problem.
  • Conduct the experiment using a CPLEX solver and report the instance size that is possible or impossible to solve with this tool.
  • Analyze the results of the research and formulate the conclusions.
The research is based on operational research, which is a very useful analytical method in the sustainable management of organizations. Simulation is mainly used.
For companies, warehouses, and supply chain operations, the order selection problem has important managerial and policy implications. By solving the order-picking problem, businesses can more efficiently deploy their resources (such as personnel, tools, and space), reducing wastage and unnecessary expenditures. To solve this issue, thorough planning, effective implementation, and consideration of numerous elements are required. Figure 1 presents some managerial and policy implications associated with the order-picking problem:
Figure 1. Managerial and policy implications of order-picking problem.
To cut down on travel time, reorganize operations, and boost productivity, managers must concentrate on streamlining the order-picking process. Implementing technology like real-time tracking, automated storage and retrieval systems, and routing algorithms may be necessary for this. The best way to reduce the number of pickers needed for a single shift in the warehouse is to automate it. Automating a warehouse is the most effective technique to lower the number of pickers required for a single shift. Warehouse automation should increase all of the pickers’ productivity, requiring fewer of them to fill the same number of orders.
To make sure that frequently used items are placed in convenient locations, efficient inventory management techniques are required. Managers should keep an eye on demand trends and modify their storage plans accordingly. Distributors should have complete visibility over all inventory movements, including which employee carried out each activity, with the help of a competent WMS with targeted e-commerce workflows. To keep track of inventory, follow the status of orders, and ensure proper picking, managers must evaluate and integrate technology like barcode scanners, RFID devices, and warehouse management software.
Supply chains and warehouses should implement regulations that support sustainable order picking, taking into account waste minimization, energy-efficient machinery, and eco-friendly packaging options. Fewer pickers should be needed to fill the same number of orders because of automation, which should boost the efficiency of all of the pickers. The creation of best practices might result from cooperation with industry organizations as well.

4. Problem Definition and Formulation

Authors have investigated the subsequent order-picking problem (OPP). There is a definite number of orders at the logistic center (warehouse or distribution center) that workers (pickers) must complete by choosing products from the racks, collecting them and putting them in the container with the given order. Each ready-to-go container has a definite list of the products with the quantities that the client ordered.
The products are stored in the defined locations on the racks. In the logistics center, generally, each product is stored in one location on the rack, but also, every product may be stored in more than one location. Because sometimes it is prohibited to place a new delivery of the product in the previous location, therefore it is placed in another location. For example, products such as paints do not necessarily have to maintain exactly the same color between different production batches; therefore, the distributors prefer not to sell clients such doubtful products from different deliveries. Because of this, they manage to store such products in different locations. Of course, most of the products that are totally equal are stored only in one location.
Containers are moved from the depot to the buffers on the one-directional conveyor, which is stretched across all storage locations in the logistics center. The racks near the buffer are assigned to the same buffer. Accordingly, one buffer may serve for one or several racks. One picker picks products from one or more buffers for which that employee is assigned. This means that in the same buffer, the employee picking the order has access to many racks and storage places. A single rack, or even a selected part of it, is not assigned to a specific employee. The picker is assigned to the whole buffer, i.e., to all racks in the buffer and all locations on the rack.
Assigning more than one rack to an employee requires that they be adjacent to each other. This is to avoid the need for the employee to travel an additional route, which would have to be taken into account in the algorithm. Only moving time between buffers is considered for containers because containers are moving on the one-directional belt conveyor.
After the container reaches the buffer, the employee must find the product required by the order. Most often, it is only necessary to count the appropriate number of products, although sometimes it is also necessary to measure, for example, the length of the chain or the rope, cut it, and then pack it into temporary packaging. The employee places the entire order for which he is responsible in the container, and the conveyor moves to the next buffer or the depot.
Everything that must be inside the containers is prepared beforehand. No more products can be added to the order once the container starts its trip. It is not mandatory to add products to the container in the predetermined order. We assume that enough products that the client ordered are available at the distribution center. Out-of-stock does not occur. The conveyor is one-directional; therefore, the container does a full round without accessing the final depot in order to reach the prior buffer.
Orders must be completed as quickly as possible. Therefore, the investigated OPP determines the order and allocation of containers to be handled by employees, taking into account employees’ availability and travel time. The execution time is equal to the time needed for the container to travel between all buffers.
Figure 2, Figure 3 and Figure 4 present an example of the distribution center with six buffers (B1–B6). The distribution of the facility’s internal space, as shown on a plan, is what the distribution center’s design or layout is all about. In this research, the layout of a distribution center establishes the storage and order preparation areas. Buffers B0 and B7 are start and out depots. There are 120 locations assigned per 20 locations to each buffer. The main locations are colored in the dark on each rack. There are eight repeated locations of colored light in each rack. On the figures, there is no assignment of the locations to the shelves shown. It shows what locations exist in which rack and which rack is assigned to which buffer. The conveyor is one-directional and transfers the containers from buffer B0–B1 to buffer B6–B7. To come to any of the previous buffers, the container must perform a round-trip beyond depots B7 and B0.
Figure 2. Distribution center layout; each employee is responsible for one buffer: B0 and B7 are containers in and out buffers; order picking is realized in buffers from B1 to B6; darker colors mean places with products exclusive to that buffer; lighter colors mean places of products that can also be found on other buffers.
Figure 3. Distribution center layout; one employee is responsible for more than one buffer: B0 and B7 are containers in and out buffers; order picking is realized in buffers from B1 to B6; darker colors mean places with products exclusive to that buffer; lighter colors mean places of products that can also be found on other buffers.
Figure 4. Distribution center layout; many employees are responsible for more than one buffer: B0 and B7 are containers in and out buffers; order picking is realized in buffers from B1 to B6; darker colors mean places with products exclusive to that buffer; lighter colors mean places of products that can also be found on other buffers.
In Figure 2, each picker is assigned to one buffer, and each buffer is assigned to one picker. In Figure 3, one picker is assigned to more than one buffer, i.e., Picker 4 is assigned to buffer B4 and buffer B5. Multi-picker assignment is presented in Figure 4, i.e., buffer B1 is operated by two pickers (1 and 2); similarly, Pickers 5 and 6 are assigned to buffer B6.
Next, we present the mathematical model for the described problem. The following notation is used in the model.
Indices and sets:
N —number of orders;
H —number of products;
R —number of buffers;
W —number of pickers/workers;
i , m —index for orders, i , m = 1 , , N ;
j , k —index for products, j , k = 1 , , H ;
b , g —index for buffers, b , g = 1 , , R ;
p —index for pickers/workers, p = 1 , , W .
Parameters:
t i j —picking time of the product j in the order i ;
s b —travel time from the depot to the buffer b ;
c i j —quantity of product j in the order i that must be picked;
q b j —available quantity of the product j in the buffer b ;
f b g —travel time from the buffer b to the buffer g (because the conveyor is one-directional, f b g f g b );
z b j —binary parameter of assignment products to buffers;
z b j = 1 ,   if   the   product   j   is   assigned   to   the   buffer   b 0 ,   otherwise ;
v p b —binary parameter of assignment pickers to buffers;
v p b = 1 ,   if   the   picker   p   is   assigned   to   the   buffer   b 0 ,   otherwise ;
Decision variables:
x i j p b —start time for the product j in the order i processed by the picker p in the buffer b ;
y i j p b —quantity of the product j in the order i picked by the picker p in the buffer b .
Minimize the makespan:
min max i = 1 , , N   max j = 1 , , H   max p = 1 , , W   max b = 1 , , R ( x i j p b + t i j ) ,
Subject to:
Pickers-to-buffers assignment, i.e., there is no product that could not be handled in the buffer by a specific employee.
( p ) ( i ) ( j ) ( b : v p b = 0 ) [ y i j p b = 0 ] ,
Products-to-buffers assignment, i.e., there is no product in the order that is not in stock.
( p ) ( i ) ( j ) ( b : z b j = 0 ) [ y i j p b = 0 ] ,
Each order has a set order of execution in the buffers. Each buffer complementation operation can only start when the previous one has finished.
( i ) ( j , k : j k , t i j 0 , t i k 0 ) [ max p = 1 , , W   max b = 1 , , R   ( x i j p b + t i j ) min p = 1 , , W   min b = 1 , , R   x i k p b max p = 1 , , W   max b = 1 , , R   ( x i k p b + t i k ) min p = 1 , , W   min b = 1 , , R   x i j p b ] ,
Each employee processes one order at a time and can only process it in one buffer at a time.
( p ) ( i , m : i m ) ( b : v p b = 1 ) ( j ) [ x i j p b + t i j x m j p b x m j p b + t m j x i j p b ] ,
Each picker can only pack one product at a time.
( p ) ( i ) ( b : v p b = 1 ) ( j , k : j k ) [ x i j p b + t i j x i k p b x i k p b + t i k x i j p b ] ,
Each picker can operate in one buffer at a time.
( p ) ( i ) ( j ) ( b , g : b g , v p b = 1 , v p g = 1 ) [ x i j p b + t i j x i j p g x i j p g + t i j x i j p b ] ,
Each picker can pack only one product at a time, in one buffer for only one order.
( p ) ( b : v p b = 1 ) ( i , m : i m ) ( j , k : j k ) [ x i j p b + t i j x m k p b x m k p b + t m k x i j p b ] ,
Each picker processes just one of the different jobs, just one of the different products, just one of his buffers at a time.
( p ) ( b , g : b g , v p b = 1 , v p g = 1 ) ( i , m : i m ) ( j , k : j k ) [ x i j p b + t i j x m k p g x m k p g + t m k x i j p b ] ,
Picking cannot begin before the container arrives from the depot.
( b ) ( j : z b j = 1 ) ( i : t i j 0 ) ( p ) [ x i j p b z b j s b ] ,
There is always sufficient time for container travel between buffers, i.e., consider the travel time from buffer to buffer for the container in one direction on the conveyor or round-trip beyond the depot to come to any previous buffers.
( i ) ( j , k : j k , t i j 0 , t i k 0 ) ( b , g : b g , z b j = 1 , z g k = 1 ) [ max p = 1 , , W ( x i j p b + t i j ) + r b g min p = 1 , , W x i k p g max p = 1 , , W ( x i k p g + t i k ) + r g b min p = 1 , , W x i j p b ] ,
The buffers will never run out of products.
( i ) ( j ) ( b ) [ p = 1 W y i j p b q b j ] ,
Enough products are picked.
( i ) ( j ) [ p = 1 W b = 1 R y i j p b = c i j ] ,
Decision variables:
Start time.
x i j p b = { 0 , Z + } ,
Quantity.
y i j p b = { 0 , Z + }

5. Experiment

The goal of the computational experiment was to evaluate the possibility of commercial tools such as the CPLEX solver to solve the defined order-picking problem on different-size instances.
SQL Server 2019.0150.2000.05 and SQL Server Management Studio 15.0.18424.0 were used for the experiments.
The solver version was IBM ILOG CPLEX Optimization Studio Version: 12.10.0.0
The computing stations parameters:
CPU: AMD Ryzen 5 1600
RAM: 16 GB
Operation system: Windows 10 64-bit
The 30 test instances created for the experiment are listed in Table 1. Each of the distribution center layouts included ten examples. The layouts of the distribution centers are seen in Figure 2, Figure 3 and Figure 4. In the six buffers, there were 120 main and 8 repeating locations. The product is stored in one, two, or three locations. A total of 85 products are stored only in one location, while 22 products are stored in two locations and 13 products are stored in three locations. There were five orders in each instance generated. There were 1…5 products randomly generated to be picked into the container. There were six, four, eight pickers in distribution center layouts.
Table 1. Test data.
Table 2 presents the results of the solution of the proposed OPP by CPLEX. There were 43,200, 28,800, 57,600 variables in each of the distribution center layouts. The time limit for CPLEX was set to 300 s. There were 2.2 million, 3.3 million, 2.9 million constraints in each of the distribution center layouts. One of the thirty instances was solved optimally. For the rest of the instances, the search was terminated by the time limit.
Table 2. Instances, characteristics, and results calculated by CPLEX.
For the first distribution center layout, the result was far from the lower bound one with an average 44.91%, varying from 0.00% to 100.00%. For the second distribution center layout, the result was far from the lower bound one with an average 54.97%, varying from 29.29% to 69.12%. For the third distribution center layout, the result was far from the lower bound one with an average 63.00%, varying from 39.51% to 100.00%.
Table 3 presents the solution time for the 300 s CPLEX time limit.
Table 3. Solution time within the 300 s time limit.
Table 3 also shows that for four of the thirty instances, the solution was worse than the lower bound 100.00%. Therefore, we decided to increase the time limit to 600 s. Table 4 presents the results of the solution of the proposed OPP by CPLEX with an increased time limit. For two instances, the result improved to 41.69% and 29.10%, but for another two instances, it was the same, and it was worse than the lower bound 100.00%.
Table 4. Instances calculated by CPLEX with an increased time limit.
Table 5 presents the solution time for the 600 s CPLEX time limit.
Table 5. Solution time is within the 600 s time limit.
We tried to increase the number of products in the order from 1…5 to 1…10 for the same number of orders (which equals 5), but no solution was found after 80 min.
Our strategy involved increasing the quantity of orders from 5 to 10 for the same number of products in the order (which was selected randomly 1…5), but OplRun was not responding after 10 min.
This evidence confirms that CPLEX is an excellent tool for solving small instances of logistic order-picking problems. But for medium and large logistic data, new efficient heuristics are required.

6. Discussion and Application of the Proposed Model

The subject of analysis is the assembly line of furniture fittings, such as hinges, screws, dowels, etc. The assembly warehouse is divided into zones according to assortment groups. The assembly order is related to the type of furniture (wardrobe, desk) and requires collecting all necessary elements for the specified number of pieces of furniture according to the specification. The fittings are assembled in containers and delivered to the final assembly zone for products (this area is not subject to analysis).
Transport installation is a system of chain conveyors on which containers move between picking zones. The conveyor system consists of modules, each of which is powered by a 1.5 kW motor. A single module can have a maximum length of 10 m. The electricity consumption depends on the length of the module and its level of load. The maximum electricity consumption is designed for the maximum length of the conveyor under full load. To simplify the calculations, it has been assumed and confirmed by direct measurement of consumption in the production workshop that each working meter of the conveyor requires 110 W of power. The total length of the conveyor system is 95 m. The total power of the conveyor system is 10.45 kW. The conveyors operate continuously, and the conveyor speed is 20 m/min. As a result, the travel time of a single container through the entire transport line, if it does not have to stop, is 285 s. Such a sample trip consumes 0.827 kWh of electricity. For each second of operation, the system is estimated to require approximately 0.003 kWh of electricity. Of course, the picking line also includes other types of devices besides the conveyor system that consume electricity. These include electronic monitoring devices, lighting, container detection, and protection mechanisms. In total, it can be assumed that the operation of the entire picking line is associated with an energy consumption of 0.005 kWh/s. Using this value, it is possible to determine the energy savings resulting from better queue management.
Order picking is the core process of every automatic system. Some researchers also pay attention to energy consumption in order-picking systems, as this is a crucial factor for the distribution center and warehouse decision-makers.
The primary elements of the order-picking system, such as item qualities, product popularity, order identities, and physical shelf and location dimensions, all affect how much time and energy are expended [55].
Battini et al. (2016) [55] included energy consumption in the function that determined the overall order-picking time. They based it on the concept of the rest allowance formulation, which changed the rate of energy expenditure into an equivalent time value. This method enabled the estimation of the amount of additional rest time needed to maintain a low degree of fatigue. Battini et al. (2016) [55] concluded that the energy expenditure rate is important during picking since the metabolic cost is considerable and the time required to complete a pick is relatively short. In contrast, walking often uses less energy but takes longer [55].
Gajšek et al. (2021) [56] investigated a multi-objective model based on binary integer linear programming, which they used to solve a storage assignment problem and a solution that took order-picking time, energy consumption, and health risk into account. In order to support these initiatives, their study compared the outcomes of several single-objective and multi-objective functions while taking into account the time, energy, and health risk criteria [56].
In the research by Ebrahimi et al. (2015) [57], a mixed-integer linear model for a picker-to-parts system with rapid charging technology was provided. Two minimization objective functions, energy consumption, and order tardiness, were examined as part of the model. The suggested model resolved the order batching, batch assignment, batch sequencing, and forklift routing issues along with the battery charge schedule of electric forklifts [57].
Zhang et al. (2016) [49] worked on the task of grouping dynamically arriving orders into selecting batches and allocated them to the right pickers so that most orders may be fulfilled in the shortest amount of time. Extensive numerical studies provided by Zhang et al. (2016) [49] showed that urgent algorithms can result in a significant increase in the number of delivered orders, highlighting the significance of order batching and delivery integration.
The experiments conducted by Yu and de Koster (2009) [47] with various input parameters, such as setup time at pick zones, various order arrival rates to the systems, and various order arrival distributions, have revealed that an ideal batch size always exists and that batch size has a significant impact on the mean order throughput time [47].
This research can enrich the methods of order-picking processes in warehouses and distribution centers in terms of energy minimization as well as improving batching processes.
The results of our research showed that depending on the adopted center layout, the average results were worse than the optimal solution by 44.91% to 63%. Only in a few cases, it was not possible to find solutions within 300 s of calculations that were at most twice as bad as the optimal solution. It can be completely justified that a randomly chosen solution, without using optimization methods, will not provide a completion time smaller than twice the optimal solution. This means that for a single 8 h shift in the distribution center, it is possible to save 37% of task completion time, which amounts to 10,656 s of work on the entire picking line and saves 53.28 kWh of electrical energy. Time savings will vary depending on specific input data and the current load on the picking line.
The proposed model, due to its simplicity and speed of operation, could be applied to both large and small logistic systems, including production. Although individual energy savings for a single conveyor line may not seem significant to decision-makers, the cumulative value of these savings could have a noticeable impact on the overall economy, understood as a whole process of logistics in the economy, according to the authors.

7. Conclusions

Green logistics were focused on using supply chain management techniques that have a lower negative impact on the environment (on air, water, and land) and reduce overall health concerns.
Sustainable order picking can boost the economic performance of the logistic centers. The efficient management of order picking in distribution centers allows for improvement:
  • Time-efficient working methods for order pickers reduce the number of heaping tasks for pickers and idle time.
  • Sustainable transport of containers between different picking zones in the logistic centers reduces the containers’ distance travel, conveyor’s energy consumption, and emission.
  • Sustainable order-picking operations that cut resource usage on operating expenses such as time and operating expenses, which results in decreasing CO2 emission.
Adapting green trends to warehousing delivers a quick return on investment (ROI) as well as longer-term global advantages while meeting stakeholders’ expectations.
Using available optimization software such as IBM ILOG CPLEX Optimization Studio Version: 12.10.0.0, numerical experiments conducted on different problem sizes demonstrate that the developed model could be solved. The acquired findings demonstrate, from a sustainable management perspective, that the suggested order-picking problem model allows obtaining solutions that surpass the business’s order-completing strategy.
In order to pick problems in distribution centers and warehouses, the proposed model can help with the decision-making process for picking items to order assignment and picker scheduling. It may also offer managerial guidance for other labor-intensive service-oriented companies.
The contributions of the paper are the following:
  • the proposed model’s simplicity and potential for use allow for improving production and logistics systems;
  • the proposed solution to the order-picking problem impacts operational efficiency and cost reduction, which affects the long-term competitiveness in the market;
  • adopting sustainable practices aligns a business with the expanding trends toward environmental responsibility and resource conservation, positioning it for long-term success;
  • the contemporary logistical challenges and may be of interest to readers.
Here are some of the key limitations of our study that impact the practical applicability of the research:
  • the developed mathematical model was solved using a commercial solver without the advanced solution algorithm;
  • the study is rather theoretical, emphasizing the model, the discussion of the problem, and highlighting future directions.
Further study should concentrate on expanding our model to an integrated version that takes into account the picking and packing activities concurrently because these operations seem to be connected. It would be beneficial to model and contrast the various sorting systems used in e-commerce warehouses.

Author Contributions

Conceptualization, K.C. and R.W.; methodology, K.C. and R.W.; software, K.C.; validation, K.C. and K.Ż.; formal analysis, R.W.; investigation, K.C.; resources, K.C., R.W. and K.Ż.; data curation, K.C. and R.W.; writing—original draft preparation, K.C.; writing—review and editing, K.C. and R.W.; visualization, K.C.; supervision, R.W. and K.Ż.; project administration, K.Ż.; funding acquisition, K.Ż. All authors have read and agreed to the published version of the manuscript.

Funding

The project is co-financed by The European Union under the European Regional Development Fund program under the Intelligent Development Program. The project is carried out as part of The National Center for Research and Development: Program “Szybka ścieżka” (project no. POIR.01.01.01-00-0352/22).

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

References

  1. Teng, Z.; He, Y.; Wu, R. E-Commerce: Does Sustainable Logistics Development Matter? Sustainability 2023, 15, 579. [Google Scholar] [CrossRef]
  2. Richards, G. Warehouse Management: A Complete Guide to Improving Efficiency and Minimizing Costs in The Modern Warehouse, 3rd ed.; Kogan Page Limited: London, UK, 2018. [Google Scholar]
  3. Cuatrecasas-Arbós, L.; Fortuny-Santos, J.; Ruiz-De-Arbulo-López, P.; Vintró-Sanchez, C. Monitoring Processes through Inventory and Manufacturing Lead Time. Ind. Manag. Data Syst. 2015, 115, 951–970. [Google Scholar] [CrossRef]
  4. Nguyen, T.H.; Wright, M. Capacity and Lead-Time Management When Demand for Service Is Seasonal and Lead-Time Sensitive. Eur. J. Oper. Res. 2015, 247, 588–595. [Google Scholar] [CrossRef]
  5. Ahmadi, T.; Atan, Z.; de Kok, T.; Adan, I. Optimal Control Policies for an Inventory System with Commitment Lead Time. Nav. Res. Logist. 2019, 66, 193–212. [Google Scholar] [CrossRef]
  6. Hellemans, T.; Boute, R.N.; Van Houdt, B. Analysis of Lead Time Correlation under a Base-Stock Policy. Eur. J. Oper. Res. 2019, 276, 519–535. [Google Scholar] [CrossRef]
  7. Utiyama, M.H.R.; Godinho Filho, M.; Oprime, P.C. An Alternative for Improving Setup Times and Time between Failures Aiming at Manufacturing Lead Time Reduction. Prod. Eng. 2021, 15, 651–665. [Google Scholar] [CrossRef]
  8. Guo, X.; He, Y. Mathematical Modeling and Optimization of Platform Service Supply Chains: A Literature Review. Mathematics 2022, 10, 4307. [Google Scholar] [CrossRef]
  9. Hultkrantz, O.; Lumsden, K. E-Commerce and Consequences for the Logistics Industry. In Proceedings of the Seminar on “The Impact of E-Commerce on Transport”, Paris, France, 5–6 June 2001; pp. 1–15. [Google Scholar]
  10. De Koster, R.B.M. The Logistics Behind the Enter Click. In Quantitative Approaches to Distribution Logistics and Supply Chain Management; Springer: Berlin/Heidelberg, Germany, 2002; pp. 131–148. [Google Scholar] [CrossRef]
  11. Gong, Y.; De Koster, R. A Polling-Based Dynamic Order Picking System for Online Retailers. IIE Trans. Inst. Ind. Eng. 2008, 40, 1070–1082. [Google Scholar] [CrossRef]
  12. Stecke, K.E.; Zhao, X. Production and Transportation Integration for a Make-to-Order Manufacturing Company with a Commit-to-Delivery Business Mode. Manuf. Serv. Oper. Manag. 2007, 9, 206–224. [Google Scholar] [CrossRef]
  13. Ren, J.; Ye, C.; Li, Y. A Two-Stage Optimization Algorithm for Multi-Objective Job-Shop Scheduling Problem Considering Job Transport. J. Eur. Syst. Autom. 2020, 53, 915–924. [Google Scholar] [CrossRef]
  14. Revillot-Narváez, D.; Pérez-Galarce, F.; Álvarez-Miranda, E. Optimising the Storage Assignment and Order-Picking for the Compact Drive-in Storage System. Int. J. Prod. Res. 2020, 58, 6949–6969. [Google Scholar] [CrossRef]
  15. Bhattacharjya, J.; Ellison, A.; Tripathi, S. An Exploration of Logistics-Related Customer Service Provision on Twitter: The Case of e-Retailers. Int. J. Phys. Distrib. Logist. Manag. 2016, 46, 659–680. [Google Scholar] [CrossRef]
  16. Ali, S.S.; Kaur, R.; Khan, S. Evaluating Sustainability Initiatives in Warehouse for Measuring Sustainability Performance: An Emerging Economy Perspective. Ann. Oper. Res. 2023, 324, 461–500. [Google Scholar] [CrossRef]
  17. Chiang, T.A.; Che, Z.H.; Hung, C.W. A K-Means Clustering and the Prim’s Minimum Spanning Tree-Based Optimal Picking-List Consolidation and Assignment Methodology for Achieving the Sustainable Warehouse Operations. Sustainability 2023, 15, 3544. [Google Scholar] [CrossRef]
  18. World Economic Forum. Supply Chain Decarbonization. 2009. Available online: https://www3.weforum.org/docs/WEF_LT_SupplyChainDecarbonization_Report_2009.pdf (accessed on 23 June 2023).
  19. Carli, R.; Dotoli, M.; Digiesi, S.; Facchini, F.; Mossa, G. Sustainable Scheduling of Material Handling Activities in Labor-Intensive Warehouses: A Decision and Control Model. Sustainability 2020, 12, 3111. [Google Scholar] [CrossRef]
  20. Kinoshita, Y.; Nagao, T.; Ijuin, H.; Nagasawa, K.; Yamada, T.; Gupta, S.M. Utilization of Free Trade Agreements to Minimize Costs and Carbon Emissions in the Global Supply Chain for Sustainable Logistics. Logistics 2023, 7, 32. [Google Scholar] [CrossRef]
  21. Choi, T.-M.; Govindan, K.; Li, X.; Li, Y. Innovative Supply Chain Optimization Models with Multiple Uncertainty Factors. Ann. Oper. Res. 2017, 257, 1–14. [Google Scholar] [CrossRef]
  22. Malesios, C.; Dey, P.K.; Abdelaziz, F. Ben Supply Chain Sustainability Performance Measurement of Small and Medium Sized Enterprises Using Structural Equation Modeling. Ann. Oper. Res. 2020, 294, 623–653. [Google Scholar] [CrossRef]
  23. Bai, C.; Satir, A.; Sarkis, J. Investing in Lean Manufacturing Practices: An Environmental and Operational Perspective. Int. J. Prod. Res. 2019, 57, 1037–1051. [Google Scholar] [CrossRef]
  24. Fedorko, G.; Molnár, V.; Mikušová, N. The Use of a Simulation Model for High-Runner Strategy Implementation in Warehouse Logistics. Sustainability 2020, 12, 9818. [Google Scholar] [CrossRef]
  25. Ferraro, S.; Cantini, A.; Leoni, L.; De Carlo, F. Sustainable Logistics 4.0: A Study on Selecting the Best Technology for Internal Material Handling. Sustainability 2023, 15, 7067. [Google Scholar] [CrossRef]
  26. Vazquez-Noguerol, M.; Comesaña-Benavides, J.; Poler, R.; Prado-Prado, J.C. An Optimisation Approach for the E-Grocery Order Picking and Delivery Problem. Cent. Eur. J. Oper. Res. 2022, 30, 961–990. [Google Scholar] [CrossRef]
  27. Brandenburg, M.; Rebs, T. Sustainable Supply Chain Management: A Modelling Perspective. Ann. Oper. Res. 2015, 229, 213–252. [Google Scholar] [CrossRef]
  28. Mangla, S.K.; Luthra, S.; Rich, N.; Kumar, D.; Rana, N.P.; Dwivedi, Y.K. Enablers to Implement Sustainable Initiatives in Agri-Food Supply Chains. Int. J. Prod. Econ. 2018, 203, 379–393. [Google Scholar] [CrossRef]
  29. Jayarathna, C.P.; Agdas, D.; Dawes, L. Exploring Sustainable Logistics Practices toward a Circular Economy: A Value Creation Perspective. Bus. Strategy Environ. 2023, 32, 704–720. [Google Scholar] [CrossRef]
  30. Berg, J.P.V.D.; Zijm, W.H.M. Models for Warehouse Management: Classification and Examples. Int. J. Prod. Econ. 1999, 59, 519–528. [Google Scholar] [CrossRef]
  31. Fosso Wamba, S.; Takeoka Chatfield, A. The Impact of RFID Technology on Warehouse Process Innovation: A Pilot Project in the TPL Industry. Inf. Syst. Front. 2011, 13, 693–706. [Google Scholar] [CrossRef]
  32. Cao, W.; Jiang, P.; Liu, B.; Jiang, K. Real-Time Order Scheduling and Execution Monitoring in Public Warehouses Based on Radio Frequency Identification. Int. J. Adv. Manuf. Technol. 2018, 95, 2473–2494. [Google Scholar] [CrossRef]
  33. Hsieh, L.F.; Tsai, L. The Optimum Design of a Warehouse System on Order Picking Efficiency. Int. J. Adv. Manuf. Technol. 2006, 28, 626–637. [Google Scholar] [CrossRef]
  34. 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]
  35. Kłodawski, M.; Jacyna, M.; Lewczuk, K.; Wasiak, M. The Issues of Selection Warehouse Process Strategies. Procedia Eng. 2017, 187, 451–457. [Google Scholar] [CrossRef]
  36. Thomas, L.M.; Meller, R.D. Developing Design Guidelines for a Case-Picking Warehouse. Int. J. Prod. Econ. 2015, 170, 741–762. [Google Scholar] [CrossRef]
  37. Roodbergen, K.J.; Vis, I.F.A.; Taylor, G.D. Simultaneous Determination of Warehouse Layout and Control Policies. Int. J. Prod. Res. 2015, 53, 3306–3326. [Google Scholar] [CrossRef]
  38. Haouassi, M.; Kergosien, Y.; Mendoza, J.E.; Rousseau, L.M. The Integrated Orderline Batching, Batch Scheduling, and Picker Routing Problem with Multiple Pickers: The Benefits of Splitting Customer Orders. Flex. Serv. Manuf. J. 2022, 34, 614–645. [Google Scholar] [CrossRef]
  39. Shqair, M.; Altarazi, S.; Al-Shihabi, S. A Statistical Study Employing Agent-Based Modeling to Estimate the Effects of Different Warehouse Parameters on the Distance Traveled in Warehouses. Simul. Model. Pract. Theory 2014, 49, 122–135. [Google Scholar] [CrossRef]
  40. Ries, J.M.; Grosse, E.H.; Fichtinger, J. Environmental Impact of Warehousing: A Scenario Analysis for the United States. Int. J. Prod. Res. 2017, 55, 6485–6499. [Google Scholar] [CrossRef]
  41. Brynzér, H.; Johansson, M.I. Storage Location Assignment: Using the Product Structure to Reduce Order Picking Times. Int. J. Prod. Econ. 1996, 46–47, 595–603. [Google Scholar] [CrossRef]
  42. Chen, M.C.; Huang, C.L.; Chen, K.Y.; Wu, H.P. Aggregation of Orders in Distribution Centers Using Data Mining. Expert Syst. Appl. 2005, 28, 453–460. [Google Scholar] [CrossRef]
  43. De Koster, R.B.M.; Johnson, A.L.; Roy, D. Warehouse Design and Management. Int. J. Prod. Res. 2017, 55, 6327–6330. [Google Scholar] [CrossRef]
  44. Gu, J.; Goetschalckx, M.; McGinnis, L.F. Research on Warehouse Operation: A Comprehensive Review. Eur. J. Oper. Res. 2007, 177, 1–21. [Google Scholar] [CrossRef]
  45. Gray, A.E.; Karmarkar, U.S.; Seidmann, A. Design and Operation of an Order-Consolidation Warehouse: Models and Application. Eur. J. Oper. Res. 1992, 58, 14–36. [Google Scholar] [CrossRef]
  46. De Koster, R.B.M.; 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]
  47. 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]
  48. Pietri, N.O.; Chou, X.; Loske, D.; Klumpp, M.; Montemanni, R. The Buy-Online-Pick-up-in-Store Retailing Model: Optimization Strategies for in-Store Picking and Packing. Algorithms 2021, 14, 350. [Google Scholar] [CrossRef]
  49. Zhang, J.; Wang, X.; Huang, K. Integrated On-Line Scheduling of Order Batching and Delivery under B2C e-Commerce. Comput. Ind. Eng. 2016, 94, 280–289. [Google Scholar] [CrossRef]
  50. Tompkins, J.A.; White, J.A.; Bozer, Y.A.; Tanchoco, J.M.A. Facilities Planning, 4th ed.; Wiley & Sons: Hoboken, NJ, USA, 2014. [Google Scholar]
  51. Isler, C.A.; Righetto, G.M.; Morabito, R. Optimizing the Order Picking of a Scholar and Office Supplies Warehouse. Int. J. Adv. Manuf. Technol. 2016, 87, 2327–2336. [Google Scholar] [CrossRef]
  52. Lou, Z.; Jie, W.; Zhang, S. Multi-Objective Optimization for Order Assignment in Food Delivery Industry with Human Factor Considerations. Sustainability 2020, 12, 7955. [Google Scholar] [CrossRef]
  53. Klumpp, M.; Loske, D. Order Picking and E-Commerce: Introducing Non-Parametric Efficiency Measurement for Sustainable Retail Logistics. J. Theor. Appl. Electron. Commer. Res. 2021, 16, 846–858. [Google Scholar] [CrossRef]
  54. Ceynowa, W.; Przybylowski, A.; Wojtasik, P.; Ciskowski, Ł. ICT Adoption for Sustainable Logistics Development in the HoReCa and Wholesale Sectors. Sustainability 2023, 15, 3746. [Google Scholar] [CrossRef]
  55. Battini, D.; Glock, C.H.; Grosse, E.H.; Persona, A.; Sgarbossa, F. Human Energy Expenditure in Order Picking Storage Assignment: A Bi-Objective Method. Comput. Ind. Eng. 2016, 94, 20. [Google Scholar] [CrossRef]
  56. Gajšek, B.; Šinko, S.; Kramberger, T.; Butlewski, M.; Özceylan, E.; Đukić, G. Towards Productive and Ergonomic Order Picking: Multi-Objective Modeling Approach. Appl. Sci. 2021, 11, 4179. [Google Scholar] [CrossRef]
  57. Ebrahimi, A.; Jeon, H.W.; Jung, S.Y. Improving Energy Consumption and Order Tardiness in Picker-to-Part Warehouses with Electric Forklifts: A Comparison of Four Evolutionary Algorithms. Sustainability 2023, 15, 551. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.