Nothing
warehouseTools: 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>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Andrzej Dudek [aut, cre] (<https://orcid.org/0000-0002-4943-8703>), Krzysztof Dmytrów [aut] (<https://orcid.org/0000-0001-7657-6063>) |
| Maintainer | Andrzej Dudek <andrzej.dudek@ue.wroc.pl> |
| License | GPL-3 |
| Version | 0.1.2 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the warehouseTools package in your browser
Any scripts or data that you put into this service are public.
