# Route Optimisation Summary

## General

Following wire or cable route optimisation, a summary of the route search statistics is displayed.

You can use these statistics to help tune your model for wire or cable routing. You may also find useful information if you are experiencing problems with wire or cable routing.

The image below shows the routing summary dialog with routing statistics.

This summary provides the following information:

Isolated raceway networks |
The number of physically disconnected (isolated) networks of raceway segments. One raceway network is any group of raceway segments that are connected together. For example: if you have one network of raceway down a conveyor and another disconnected network of raceway for a heater then this will be 2. |

Total number of raceway segments in model |
The total number of raceway segments: lengths, corners, risers, Xs etc. This includes all types: trench, tray, conduit and ducting. |

Total number of pairs of segments searched |
For each pair of components, Paneldes searches for a route between any pairs of segments in proximity to the components. This count is therefore the number of distinct routes that it attempted to trace from a source segment to a destination segment. If your components are close to many segments of raceway or your device connection distance is too large, then this will be a large number. |

Maximum paths found between any pair of segments |
The maximum number of alternative paths that were found that made a complete route between any one pair of source and destination raceway segments. If you have an arterial network of raceway, then this will be a small number – potentially 1. If you have many loops in your raceway network, then this could be a large number. In this case the route optimisation is likely to be slow. |

Average paths found between each pair of segments |
The average for the number of alternative paths that were found to make a complete route between all pairs of source and destination segments. |

Maximum recursion steps for any pair of segments |
The maximum number of steps from one junction between segments to another required to trace a route successfully between any one pair of source and destination raceway segments. If this number is large compared to the number of raceway segments, then the path from source to destination may be obscure for one or more routes. |

Average recursion steps for each segment |
The average number of steps from one junction between segments to another required to trace a route successfully between all pairs of source and destination segments. |