Man pages for warehouseTools
Heuristics for Solving the Traveling Salesman Problem in Warehouse Layouts
| add_id_to_arcs | Add Unique IDs to Arcs |
| add_io_points | Add I/O Points to the Warehouse Arcs |
| chart_warehouse_route | Plot Warehouse Route with Coordinates and Arcs usually... |
| copras_assignment | COPRAS Method for Selection of Locations in a Warehouse |
| count_by_sequence | Count Sequential Occurrences in a Vector |
| create_arcs | Create Arcs from Coordinates |
| create_tour_graph | Create a Tour Graph for Warehouse Aisles |
| delete_empty_final_aisles | Delete Empty Final Aisles from Arcs |
| edges_from_aisle | Retrieve Edges from an Aisle |
| find_reduced_with | Find Reduced Warehouse Width |
| 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 |
| optimize_aisles | Optimize Aisles for Warehouse Layout |
| parity_full_s | Check Parity of Sequences |
| rectangular_warehouse_from_copras_locations | Create a Rectangular Warehouse Layout from COPRAS Locations |
| return_heuristic | Return Heuristic for the Picker’s Route Designation |
| semi_optimal_heuristic | Semi-Optimal Heuristic for the Picker’s Route Designation |
| sshape_heuristic | S-Shape Heuristic for the Picker’s Route Designation |
