Covering, corner-searching and occupying: A three-stage intelligent algorithm for the 2d multishape part packing problem.
Ontology highlight
ABSTRACT: The bin packing problem has a wide range of applications in industry. With the upgrade of the task difficulty, the traditional 2d rectangular layout algorithm can no longer meet the needs of modern industry, such as express packing task and exoplanet ore collection task. The express or ore samples come in heterogeneous shapes so they cannot all be treated as rectangular pieces. In this paper, we propose a three-stage method called covering, corner-searching and occupying (C,S&O) to solve the two-dimensional multishape part packing problem. The objective of the packing problem variant is to ensure maximum use of the raw material and minimize the trim loss. The algorithm cannot make use of information about the sequence of future objects that are going to arrive, only knowing the shape and s
SUBMITTER: Ren H
PROVIDER: S-EPMC9154095 | biostudies-literature | 2022
REPOSITORIES: biostudies-literature
ACCESS DATA