Advanced search
Start date

Algoritmos evolutivos para alguns problemas em telecomunicações

Full text
Carlos Eduardo de Andrade
Total Authors: 1
Document type: Doctoral Thesis
Press: Campinas, SP.
Institution: Universidade Estadual de Campinas (UNICAMP). Instituto de Computação
Defense date:
Examining board members:
Flávio Keidi Miyazawa; Thiago Ferreira de Noronha; Luciana Salete Buriol; Cid Carvalho de Souza; Kelly Cristina Poldi
Advisor: Mauricio Guilherme de Carvalho Resende; Flávio Keidi Miyazawa

Cutting and packing problems are common problems that occur in many industry and business process. Their optimized resolution leads to great profits in several sectors. A common problem, that occur in textil and paper industries, is to cut a strip of some material to obtain several small items, using the minimum length of material. This problem, known by Two Dimensional Strip Packing Problem (2SP), is a hard combinatorial optimization problem. In this work, we present an exact algorithm to 2SP, restricted to two staged cuts (known by Two Dimensional Level Strip Packing, 2LSP). The algorithm uses the branch-and-price technique, and heuristics based on approximation algorithms to obtain upper bounds. The algorithm obtained optimal or almost optimal for small and moderate sized instances (AU)

FAPESP's process: 10/05233-5 - Evolutionary algorithms for some problems in telecommunications
Grantee:Carlos Eduardo de Andrade
Support Opportunities: Scholarships in Brazil - Doctorate