Performance of a Constrained Version of MOEA/D on CTP-series Test Instances

Constrained multiobjective optimization arises in many real-life applications, and is therefore gaining a constantly growing attention of the researchers. Constraint handling techniques differ in the way infeasible solutions are evolved in the evolutionary process along with their feasible counterparts. Our recently proposed threshold based penalty function gives a chance of evolution to infeasible solutions whose constraint violation is less than a specified threshold value. This paper embeds the threshold based penalty function in the update and replacement scheme of multi-objective evolutionary algorithm based on decomposition (MOEA/D) to find tradeoff solutions for constrained multiobjective optimization problems (CMOPs). The modified algorithm is tested on CTP-series test instances in terms of the hypervolume metric (HV-metric). The experimental results are compared with the two well-known algorithms, NSGA-II and IDEA. The sensitivity of algorithm to the adopted parameters is also checked. Empirical results demonstrate the effectiveness of the proposed penalty function in the MOEA/D framework for CMOPs

@article{Jan2016,
  title     = {Performance of a Constrained Version of MOEA/D on CTP-series Test Instances},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {7},
  number    = {6},
  year      = {2016},
  publisher = {The Science and Information Organization},
  author    = {Muhammad Asif Jan and Rashida Adeeb Khanum and Nasser Mansoor Tairan and Wali Khan Mashwani},
  doi       = {10.14569/IJACSA.2016.070665},
  url       = {https://doi.org/10.14569/IJACSA.2016.070665}
}