Matheuristics for the irregular bin packing problem with free rotations

详细信息    查看全文

• 作者：A. Martinez-Sykora ; ^a ; ^{A.Martinez-Sykora@soton.ac.uk} ; R. Alvarez-Valdes^b ; ^{ramon.alvarez@uv.es} ; J.A. Bennell^a ; ^{J.A.Bennell@soton.ac.uk} ; R. Ruiz^c ; ^{rruiz@eio.upv.es} ; J.M. Tamarit^b ; ^{jose.tamarit@uv.es}
• 关键词：Cutting and packing ; Two-dimensional irregular bin packing ; Integer Programing
• 刊名：European Journal of Operational Research
• 出版年：2017
• 出版时间：16 April 2017
• 年：2017
• 卷：258
• 期：2
• 页码：440-455
• 全文大小：929 K
• 卷排序：258

文摘

We tackle a new problem to the literature motivated by a real application. We handle multiple bins, free rotation and concave pieces. The algorithm can work with fixed and limited angle of rotations. The algorithm provides competitive results in all the variants. The algorithm obtains high quality solutions in the real application.