A multi-threaded memetic packing algorithm for the ISO luggage packing problem

摘要

A new multi-threaded memetic algorithm (genetic algorithm with local optimizations) for the ISO 3832 luggage packing standard is presented. Apart from producing high-quality results, the algorithm also exploits the highly parallel computer architectures that are becoming more common as well as packing more boxes than other state-of-the-art algorithms. We also provide the first comparison of state-of-the-art packing algorithms for a real world trunk geometry.