Welcome to the InfoSci Platform
Reference Hub1
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
Copyright: © 2020 |Pages: 23
ISBN13: 9781799813972|ISBN10: 1799813975|EISBN13: 9781799813989
DOI: 10.4018/978-1-7998-1397-2.ch005
Cite Chapter Cite Chapter

MLA

Cano, Jose Alejandro. "Order Picking Optimization Based on a Picker Routing Heuristic: Minimizing Total Traveled Distance in Warehouses." Handbook of Research on the Applications of International Transportation and Logistics for World Trade, edited by Gökçe Çiçek Ceyhun, IGI Global, 2020, pp. 74-96. https://doi.org/10.4018/978-1-7998-1397-2.ch005

APA

Cano, J. A. (2020). Order Picking Optimization Based on a Picker Routing Heuristic: Minimizing Total Traveled Distance in Warehouses. In G. Ceyhun (Ed.), Handbook of Research on the Applications of International Transportation and Logistics for World Trade (pp. 74-96). IGI Global. https://doi.org/10.4018/978-1-7998-1397-2.ch005

Chicago

Cano, Jose Alejandro. "Order Picking Optimization Based on a Picker Routing Heuristic: Minimizing Total Traveled Distance in Warehouses." In Handbook of Research on the Applications of International Transportation and Logistics for World Trade, edited by Gökçe Çiçek Ceyhun, 74-96. Hershey, PA: IGI Global, 2020. https://doi.org/10.4018/978-1-7998-1397-2.ch005

Export Reference

Mendeley
Favorite

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.