A. Miguel Gomes

Learn More
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space while linear programming models are solved to generate neighbourhoods during the search process. These linear programming models, which are used to locally optimise the layouts,(More)
This paper presents a very special cutting path determination problem appearing in a high precision tools factory, and provides two new heuristics for its resolution. Particular features of both the cutting process, and of the material to be cut, bring in a set of unusual constraints, when compared with other cutting processes, which confer additional(More)
The nesting problem is a two-dimensional cutting and packing problem where the small pieces to cut have irregular shapes. A particular case of the nesting problem occurs when congruent copies of one single shape have to fill, as much as possible, a limited sheet. Traditional approaches to the nesting problem have difficulty to tackle with high number of(More)
Irregular nesting is a subgroup of cutting and packing problems in which a set of irregular items must be inserted in a rectangular container with a variable width. It is often found in industries such as textile, wood and shipbuilding and an efficient solution usually renders an economical and environmental positive impact. Due to the complex geometry of(More)
  • 1