Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Static stability versus packing efficiency in online three-dimensional packing problems: A new approach and a computational study
Publication

Publications

Static stability versus packing efficiency in online three-dimensional packing problems: A new approach and a computational study

Title
Static stability versus packing efficiency in online three-dimensional packing problems: A new approach and a computational study
Type
Article in International Scientific Journal
Year
2025
Authors
Ali, S
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Ramos, AG
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Journal
Vol. 178
ISSN: 0305-0548
Publisher: Elsevier
Indexing
Publicação em ISI Web of Knowledge ISI Web of Knowledge - 0 Citations
Publicação em Scopus Scopus - 0 Citations
Other information
Authenticus ID: P-018-0ZR
Abstract (EN): In online three-dimensional packing problems where items are received one by one and require immediate packing decisions without prior knowledge of upcoming items, considering the static stability constraint is crucial for safely packing each arriving item in real time. Unstable loading patterns can result in risks of potential damage to items, containers, and operators during loading/unloading operations. Nevertheless, static stability constraints have often been neglected or oversimplified in existing online heuristic methods in the literature, undermining the practical implementation of these methods in real-world scenarios. In this study, we analyze how different static stability constraints affect solutions' efficiency and cargo stability, aiming to provide valuable insights and develop heuristic algorithms for real-world online problems, thus increasing the applicability of this research field. To this end, we embedded four distinct static stability constraints in online heuristics, including full-base support, partial-base support, center-of-gravity polygon support, and novel partial-base polygon support. Evaluating the impact of these constraints on the efficiency of a wide range of heuristic methods on real instances showed that regarding the number of used bins, heuristics with polygon- based stabilities have superior performance against those under full-base and partial-base support stabilities. The static mechanical equilibriumapproach offers a necessary and sufficient condition for the cargo static stability, and we employed it as a benchmark in our study to assess the quality of the four studied stability constraints. Knowing the number of stable items under each of these constraints provides valuable managerial insight for decision-making in real-world online packing scenarios.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 21
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines (2015)
Article in International Scientific Journal
Marcos Furlan; Bernardo Almada Lobo; Maristela Santos; Reinaldo Morabito
The use of frontier techniques to identify efficient solutions for the Berth Allocation Problem solved with a hybrid evolutionary algorithm (2019)
Article in International Scientific Journal
Flávia Barbosa; Priscila C. Berbert Rampazzo; Akebo Yamakami; Ana S. Camanho
The Probabilistic Travelling Salesman Problem with Crowdsourcing (2022)
Article in International Scientific Journal
Santini, A; Viana, A; Klimentova, X; Joao Pedro Pedroso
The challenges of estimating the impact of distributed energy resources flexibility on the TSO/DSO boundary node operating points (2018)
Article in International Scientific Journal
João Silva; Jean Sumaili ; Ricardo J. Bessa; Luís Seca ; Manuel Matos; Vladimiro Miranda
Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics (2011)
Article in International Scientific Journal
Ross J. W. James; Bernardo Almada-Lobo

See all (43)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2025-07-02 at 22:30:24 | Acceptable Use Policy | Data Protection Policy | Complaint Portal