A trial in LKH-AMZ is a sequence of 3-opt and 4-opt moves, where the search for these moves is terminated according to rules that trade off the speed of the computation with the likelihood of finding further improvements.
(See [1]} for a detailed discussion in the context of the pure TSP.)
In each run of the code, \(8n\)  trials are executed.
