A new iterative-doubling Greedy-Lookahead algorithm for the single container loading problem

► We developed a new Greedy-Lookahead tree search algorithm for the SCLP. ► We showed that selecting spaces is as important as selecting blocks of boxes. ► We proposed a simpler and more effective evaluation heuristic for selecting spaces. ► We considered the SCLP both with and without full support constraint. ► We outperformed all existing approaches based on 1600 benchmark instances.