The Binary Algorithm for finding the best weak-constraints in contradictory weak-constrained optimization problems

Abstract

There are many Contradictory Weak-Constrained Optimization Problems (CWCOPs) in the application fields, but rarely researched. One key of solving CWCOPs is finding the Best Weak-Constraints (BWCs), so the Binary Algorithm for finding the BWCs (BWCs-BA) in CWCOPs was proposed. BWCs-BA first determines the number of weak-constraints in BWCs, then uses the number for solving the BWCs. Because the general constrained optimization test functions have no weak-constraint, one 2-D and five n-D (based on 24 well-known benchmark test functions) test functions of CWCOPs were constructed, and the performance of BWCs-BA is tested on them. The experimental results show, compared with some other existing methods, the BWCs-BA reduces the test times while finding all of the BWCs.