Add to ORKGA two-dimensional bin-packing problem is considered, where bins have processing times, and rectangles have due dates. A new placement heuristic which dynamically searches for the best placement is presented. The search is controlled by a GA with alternative fitness functions for minimising the number of bins and the maximum lateness
The genetic algorithm (GA) paradigm has attracted considerable attention as a promising heuristic ap...
AbstractCombinatorial optimization problems dealing with 2D bin packing find applications, for examp...
In this work we address an orthogonal non-oriented two-dimensional bin packing problem where items a...
This paper considers a new variant of the two-dimensional bin packing problem where each rectangle i...
For every set of bin packing data there exists a unique ordering which produces the optimal solution...
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items ha...
This paper considers a non-oriented twodimensional bin packing problem, where a set of small recta...
We present a novel multi-population biased random-key genetic algorithm (BRKGA) for the 2D and 3D bi...
In this paper we proposed a local search heuristic and a genetic algorithm to solve the two-dimensio...
This paper presents a Heuristic Genetic Algorithm (HGA) for optimizing three dimensional (3D) arbitr...
Cutting and packing problems are combinatorial optimisation problems. In most manufacturing situatio...
The bin-packing problem is a well known NP-Hard optimisation problem, and, over the years, many heu...
Abstract. Problem statement: Cutting and packing (C and P) problems are optimization problems that a...
The offline 2D bin packing problem (2DBPP) is an NP-hard combinatorial optimization problem in which...
2D Bin packing problem (2DBPP) is an NP-hard combinatorial optimization problem. Objects with di ere...
The genetic algorithm (GA) paradigm has attracted considerable attention as a promising heuristic ap...
AbstractCombinatorial optimization problems dealing with 2D bin packing find applications, for examp...
In this work we address an orthogonal non-oriented two-dimensional bin packing problem where items a...
This paper considers a new variant of the two-dimensional bin packing problem where each rectangle i...
For every set of bin packing data there exists a unique ordering which produces the optimal solution...
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items ha...
This paper considers a non-oriented twodimensional bin packing problem, where a set of small recta...
We present a novel multi-population biased random-key genetic algorithm (BRKGA) for the 2D and 3D bi...
In this paper we proposed a local search heuristic and a genetic algorithm to solve the two-dimensio...
This paper presents a Heuristic Genetic Algorithm (HGA) for optimizing three dimensional (3D) arbitr...
Cutting and packing problems are combinatorial optimisation problems. In most manufacturing situatio...
The bin-packing problem is a well known NP-Hard optimisation problem, and, over the years, many heu...
Abstract. Problem statement: Cutting and packing (C and P) problems are optimization problems that a...
The offline 2D bin packing problem (2DBPP) is an NP-hard combinatorial optimization problem in which...
2D Bin packing problem (2DBPP) is an NP-hard combinatorial optimization problem. Objects with di ere...
The genetic algorithm (GA) paradigm has attracted considerable attention as a promising heuristic ap...
AbstractCombinatorial optimization problems dealing with 2D bin packing find applications, for examp...
In this work we address an orthogonal non-oriented two-dimensional bin packing problem where items a...