Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Picker Routing Problem

Chapter 5
Handbook of Research on the Applications of International Transportation and Logistics for World Trade
Is the problem in which the traveled distance by a picker in a tour is minimized.
Published in Chapter:
Order Picking Optimization Based on a Picker Routing Heuristic: Minimizing Total Traveled Distance in Warehouses
Jose Alejandro Cano (Universidad de Medellín, Colombia)
Copyright: © 2020 |Pages: 23
DOI: 10.4018/978-1-7998-1397-2.ch005
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.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR