Loading...
Please wait, while we are loading the content...
Similar Documents
Modelos e Algoritmos para o Problema de Alocação Generalizada (PAG) e Aplicações
| Content Provider | Semantic Scholar |
|---|---|
| Author | Pigatti, Alexandre Mestrado, Dissertação De Altoé, Alexandre |
| Copyright Year | 2003 |
| Abstract | Pigatti, Alexandre Altoe; Poggi de Aragao, Marcus; Uchoa, Eduardo. . Rio de Janeiro, 2003. 74p. MSc. Dissertation — Departamento de Informatica, Pontificia Universidade Catolica do Rio de Janeiro. This dissertation tackles the Generalized Assignment Problem (PAG), models and algorithms are studied and proposed. This work was motivated by a real world application: the Truck Loading Problem (PCC). Research was done on approximated (metaheuristics) and exact algorithm for solving the PAG. The approximated algorithms proposed were based on a recent idea from Fischetti and Lodi (2003). It uses integer programming to explore wider neighborhoods. The results were compared to the best known, while demanding much less implementation effort and using less cpu time. The exact algorithm proposed is a branch-and-cut-and-price developed from the branch-and-price algorithm of Savelsbergh (1997). We used stabilized column generation techniques similar to the one by Du Merle, Villeneuve, Desrosiers and Hansen (1999), and devised experiments with different implementations of this mechanism. The resulting algorithm proved its efficiency by solving to optimality open instances from the literature. Finally, experiments with the PCC turned possible the evaluation of the codes developed on real problems. |
| File Format | PDF HTM / HTML |
| DOI | 10.17771/pucrio.acad.4132 |
| Alternate Webpage(s) | http://www2.dbd.puc-rio.br/pergamum/tesesabertas/0115650_03_pretextual.pdf |
| Alternate Webpage(s) | https://doi.org/10.17771/pucrio.acad.4132 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
