The time and energy efficiency when collecting felled wood logs from a forest stand are critical for the forestry economics and sustainability. Choice of collection routes varies greatly depending on the experience of the forest forwarder driver. With modern vehicle routing optimization algorithms, this variance could be reduced, and less experienced drivers supported, therefore making the log collection at forest stands more efficient. In this paper the repeated matching (RM) algorithm solving the routing problem for a capacity-limited forwarder is adapted from an earlier work and extended to consider constraints on the number route segments can be driven through and one-way route segments. Furthermore, the forwarder unloading to sorted piles is integrated to the route optimization. The performance of the algorithm is compared to that of a group of forwarder driver students in Finnish national skill competition finals. The case had 164 piles of six timber classes and three depots, some unidirectional segments and some segments with limited number of drives. When our algorithm was run for 8 hours, it performed best amongst the nine finalists, and when it was run for one hour, it performed fourth best.