Learn R Programming

warehouseTools (version 0.1.2)

Heuristics for Solving the Traveling Salesman Problem in Warehouse Layouts

Description

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. .

Copy Link

Version

Install

install.packages('warehouseTools')

Monthly Downloads

181

Version

0.1.2

License

GPL-3

Maintainer

Andrzej Dudek

Last Published

December 9th, 2024

Functions in warehouseTools (0.1.2)

parity_full_s

Check Parity of Sequences
create_arcs

Create Arcs from Coordinates
count_by_sequence

Count Sequential Occurrences in a Vector
chart_warehouse_route

Plot Warehouse Route with Coordinates and Arcs usually returned by heuristic
copras_assignment

COPRAS Method for Selection of Locations in a Warehouse
iopoint_distance

Calculate IO Point Distance
nr_neighbors

Calculate the Number of Neighbors for a Warehouse Location
rectangular_warehouse_from_copras_locations

Create a Rectangular Warehouse Layout from COPRAS Locations
semi_optimal_heuristic

Semi-Optimal Heuristic for the Picker’s Route Designation
return_heuristic

Return Heuristic for the Picker’s Route Designation
midpoint_heuristic

Midpoint Heuristic for the Picker’s Route Designation
generate_sample_goods_and_locatons_scenario

Generate Sample Goods and Locations Scenario for a Warehouse
add_id_to_arcs

Add Unique IDs to Arcs
create_tour_graph

Create a Tour Graph for Warehouse Aisles
find_reduced_with

Find Reduced Warehouse Width
edges_from_aisle

Retrieve Edges from an Aisle
delete_empty_final_aisles

Delete Empty Final Aisles from Arcs
optimize_aisles

Optimize Aisles for Warehouse Layout
add_io_points

Add I/O Points to the Warehouse Arcs
sshape_heuristic

S-Shape Heuristic for the Picker’s Route Designation