Add to ORKGArticle dans revue scientifique avec comité de lecture. nationale.National audienceWe consider a particular 2D placement problem which consists of finding the best way to place a set of rectilinear polygons in a given rectangular area. Pi/2 rotations of the polygons is allowed. The work area contains unusable zones. Several encoding and the associated genetic operators are designed that enables to design and compare experimentally several genetic algoritm approaches. || Nous considérons un problème particulier de découpe à deux dimensions. Il consiste à placer le mieux possible un ensemble de polygones rectilinaires sur une forme rectangulaire donnée. Des rotations de pi/2 des polygones sont autorisées. La zone comport
Colloque sans acte à diffusion restreinte.We propose efficient approximate solutions to large size p...
Abstract — Genetic algorithms have proven to be a well-suited technique for solving selected combina...
A new genetic algorithm for the macro cell placement problem is presented. The algorithm is based on...
Colloque avec actes et comité de lecture.In this paper, we consider a particular 2D placement proble...
Article dans revue scientifique avec comité de lecture.Nous considerons ici un probleme de decoupe a...
This paper presents a preliminary study on space allocation focusing on the rectangular shapes to b...
This paper introduces a new method to solve the irregular-shape, full-rotation nesting problem by a ...
The aim is to develop and investigate the genetical method for arrangement of the free shape two-dim...
International audienceThis article presents a generic method to solve 2D multi-objective placement p...
In this paper a new algorithm to generate random simple polygons from a given set of points in a two...
Given a set of rectangular pieces and a fixed width with infinite length, the strip-packing problem ...
In the two-dimensional single large object placement problem, we are given a rectangular master surf...
International audienceThis paper presents a new approach of the genetic representation of a machines...
Given a set of rectangular pieces and a rectangular container, the two-dimensional knapsack problem ...
Cutting and packing problems are combinatorial optimisation problems. In most manufacturing situatio...
Colloque sans acte à diffusion restreinte.We propose efficient approximate solutions to large size p...
Abstract — Genetic algorithms have proven to be a well-suited technique for solving selected combina...
A new genetic algorithm for the macro cell placement problem is presented. The algorithm is based on...
Colloque avec actes et comité de lecture.In this paper, we consider a particular 2D placement proble...
Article dans revue scientifique avec comité de lecture.Nous considerons ici un probleme de decoupe a...
This paper presents a preliminary study on space allocation focusing on the rectangular shapes to b...
This paper introduces a new method to solve the irregular-shape, full-rotation nesting problem by a ...
The aim is to develop and investigate the genetical method for arrangement of the free shape two-dim...
International audienceThis article presents a generic method to solve 2D multi-objective placement p...
In this paper a new algorithm to generate random simple polygons from a given set of points in a two...
Given a set of rectangular pieces and a fixed width with infinite length, the strip-packing problem ...
In the two-dimensional single large object placement problem, we are given a rectangular master surf...
International audienceThis paper presents a new approach of the genetic representation of a machines...
Given a set of rectangular pieces and a rectangular container, the two-dimensional knapsack problem ...
Cutting and packing problems are combinatorial optimisation problems. In most manufacturing situatio...
Colloque sans acte à diffusion restreinte.We propose efficient approximate solutions to large size p...
Abstract — Genetic algorithms have proven to be a well-suited technique for solving selected combina...
A new genetic algorithm for the macro cell placement problem is presented. The algorithm is based on...