An empirically efficient two-phase heuristic algorithm for two-dimensional bin packing problem

Xingyu Qu; Chaolang Hu

doi:10.1117/12.2644671

10 November 2022 An empirically efficient two-phase heuristic algorithm for two-dimensional bin packing problem

Xingyu Qu, Chaolang Hu

Proceedings Volume 12301, 6th International Conference on Mechatronics and Intelligent Robotics (ICMIR2022); 123012E (2022) https://doi.org/10.1117/12.2644671
Event: 6th International Conference on Mechatronics and Intelligent Robotics, 2022, Kunming, China

Abstract

This paper reconsidered the Two-Dimensional Bin Packing Problem from the perspective of practical application based on actual needs of small furniture companies in China. Although there have been many researches on this problem for many years, most of the existed researches put their foremost attention on developing an algorithm with low complexity or approximately best performance which means that it can nearly work out the best solution most of the time. This is the common situation when we do research on such problems, but unfortunately it will leave out abundant practical needs. For example, the computational resources of those small companies are seldom, which makes it impossible to use algorithms that almost gets the best solution but takes much time. The significant goal is to find out a solution satisfactory enough within a short time, so some complex algorithms which aim to get a nearly best result aren’t suitable here. Meanwhile, the cutting times are also a rather critical matter for them. Cutting too many times will cause high wastage to machines and is therefore unaffordable for small companies, but this was often ignored in previous researches especially in classic meta-heuristic algorithms since they frequently lead to complicated packing patterns with massive cutting times. This paper reviewed previous related researches and summarized their shortages and some necessary characteristics of a practically efficient algorithm. Based on classic algorithms, it gained a two-stage heuristic algorithm which performed better than current used ones in those small companies, as well as meets their special needs stated in this paper which is a rather important issue. And this algorithm itself may be used to meet needs of those factories or be used as a starter of the further optimization search.

Citation Download Citation

Xingyu Qu and Chaolang Hu "An empirically efficient two-phase heuristic algorithm for two-dimensional bin packing problem", Proc. SPIE 12301, 6th International Conference on Mechatronics and Intelligent Robotics (ICMIR2022), 123012E (10 November 2022); https://doi.org/10.1117/12.2644671

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
8 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Algorithm development

Computer programming

Mathematical modeling

Evolutionary algorithms

Cutting equipment

Machine learning

Manufacturing

Show All Keywords

Keywords/Phrases

Search In:

Publication Years