Bin packing problem (BPP) is one of the fastest-growing research issues within the field of
combinatorial optimization. Over the last years, several studies carried out various BPP …

Bin packing problems are NP-hard combinatorial optimization problems of fundamental
importance in several fields, including computer science, engineering, economics …

The solution of bi-objective bin packing problems with many constraints is of fundamental
importance for a wide range of engineering applications such as wireless communication …

This article presents a method based on the multi-objective evolutionary algorithm NSGA-II
to approximate hyper-heuristics for solving irregular 2D cutting stock problems under …

In this paper, we address a bi-objective 2-dimensional vector packing problem (Mo2-DBPP)
that calls for packing a set of items, each having two sizes in two independent dimensions …

In this article we build multi-objective hyper-heuristics (MOHHs) using the multi-objective
evolutionary algorithm NSGA-II for solving irregular 2D cutting stock problems under a bi …

This paper proposes an improved version of volume dominance to assign fitness to
solutions in Pareto-based multi-objective optimisation. The impact of this revised volume …

This paper conducts a comprehensive review of literature focusing on strategies applied in
the realm of Machine Learning (ML) in a period from ten years ago to the present to address …

The prevalence of disaggregated storage in public clouds has led to increased latency in
modern OLAP cloud databases, particularly when handling ad-hoc and highly-selective …

Determining a process plan in the early phase of the sheet metal forming process is a
mandatory task for a process planner. The objective of a process planner is to find a feasible …