This paper evaluates various routing policies (s-shape, largest gap, return and composite policies) and introduces a novel heuristic called Minimum Heuristic (MinH) to solve the picker routing problem. The performance of the routing policies and the MinH heuristic is validated by an experimental design, varying the number of aisles, locations per aisle and pick list size. The experimental results show the travel distance savings of MinH heuristic over routing policies, highlighting that for all of the instances, the MinH heuristic performs 14,3% better than the existing routing policies.
An Evaluation of Picking Routing Policies to Improve Warehouse Efficiency
J. A. Cano,Alexánder A. Correa-Espinal,R. Gómez-Montoya
Published 2017 in International Journal of Industrial Engineering and Management
ABSTRACT
PUBLICATION RECORD
- Publication year
2017
- Venue
International Journal of Industrial Engineering and Management
- Publication date
2017-12-30
- Fields of study
Business, Engineering, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-52 of 52 references · Page 1 of 1
CITED BY
Showing 1-28 of 28 citing papers · Page 1 of 1