A genetic algorithm for solving the two-dimensional cutting in glass sheets problem

Author

Canto, N.C.F. ; Costa, F. ; Sassi, R.J.

Author_Institution

Diretoria dos Cursos de Inf., Univ. Nove de Julho - Uninove, São Paulo, Brazil

fYear

2010

Firstpage

1

Lastpage

4

Abstract

This project consists of the study and development of solution methods based on evolutionary computation to solving Constraint Satisfaction Problems (CSPs). The CSPs consists of a variety of combinatorial optimization problems. In particular, is proposed the development of a genetic algorithm for solving the two-dimensional cutting problem, which consists in to determine an arrangement of pieces to be cut, maximizing the glass sheets utilization, but respecting the constraints imposed by production flow and delivery schedules.

Keywords

combinatorial mathematics; cutting; flow production systems; genetic algorithms; glass manufacture; operations research; scheduling; sheet materials; combinatorial optimization problems; constraint satisfaction problem solving; delivery scheduling; evolutionary computation; genetic algorithm; glass sheet problem; production flow constriant; two-dimensional cutting problem; Computers; Glass; Presses; Programming; Software; Algoritmo Genético; Problemas de Corte Bidimensional; Problemas de Satisfação de Restrição;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Systems and Technologies (CISTI), 2010 5th Iberian Conference on

Conference_Location

Santiago de Compostela

Print_ISBN

978-1-4244-7227-7

Type

conf

Filename

5556620