Maximum Time per Algorithm Iteration (in minutes)

Use this option to specify a maximum time, in minutes, that should be spent on solving the marker order problem during each iteration step of the algorithm.

The algorithm to find the optimal order iteratively sets up possible connections between markers given the data and constraints. It uses a Traveling Salesman Problem solver to determine the best order and then updates the possible marker connections.

Note : This maximum time applies only to the time spent solving the current iteration. Because multiple iterations can be needed to find a (near) optimal solution, your process run times might be much longer than the specified value. This parameter must be used in conjunction with the Proximity to Optimal Mapping Order parameter.

To Specify the Maximum Time per Algorithm Iteration:

Make sure that Map Order Optimization is specified as the Order Algorithm

Check the Apply stopping rules for map order optimization box.

Type the desired time per iteration value in the text box.

Note : This value must be between 1 and 30 .