Solving the three-dimensional open-dimension rectangular packing problem: A constraint programming model

doi:10.1016/j.cor.2024.106651

Solving the three-dimensional open-dimension rectangular packing problem: A constraint programming model

2024-07-01

0

PRE

AI

T

Thiago Alves de Queiroz

R

Reinaldo Morábito

DOI：10.1016/j.cor.2024.106651

原文链接

原文求助

摘要

En 中文

This paper addresses the three-dimensional open -dimension rectangular packing problem (3D-ODRPP). This problem addresses a set of rectangular boxes of given dimensions and a rectangular container of open dimensions. The objective is to pack all boxes orthogonally into the container while minimizing the container volume. Real -world applications of the 3D-ODRPP arise in production systems with operations of shipping or moving. The literature has presented mainly mixed -integer programming (MIP) formulations and their linearization techniques for the problem allied with general-purpose optimization solvers. To model and solve the 3D-ODRPP, we propose a constraint programming model based on a position -free modeling approach with logic operators. We ran computational experiments to assess the performance of the proposed model compared to the benchmark MIP models from instances of the literature. The results show our approach is competitive in different sets of problem instances in terms of reaching optimality as well as providing satisfactory feasible solutions quickly.

Keyword:

Cutting and Packing

Three-dimensional rectangular packing

Open-dimension problems

Constraint Programming

Solving the three-dimensional open-dimension rectangular packing problem: A constraint programming model

摘要

期刊

机构