Metaheuristics for solving mathematical programming problems
This undergraduate research aims to study metaheuristics for solving mathematical programming problems. In optimization's context, metaheuristics are strategies which use problem specific knowledge to, stochastically use solutions worse than the current in order to avoid local maximum or minimu...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Online |
| Language: | Portuguese |
| Published: |
Universidade Estadual de Campinas
2019
|
| Subjects: | |
| Online Access: | https://econtents.sbu.unicamp.br/eventos/index.php/pibic/article/view/2195 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This undergraduate research aims to study metaheuristics for solving mathematical programming problems. In optimization's context, metaheuristics are strategies which use problem specific knowledge to, stochastically use solutions worse than the current in order to avoid local maximum or minimum. The literature about metaheuristics is huge and continues in expansion, mostly by its commercial interest, once most real problems are far too large to be solved by exact algorithms. This project considered a wide variety of metaheuristics and focused on a particular one: The Ant Colony Optmization applied to the Symmetric Travelling Salesman Problem (TSP). |
|---|---|
| ISSN: | 2596-1969 |
