Heuristics for the Travel Distance Calculation 

Use

Two heuristics for the travel distance calculation within a network exist. The system calls both by default. You can control the heuristics using BAdIs for the Travel Distance Calculation:

●      Depth-first search

The system attempts to find a route between the specified nodes of a network in the shortest time possible. Here, the search runs in the direction of start node to end node. The search finishes when the first complete route is found.

●      Breadth-first search

The system looks for all possible routes in the network, and selects the one that has the shortest distance. This heuristic is more performance intensive at runtime, and is only appropriate for small networks.

●      Stopping criterion

The stopping criterion quickens the breadth-first search. This may have a negative impact on the solution quality, and the system may fail to find the shortest route. The parameter restricts the number of nodes that can be visited by a route, in relation to the route found by the depth-first search.