A multi-threaded memetic packing algorithm for the ISO luggage packing problem
Paper i proceeding, 2015

© 2015 IEEE. 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.

Scheduling and Optimization

Manufacturing Automation

Författare

E. Shellshear

Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik

Johan Carlson

Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik

R. Bohlin

Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik

S. Tafuri

Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik

IEEE International Conference on Automation Science and Engineering

2161-8089 (eISSN)

Vol. 2015-October 1509-1514
978-1-4673-8183-3 (ISBN)

Ämneskategorier

Produktionsteknik, arbetsvetenskap och ergonomi

Diskret matematik

Styrkeområden

Produktion

DOI

10.1109/CoASE.2015.7294313

Mer information

Senast uppdaterat

2021-10-21