Cant sawing log positioning in a sawmill: searching for an optimal solution

摘要

Automated three-dimensional log scanning and positioning systems in a sawmill have a limited time available to reach an optimal positioning solution before primary breakdown sawing starts. In this study a search algorithm (tentacle algorithm) was developed for this task and was empirically evaluated in terms of its ability to find an optimal or close-to-optimal positioning solution in a limited number of iterations. This algorithm was compared to the population-based incremental learning algorithm, the simulated annealing algorithm, and the particle swarm optimisation algorithm. The tentacle algorithm performed the best of all the algorithms evaluated in terms of the mean volume recovery obtained. However, exhaustive searches around the centred and a??horns-upa?? and a??horns-downa?? positions using smaller ranges resulted in better mean volume recovery results than any of the algorithms, although the mean results using this strategy did not differ significantly from that of the tentacle algorithm.