APLICACION DE ALGORITMOS ESTOCASTICOS DE OPTIMIZACION AL PROBLEMA DE LA DISPOSICION DE OBJETOS NO-CONVEXOS

Abstract

The placement of convex objects in the plane, specially rectangular objects has been studied extensively in the literature and its applications to VLSI designs, the steel industry (stock cutting). The placement of non convex objects and its application in many design and textile industries, specially the textile industry has been less studied. Mathematical Approaches determining and adequate solution of such problems include linear programming and the newest genetic algorithms. In this paper we consider
a particular industrial problem, the design of printing sheets for decorative porcelane. These objects permit inclusions and other geometric situations which do not appear in the case of convex objects. In this paper we proof results related with this problem for different algorithms: a heuristic algorithm, simulated annealing algorithm and a genetic algorithm