Optimal Route Planner
Validate routing inputs, calculate cable paths, and review why each route was selected.
Method & Assumptions
Optimal paths are computed using Dijkstra where C = Σ w_i.
Variables:
- w_i - weight of segment i
- C - total path cost
Citations: Shortest path algorithms
Applicability: non-negative weights and connected graphs.
See also: Load Calculation Formulas, Cable Fill Rules, Routing Assumptions.
Routing Readiness
This panel confirms whether the tray network and cable list are ready for calculation.
Start with routing data
Load a sample network, import from the schedules, or add trays and cables manually.
Source Data Raceway network, cable list, imports, and manual overrides
Cable Tray Network
Primary source should be the Raceway Schedule; manual entry remains available for quick studies.
Advanced manual tray entry
Tray table
Tray Utilization
Cable Routing Options
Import the Cable Schedule first when available; use manual rows for quick route studies.
Advanced manual route entry
Use the "Manual Path" column to enter tray IDs (e.g. TR1>TR2) or coordinate waypoints (e.g. 0,0,0;10,0,0) for a cable. Leave blank to auto-route.