Threshold Based Penalty Functions for Constrained Multiobjective Optimization

This paper compares the performance of our re-cently proposed threshold based penalty function against its dynamic and adaptive variants. These penalty functions are incorporated in the update and replacement scheme of the multiobjective evolutionary algorithm based on decomposition (MOEA/D) framework to solve constrained multiobjective op-timization problems (CMOPs). As a result, the capability of MOEA/D is extended to handle constraints, and a new algorithm, denoted by CMOEA/D-DE-TDA is proposed. The performance of CMOEA/D-DE-TDA is tested, in terms of the values of IGD-metric and SC-metric, on the well known CF-series test instances. The experimental results are also compared with the three best performers of CEC 2009 MOEA competition. Empirical results show the pitfalls of the proposed penalty functions.

@article{Jan2016,
  title     = {Threshold Based Penalty Functions for Constrained Multiobjective Optimization},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {7},
  number    = {2},
  year      = {2016},
  publisher = {The Science and Information Organization},
  author    = {Muhammad Asif Jan and Nasser Mansoor Tairan and Rashida Adeeb Khanum and Wali Khan Mashwani},
  doi       = {10.14569/IJACSA.2016.070282},
  url       = {https://doi.org/10.14569/IJACSA.2016.070282}
}