The Search is performed on all of the following fields:
Note: Please use complete words only.

Publication Title

Abstract

Publication Keywords

DOI

Proceeding Title

Proceeding Foreword

ISBN (Completed)

Insticc Ontology

Author Affiliation

Author Name

Editor Name

If you're looking for an exact phrase use quotation marks on text fields.

Paper

Considerations on 2D-Bin Packing Problem: Is the Order of Placement a Relevant Factor?Topics: Case Studies; Construction Engineering and Project Management; Education and Training; Industrial Processes; Materials; Optimization Issues; Planning and Scheduling

Keyword(s):2D Bin Packing, Order of Placement, Placement Algorithm, Optimization Techniques, First-Fit, Area Decreasing Order.

Related
Ontology
Subjects/Areas/Topics:Application Domains
;
Artificial Intelligence
;
Case Studies
;
Construction Engineering and Project Management
;
Education and Training
;
Formal Methods
;
Health Engineering and Technology Applications
;
Industrial Processes
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Materials
;
Neural Rehabilitation
;
Neurotechnology, Electronics and Informatics
;
Optimization Issues
;
Planning and Scheduling
;
Simulation and Modeling
;
Simulation Tools and Platforms
;
Symbolic Systems

Abstract: The problem of packing a given sequence of items of 2-dimensional (2D) geometric shapes into a minimum
number of rectangle bins of given dimensions is called the 2D bin packing problem. This problem has
various applications across many industries such as steel-, paper- and wood- industries where objects of
certain shapes are needed to be cut from large rectangle panels with the most efficient use of materials. This
problem, however, belongs to the class of NP-Hard problems, implying that no perfect solution exists. Many
proposed solutions involve the use of advanced metaheuristic search techniques such as Local Search,
Simulated Annealing or Genetic Algorithm, but most of them are still greedy-based, which means some
greedy technique such as First-Fit is still used as their core placement algorithm and optimization techniques
are employed only to search for a good ordering or orientation (rotation angles) of the objects so that the
placement procedure can yield the best possible results. Practice has shown that greedy placement algorithm
on the simple area decreasing order can produce excellent results comparable to those on orderings
generated from advanced optimization techniques. This paper discusses the relevance of the order of
placement in the 2D bin packing problem.(More)

The problem of packing a given sequence of items of 2-dimensional (2D) geometric shapes into a minimum number of rectangle bins of given dimensions is called the 2D bin packing problem. This problem has various applications across many industries such as steel-, paper- and wood- industries where objects of certain shapes are needed to be cut from large rectangle panels with the most efficient use of materials. This problem, however, belongs to the class of NP-Hard problems, implying that no perfect solution exists. Many proposed solutions involve the use of advanced metaheuristic search techniques such as Local Search, Simulated Annealing or Genetic Algorithm, but most of them are still greedy-based, which means some greedy technique such as First-Fit is still used as their core placement algorithm and optimization techniques are employed only to search for a good ordering or orientation (rotation angles) of the objects so that the placement procedure can yield the best possible results. Practice has shown that greedy placement algorithm on the simple area decreasing order can produce excellent results comparable to those on orderings generated from advanced optimization techniques. This paper discusses the relevance of the order of placement in the 2D bin packing problem.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Lam, G.; Ho, V. and Logofatu, D. (2017). Considerations on 2D-Bin Packing Problem: Is the Order of Placement a Relevant Factor?.In Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH, ISBN 978-989-758-265-3, ISSN 2184-2841, pages 280-287. DOI: 10.5220/0006440302800287

@conference{simultech17, author={Gia Thuan Lam. and Viet Anh Ho. and Doina Logofatu.}, title={Considerations on 2D-Bin Packing Problem: Is the Order of Placement a Relevant Factor?}, booktitle={Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,}, year={2017}, pages={280-287}, publisher={SciTePress}, organization={INSTICC}, doi={10.5220/0006440302800287}, isbn={978-989-758-265-3}, }

TY - CONF

JO - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH, TI - Considerations on 2D-Bin Packing Problem: Is the Order of Placement a Relevant Factor? SN - 978-989-758-265-3 AU - Lam, G. AU - Ho, V. AU - Logofatu, D. PY - 2017 SP - 280 EP - 287 DO - 10.5220/0006440302800287