A beam search algorithm for the biobjective container loading problem

•We added more details related to the new generated instances BRwp and NMFTA (new scatter plots and more information to the tables).•We clarify the idea related to guiding the greedy procedure in the BSG approach (section 5.1).•We explain in detail the non-dominated sort (section 5.2).•In the future work we consider the inclusion of more practical constraints to the problem (conclusion section).