Voxel-Based Solution Approaches to the Three-Dimensional Irregular Packing Problem

نویسندگان

چکیده

Packing Three-Dimensional Irregular Objects Because of its many applications in practice, the cutting and packing literature is extensive well established. It mostly concerned with problems one two dimensions or where some regularity pieces assumed (e.g., boxes). However, rise realm three-dimensional printing additive manufacturing has created a demand for efficient irregular objects. In “Voxel-Based Solution Approaches to Problem,” Lamas-Fernandez, Martinez-Sykora, Bennell propose series tools tackle this problem using voxels. These include geometric tools, mathematical model, local search neighborhoods, details on implementation metaheuristic algorithms. are tested extensively, computational results provided show their effectiveness compared state-of-the-art literature.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Three-Dimensional Bin Packing Problem

The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is strongly NP-hard and extremely diicult to solve in practice. Lower bounds are discussed, and it is proved that the asymptotic worst-case performance ratio of the continuous lower bound is 1 8. An exact algorithm...

متن کامل

Three dimensional Bin Packing Problem applied to air transport

Packing boxes into containers is a daily process in many different fields and especially in transport. However, the particular case of air transport brings some new constraints such as the stability or the fragility of the cargo. The distribution of the weight has also to be considered. Moreover, this special case also brings some data such as the dimensions of the possible containers, called U...

متن کامل

Heuristic approaches for the two- and three-dimensional knapsack packing problem

The maximum profit twoor three-dimensional knapsack packing problem asks to pack a maximum profit subset of some given rectangles or boxes into a larger rectangle or box of fixed dimensions. Items must be orthogonally packed, but no other restrictions are imposed to the problem. The problem could also be considered as a knapsack problem generalized to two or three dimensions. In this paper we p...

متن کامل

Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem

This paper presents an extended local search algorithm (ELS) for the irregular strip packing problem. It adopts two neighborhoods, swapping two given polygons in a placement and placing one polygon into a new position. The local search algorithm is used to minimize the overlap on the basis of the neighborhoods mentioned above and the unconstrained nonlinear programming model is adopted to furth...

متن کامل

Guided Local Search for the Three-Dimensional Bin-Packing Problem

The three-dimensional bin packing problem is the problem of orthogonally packing a set of boxes into a minimum number of three-dimensional bins. In this paper we present a heuristic algorithm based on Guided Local Search (GLS). Starting with an upper bound on the number of bins obtained by a greedy heuristic, the presented algorithm iteratively decreases the number of bins, each time searching ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2022

ISSN: ['1526-5463', '0030-364X']

DOI: https://doi.org/10.1287/opre.2022.2260