| Texto completo | |
| Autor(es): |
Maximo, Vinicius R.
;
Nascimento, Maria C. V.
Número total de Autores: 2
|
| Tipo de documento: | Artigo Científico |
| Fonte: | Journal of Heuristics; v. 25, n. 4-5, p. 26-pg., 2019-10-01. |
| Resumo | |
Hybrid heuristic methods have lately been pointed out as an efficient approach to combinatorial optimization problems. The main reason behind this is that, by combining components from different metaheuristics, it is possible to explore solutions (which would be unreachable without hybridization) in the search space. In particular, evolutionary algorithms may get trapped into local optimum solutions due to the insufficient diversity of the solutions influencing the search process. This paper presents a hybridization of the recently proposed metaheuristic-intelligent-guided adaptive search (IGAS)-with the well-known path-relinking algorithm to solve large scale instances of the maximum covering location problem. Moreover, it proposes a slight change in IGAS that was tested through computational experiments and has shown improvement in its computational cost. Computational experiments also attested that the hybridized IGAS outperforms the results found in the literature. (AU) | |
| Processo FAPESP: | 13/07375-0 - CeMEAI - Centro de Ciências Matemáticas Aplicadas à Indústria |
| Beneficiário: | Francisco Louzada Neto |
| Modalidade de apoio: | Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs |
| Processo FAPESP: | 15/21660-4 - Hibridização de métodos heurísticos e exatos para abordar problemas de otimização combinatória |
| Beneficiário: | Mariá Cristina Vasconcelos Nascimento Rosset |
| Modalidade de apoio: | Auxílio à Pesquisa - Regular |