R: Heuristics for Solving the Traveling Salesman Problem in Warehouse Layouts

# Heuristics for Solving the Traveling Salesman Problem in Warehouse Layouts

## Documentation for package ‘warehouseTools’ version 0.1.4

- DESCRIPTION file

## Help Pages

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
create_arcs | Create Arcs from Coordinates
dd_heuristic | Semi-Optimal Heuristic for the Picker’s Route Designation
generate_sample_goods_and_locatons_scenario | Generate Sample Goods and Locations Scenario for a Warehouse
iopoint_distance | Calculate IO Point Distance
midpoint_heuristic | Midpoint Heuristic for the Picker’s Route Designation
nr_neighbors | Calculate the Number of Neighbors for a Warehouse Location
rectangular_warehouse_from_copras_locations | Create a Rectangular Warehouse Layout from COPRAS Locations
return_heuristic | Return Heuristic for the Picker’s Route Designation
sshape_heuristic | S-Shape Heuristic for the Picker’s Route Designation