In this work, heuristic algorithms for the optimization of a log yard roundwood transport and storage problem are presented, and put in the general context of common optimization problems found along the forestry supply chain. The underlying model of the log yard transport and storage optimization was formulated as a mixed integer problem by Rathke et al. (2013), who have also formulated a basic heuristic algorithm for this problem and calculated the optimal results using optimization software. The heuristic algorithms presented here are an extension to the basic heuristic algorithm with the aim of improving the possible solution quality. Finally, the heuristic results are compared to the optimal results of Rathke et al. (2013) in terms of solution quality and necessary time for computation. The research question is whether the implementation of relatively simple and compact algorithms in java can be a satisfying alternative to the optimal but time consuming findings optimization software can deliver.