Package: warehouseTools 0.1.2
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>.
Authors:
warehouseTools_0.1.2.tar.gz
warehouseTools_0.1.2.zip(r-4.5)warehouseTools_0.1.2.zip(r-4.4)warehouseTools_0.1.2.zip(r-4.3)
warehouseTools_0.1.2.tgz(r-4.4-any)warehouseTools_0.1.2.tgz(r-4.3-any)
warehouseTools_0.1.2.tar.gz(r-4.5-noble)warehouseTools_0.1.2.tar.gz(r-4.4-noble)
warehouseTools_0.1.2.tgz(r-4.4-emscripten)warehouseTools_0.1.2.tgz(r-4.3-emscripten)
warehouseTools.pdf |warehouseTools.html✨
warehouseTools/json (API)
| # Install 'warehouseTools' in R: |
| install.packages('warehouseTools', repos = c('https://a-dudek-ue.r-universe.dev', 'https://cloud.r-project.org')) |
This package does not link to any Github/Gitlab/R-forge repository. No issue tracker or development information is available.
Last updated 1 months agofrom:d7353f5249. Checks:7 OK. Indexed: yes.
| Target | Result | Latest binary |
|---|---|---|
| Doc / Vignettes | OK | Jan 09 2025 |
| R-4.5-win | OK | Jan 09 2025 |
| R-4.5-linux | OK | Jan 09 2025 |
| R-4.4-win | OK | Jan 09 2025 |
| R-4.4-mac | OK | Jan 09 2025 |
| R-4.3-win | OK | Jan 09 2025 |
| R-4.3-mac | OK | Jan 09 2025 |
Exports:chart_warehouse_routecopras_assignmentcreate_arcsgenerate_sample_goods_and_locatons_scenarioiopoint_distancemidpoint_heuristicnr_neighborsrectangular_warehouse_from_copras_locationsreturn_heuristicsemi_optimal_heuristicsshape_heuristic
Dependencies:ade4classcliclusterclusterSimdplyre1071fansigenericsgluelatticelifecyclemagrittrMASSpillarpixmappkgconfigproxyR6RcppRcppArmadillorlangsptibbletidyselectutf8vctrswithr
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| Plot Warehouse Route with Coordinates and Arcs usually returned by heuristic | chart_warehouse_route |
| COPRAS Method for Selection of Locations in a Warehouse | copras_assignment |
| Create Arcs from Coordinates | create_arcs |
| Generate Sample Goods and Locations Scenario for a Warehouse | generate_sample_goods_and_locatons_scenario |
| Calculate IO Point Distance | iopoint_distance |
| Midpoint Heuristic for the Picker’s Route Designation | midpoint_heuristic |
| Calculate the Number of Neighbors for a Warehouse Location | nr_neighbors |
| Create a Rectangular Warehouse Layout from COPRAS Locations | rectangular_warehouse_from_copras_locations |
| Return Heuristic for the Picker’s Route Designation | return_heuristic |
| Semi-Optimal Heuristic for the Picker’s Route Designation | semi_optimal_heuristic |
| S-Shape Heuristic for the Picker’s Route Designation | sshape_heuristic |
