Learn More
This paper proposes two constraint-handling techniques based on multiobjective optimization with biased dynamic weights for constrained optimization problems (COPs). Transforming a COP into an unconstrained biobjective optimization, two popular strategies based on decomposition, i.e. Tchebycheff approach (TEA) and weighted sum approach (WSA) are used in(More)
In recent years, many constraint-handling techniques maintaining infeasible individuals in the population have demonstrated their effectiveness for solving constrained optimization problems. Generally, the effective utilization of the potential of the infeasible individuals will improve the performance of the algorithms. This paper proposes an approach(More)
  • 1