✦ LIBER ✦

A hybrid heuristic algorithm for the 2D variable-sized bin packing problem

✍ Scribed by Hong, Shaohui; Zhang, Defu; Lau, Hoong Chuin; Zeng, XiangXiang; Si, Yain-Whar

Book ID: 121722535
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 458 KB
Volume: 238
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2014.03.049

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Variable neighbourhood search for the va

Variable neighbourhood search for the variable sized bin packing problem

✍ Vera Hemmelmayr; Verena Schmid; Christian Blum 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Efficient algorithms for the offline var

Efficient algorithms for the offline variable sized bin-packing problem

✍ Mohamed Maiza, Abdenour Labed, Mohammed Said Radjef 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 300 KB

A Hybrid Improvement Heuristic for the O

A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

✍ Adriana C.F. Alvim; Celso C. Ribeiro; Fred Glover; Dario J. Aloise 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 317 KB

A new heuristic algorithm for the one-di

A new heuristic algorithm for the one-dimensional bin-packing problem

✍ Gupta, Jatinder N. D.; Ho, Johnny C. 📂 Article 📅 1999 🏛 Taylor and Francis Group 🌐 English ⚖ 208 KB

Solving the 2D Bin Packing Problem by Me

Solving the 2D Bin Packing Problem by Means of a Hybrid Evolutionary Algorithm

✍ Blum, Christian; Schmid, Verena 📂 Article 📅 2013 🏛 Elsevier 🌐 English ⚖ 144 KB

Solving the 2D Bin Packing Problem by Me

Solving the 2D Bin Packing Problem by Means of a Hybrid Evolutionary Algorithm

✍ Blum, Christian; Schmid, Verena 📂 Article 📅 2013 🏛 Elsevier 🌐 English ⚖ 144 KB

Combinatorial optimization problems dealing with 2D bin packing find applications, for example, in the context of transporta- tion/warehousing and for the cutting of glass, wood, and metal. In this work we consider the oriented 2D bin packing problem under free guillotine cutting, a problem in which