Abstract
This paper presents a novel metaheuristic algorithm, simulated metamorphosis (SM), inspired by the biological concepts of metamorphosis evolution. The algorithm is motivated by the need for interactive, multi-objective, and fast optimization approaches to solving problems with fuzzy conflicting goals and constraints. The algorithm mimics the metamorphosis process, going through three phases: initialization, growth, and maturation. Initialization involves random but guided generation of a candidate solution. After initialization, the algorithm successively goes through two loops, that is, growth and maturation. Computational tests performed on benchmark problems in the literature show that, when compared to competing metaheuristic algorithms, SM is more efficient and effective, producing better solutions within reasonable computation times.