English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Packing problems have been used in industries constantly, mainly in supply chain and logistic organizations. This research deals with the knapsack problem in its three-dimensional version with the objective of maximize the occupied volume for a single container. We study the version of the problem in which there is no limit on the number of copies of each item that may be packed, but items must be arranged with no overlapping and respecting the container dimensions. We present a heuristic based on the Simulated Annealing metaheuristic that aims for minimize the trim loss, and that selects items with the best fitness value, considering empty spaces. The C programming language was used to code the algorithms, in which computational experiments using instances from the literature shown that the heuristic is reasonable for solve medium-sized instances, whereas it fails in some cases.

O PROBLEMA DA MOCHILA TRIDIMENSIONAL RESOLVIDO POR UMA HEURÍSTICA