Simplified tabu search with random-based searches for bound constrained global optimization
This paper proposes a simplified version of the tabu search algorithm that solely uses randomly generated direction vectors in the exploration and intensification search procedures, in order to define a set of trial points while searching in the neighborhood of a given point. In the diversification...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2020
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/68330 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/68330 |