Abstract
A family of automatic container loading problems is studied and algorithms are proposed. The algorithms are constructed with metaheuristics and include flat and/or vertical loading schemes, loading efficiency, stability of loaded objects, and computational requirement. Handling groups of objects in a metaheuristic scheme is moreover considered. Numerical examples are given.