Hybridization and the Collaborative Combination of Algorithms: Case Study: The Container Loading Problem

A hybrid heuristic approach based on the collaborative combination of a genetic algorithm (GA), a greedy algorithm and another GA integrated with a rectangle packing algorithm is presented for solving the container loading problem (CLP). The approach reduces the CLP into sub problems, collaboratively combining the resulting constituent algorithms to create a novel heuristic algorithm that solves the problem as a whole. Several practical constraints arising from a real-world application such as container weight limit, orientation, stacking, stability, and complete shipment of certain item groups are considered.