Container loading problems (CLP) are interesting and easy to appreciate, and span from real-world to abstract mathematical variants. However, CLP is an NP-complete problem, so something as simple as comparing approaches, heuristics, and partial solutions arouses an instant migraine. This paper gives a wonderful lucid introduction to parameters, variations, and realistic applications for CLP. The volume of active hyperlinks in the paper may entice readers into spontaneous academic surfing of such great interest that one may lose track of the scope of the project and even begin thinking about CLP solution space tradeoffs.

This paper magnificently presents complex CLP variants arising from practical industrial applications, such as multiple containers, box rotation, and bearable weight. Further heuristic intrigue comes from situations involving boxes being delivered to different destinations (multi-drop). The authors consider a CLP solution technique involving local search meta-heuristics, and conclude with a true sportsman-like comparison with others who have contributed to this fascinating field.

So, much in the spirit of Lebesgue’s original first chapter introducing measure theory to elementary education, CLP is a perfect problem for introducing the joys of applied mathematics into primary school. This paper should serve that community well, and it will just as well provide the university student with a forum for exploring and expressing mathematical thinking. Simply put, I recommend this must-read paper, even if it overlaps with many others, if only because the ideational development is presented clearly and the topic is easy to grasp and relevant.