Extension of the firefly algorithm and preference rules for solving MINLP problems

Abstract

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 the FA of a simple rounded-based heuristic and four preference rules to find and converge to MINLP feasible solutions. Preliminary numerical experiments are carried out to validate the proposed methodology.This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT - Fundac¸ao para a Ci ˜ encia e Tecnologia, ˆ within the projects UID/CEC/00319/2013 and UID/MAT/00013/2013.info:eu-repo/semantics/publishedVersio