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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A problem with few references in the literature of nesting problems is the 0-1 knapsack problem with irregular shaped items (2PMI). In the 2PMI, it is required that a subset of items has to be packed in a rectangular bin aiming to maximize the occupied area. In this paper we use a framework proposed in the literature, which implements a biased random-key genetic algorithm. The main contribution of this paper is the allocation technique that considers the bottomleft or top-left corner of the bin. In order to find feasible positions and avoid overlapping between items, we use a mesh over a grid of no-fit polygons. The computational experiments validate the proposed algorithm showing that it is competitive, since it improved results from the recent literature.

APLICANDO O ALGORITMO GENÉTICO DE CHAVES ALEATO´ RIAS VICIADAS EM UM PROBLEMA DE CORTE COM ITENS IRREGULARES