CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

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

E. Shellshear ; Johan S Carlson (Institutionen för produkt- och produktionsutveckling, Produktutveckling) ; R. Bohlin ; S. Tafuri
IEEE International Conference on Automation Science and Engineering (2161-8070). Vol. 2015-October (2015), p. 1509-1514.
[Konferensbidrag, refereegranskat]

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

Nyckelord: Manufacturing Automation , Scheduling and Optimization

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2016-01-22. Senast ändrad 2016-08-23.
CPL Pubid: 231159


Läs direkt!

Länk till annan sajt (kan kräva inloggning)