Embedding a competitive ranking method in the artificial fish swarm algorithm for global optimization
Nonlinear programming problems are known to be difficult to solve, especially those that involve a multimodal objective function and/or non-convex and at the same time disjointed solution space. Heuristic methods that do not require derivative calculations have been used to solve this type of constr...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2010
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/17890 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/17890 |