optiMdepoT
Loading

Configure the Warehouse Layout,
See the Route Instantly

Work with much larger warehouse sizes on the Standard plan: more aisles, blocks and locations. With 500 calculations per day, it covers most of your needs.

500 calculations per dayMax. 10 aisles · 2 blocks · 15 locations

Route Strategies

On the Standard plan you can use the Optimal, Aisle-by-Aisle S-Shape, Block-by-Block S-Shape, Nearest Neighbor and Brute Force algorithms for up to 500 calculations per day. Other strategies will be added soon.

Active
Optimal
Dynamic Programming · Shortest
Uses dynamic programming that covers all possibilities to find the route with the shortest total distance.
Active
Aisle-by-Aisle S-Shape
Heuristic · Fast
Handles the aisles in order; in each aisle it chooses which cross aisle to enter and exit through so that the total walking distance is minimized.
Active
Block-by-Block S-Shape
Heuristic · Fast
Proceeds block by block: it zigzags through only the aisles that contain items.
Active
Nearest Neighbor
Heuristic · Very Fast
Goes from its current position to the nearest location to be picked. Simple and very fast, but the route is usually longer than the optimal one.
Active
Brute Force
All Sequences · Small Warehouses
Tries every visiting sequence of the selected locations one by one (up to 11 locations) and picks the shortest.
🔒 Coming Soon
Midpoint, Largest Gap, Return
Heuristic Strategies
Additional aisle strategies will be added soon — they will provide comparative results for different warehouse layouts.

Note: The algorithms are based on academic papers by Ratliff and Rosenthal and by Roodbergen and de Koster (paper 1, paper 2 and paper 3).

Set the warehouse size, select order locations from the racks and see the shortest route within seconds. From the right panel you can also run visual analysis with the distance indicator and heat map.

optiMdepoT — Control PanelStandard
Aisle Direction
Warehouse Dimensions
Input/Output Point (I/O)
Assign Random Locations max 100
Selected Locations (0)
No locations selected yet
Visual Analysis
Show Distance
Distance Heat Map
Route Planning
Optimal
Aisle-by-Aisle S-Shape
Block-by-Block S-Shape
Nearest Neighbor
Brute Force

Move to Integration

Integrate with your own system and get completely unlimited, programmatic access.

Explore Integration← Back to Home