Advanced search
Start date
Betweenand
(Reference retrieved automatically from SciELO through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

COMPARING A STATIC EQUILIBRIUM BASED METHOD WITH THE SUPPORT FACTOR FOR HORIZONTAL CARGO STABILITY IN THE CONTAINER LOADING PROBLEM

Full text
Author(s):
Liliane de Azevedo Oliveira [1] ; Vinícius Loti de Lima [2] ; Thiago Alves de Queiroz [3] ; Flávio Keidi Miyazawa [4]
Total Authors: 4
Affiliation:
[1] Federal University of Catalão. Institute of Mathematics and Technology - Brasil
[2] Federal University of Catalão. Institute of Mathematics and Technology - Brasil
[3] Federal University of Catalão. Institute of Mathematics and Technology - Brasil
[4] University of Campinas. Institute of Computing - Brasil
Total Affiliations: 4
Document type: Journal article
Source: Pesquisa Operacional; v. 41, 2021-10-11.
Abstract

ABSTRACT This paper presents an approach to deal with horizontal cargo stability in container loading problems. Cargo stability has been explored mainly with support factors that constrain the minimum area of each box’s faces to be supported by other boxes. On the other hand, we propose an approach based on the static equilibrium of rigid bodies to check the static stability of a given packing. The approach is used as a cutting plane routine in a branch-and-cut framework to the single container loading problem. This framework considers the resolution of an integer linear programming model to obtain feasible packings next checked with the proposed approach to avoid unstable packings. The computational experiments consider 180 benchmark instances on which stable solutions of the proposed approach have better container fill rates than the support factor approach. In terms of lateral support, the proposed approach provides the minimum value inferior to 70% on average, which is satisfactorily smaller and less restrictive than the full support. Results also indicate that more unstable solutions emerge from refined grids and fewer types of boxes available. (AU)

FAPESP's process: 17/11831-1 - Algorithms and models for cutting and packing problems
Grantee:Vinícius Loti de Lima
Support Opportunities: Scholarships in Brazil - Doctorate (Direct)
FAPESP's process: 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points
Grantee:Flávio Keidi Miyazawa
Support Opportunities: Research Projects - Thematic Grants