Heuristics for Solving the Traveling Salesman Problem in Warehouse Layouts

Heuristic methods to solve the routing problems in a warehouse management. Package includes several heuristics such as the Midpoint, Return, S-Shape and Semi-Optimal Heuristics for designation of the picker’s route in order picking. The heuristics aim to provide the acceptable travel distances while considering warehouse layout constraints such as aisles and shelves. It also includes implementation of the COPRAS (COmplex PRoportional ASsessment) method for supporting selection of locations to be visited by the picker in shared storage systems. The package is designed to facilitate more efficient warehouse routing and logistics operations. see: Bartholdi, J. J., Hackman, S. T. (2019). "WAREHOUSE & DISTRIBUTION SCIENCE. Release 0.98.1." The Supply Chain & Logistics Institute. H. Milton Stewart School of Industrial and Systems Engineering. Georgia Institute of Technology. < https://www.warehouse-science.com/book/editions/wh-sci-0.98.1.pdf>.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("warehouseTools")

0.1.4 by Andrzej Dudek, a year ago


Browse source code at https://github.com/cran/warehouseTools


Authors: Andrzej Dudek [aut, cre] (ORCID: , Krzysztof Dmytrów [aut] (ORCID:


Documentation:   PDF Manual  


GPL-3 license


Imports dplyr, clusterSim

Suggests graphics, testthat


See at CRAN