Order Picking Optimization Based on a Picker Routing Heuristic: Minimizing Total Traveled Distance in Warehouses

Order Picking Optimization Based on a Picker Routing Heuristic: Minimizing Total Traveled Distance in Warehouses

Jose Alejandro Cano
DOI: 10.4018/978-1-7998-1397-2.ch005
OnDemand:
(Individual Chapters)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This chapter details the performance evaluation of routing policies and proposes a routing heuristic to determine the minimum traveled distance for different warehouse configurations and pick-list sizes. Numerical experiments are performed considering warehouse configurations used in literature and list sizes are chosen proportional to the number of storage positions of each layout. The proposed heuristic method was shown to reduce the distance traveled by 7% for the evaluated instances. Furthermore, travel distance reductions of up to 30% were found in cases involving large warehouse and pick-list sizes. The proposed heuristic therefore is concluded to provide a more efficient solution than individual routing policies for the picker routing problem.
Chapter Preview
Top

Introduction

Warehouses are responsible for efficiently retrieving customers' orders and managing inventory in a supply chain (Albareda-Sambola, Alonso-Ayuso, Molina, & De Blas, 2009). Likewise, warehouse management has a great influence on logistical costs, both in investment and direct operational costs (Chen, Cheng, Chen, & Chan, 2015). As such, warehouse optimization is of vital importance. In modern warehouses and distribution centers, it is common to receive a large variety of orders daily with a wide range of items to be delivered in quantities as small as one or two units per item (Bozer & Kile, 2008). Furthermore, the rapid development of business-to-consumer (B2C) e-commerce has focused attention on warehouse operation efficiency and requires increased availability of a wide range of products and a processing capacity of large quantities of daily orders (Li, Huang, & Dai, 2017). Overall, a company’s success is determined by their ability to respond to competitive markets with the right products at the right time (Roodbergen, Vis, & Taylor, 2015).

Additionally, warehouses and distribution centers often adjust or equalize sales offers in line with demand, thus soothing demand, consolidating and packaging products, and planning distribution activities (Manzini, Bozer, & Heragu, 2015). Business competitiveness requires continuous improvement in the design and operation of distribution networks, thus implying improved warehouse performance (Gu, Goetschalckx, & McGinnis, 2007), since efficiency and effectiveness within any distribution network is determined to a large extent by the operation of warehouses that must process diverse products and items, using limited picking vehicles (Cheng, Chen, Chen, & Yoo, 2015).

For this reason, this chapter aims to reduce the total traveled distance in warehouses for the order picking process through an easy-to-implement method that provide efficient solutions in very short computing time, so that programming and integration with information systems in companies such as warehouse management systems (WMS) and enterprise resource planning (ERP) can be feasible. Planning and controlling warehouse operations are crucial to the efficiency of supply chains, as poor performance results in unsatisfactory service and high logistics costs (Koch & Wäscher, 2016). To address these challenges, it is required to improve key factors affecting warehouse's efficiency, such as warehouse design, storage location, and warehouse operation (Li et al., 2017). Warehouse design involves many important strategic decisions, such as the general structure of the warehouse, the size of the warehouse and its departments, the distribution of spaces within each department (layout), the selection of storage equipment, and the selection of operational strategies, as summarized in Figure 1 (Gu, Goetschalckx, & McGinnis, 2010). Decisions on warehouse design are considered strategic and have been widely addressed by researchers aiming to minimize costs and operating time and increase the overall performance of the supply chain (Manzini et al., 2015).

Figure 1.

Warehouse design process

978-1-7998-1397-2.ch005.f01

However, the modification of warehouse design and storage location is difficult and requires a high level of investment to change once operational, and is thus a costly way to increase storage productivity (Li et al., 2017). Rather, it is generally advised to focus on first increasing productivity with less radical methods, including the optimization of warehouse operations (Centeno & Sundaram, 2004; Chen, Huang, Chen, & Wu, 2005). As detailed in Figure 2, the main warehouse operations that define the flow of products are receiving products from suppliers, slotting and putting away the received products (Gómez-Montoya, Cano, & Campo, 2018), storage assignment, order picking, sorting and assembling orders (Rojas, Guisao, & Cano, 2011), and shipping, packing, and pallet loading (Salazar, Gomez, & Cano, 2017).

Key Terms in this Chapter

Picker Routing Problem: Is the problem in which the traveled distance by a picker in a tour is minimized.

Routing Policy: Is a technique used to make routing decisions in warehouses and distribution centers based on policies set by logical procedures

Manhattan Distance: The distance between two points measured along axes at right angles.

Picking Aisle: Is an aisle in a warehouse containing picking locations, i.e., containing storage locations with items to be picked

Heuristic: Is any approach to problem-solving that employs a practical method, sufficient for reaching an immediate goal within reasonable computing times. A heuristic does not guarantee an optimal solution.

Pick List: A set of order lines, where each line denotes an item requested by a customer, the location in the warehouse, and the quantity of such item.

Order Picking: Is the process in which the items that were ordered by customers are selected from the warehouse.

Traveling Salesman Problem: A problem formulated to find the shortest possible route to visit a given a list of storage positions in a warehouse or distribution center and returning to the depot.

Complete Chapter List

Search this Book:
Reset