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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The Variable Sized Bin Packing Problem has a wide range of application areasincluding packing, scheduling, and manufacturing. Given a list of items andvariable sized bin types, the objective is to minimize the total size of theused bins. This problem is known to be NP-hard. In this article, we present twonew heuristics for solving the problem using a new variation of P systems withactive membranes, which we call a hybrid P system, implemented in CUDA. Ourhybrid P-system model allows using the polarity and labels of membranes torepresent object properties which results in reducing the complexity ofimplementing the P-system. We examine the performance of the two heuristics,and compare the results with those of other known algorithms. The numericalresults show that good solutions for large instances (10000 items) of thisproblem could be obtained in a very short time (seconds) using our CUDAsimulator.

Heuristics for the Variable Sized Bin Packing Problem Using a Hybrid P-System and CUDA Architecture