Abstract
The firefly algorithm (FA) was firstly proposed during 2008–2009 as one of the powerful population-based metaheuristic optimization techniques for solving continuous and combinatorial optimization problems. The FA has been proved and applied to various real-world problems in mostly single objective optimization manner. However, many real-world problems are typically formulated as the multiobjective optimization problems with complex constraints. In this paper, the multiobjective Levy-flight firefly algorithm (mLFFA) is developed for multiobjective optimization. The proposed mLFFA is validated against four standard multiobjective test functions to perform its effectiveness. The simulation results show that the proposed mLFFA algorithm is more efficient than the well-known algorithms from literature reviews including the vector evaluated genetic algorithm (VEGA), non-dominated sorting genetic algorithm II (NSGA-II), differential evolution for multiobjective optimization (DEMO) and multiobjective multipath adaptive tabu search (mMATS).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
