Extension of the firefly algorithm and preference rules for solving MINLP problems
An extension of the firefly algorithm (FA) for solving mixed-integer nonlinear programming (MINLP) problems is presented. Although penalty functions are nowadays frequently used to handle integrality conditions and inequality and equality constraints, this paper proposes the implementation within th...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2017
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/49141 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/49141 |