Felipe Honjo Ide
ABSTRACT
Although most real-world problems include many constraints that limit the set of feasible solutions, there is significantly less study in constrained benchmark problems when compared to unconstrained ones. SAT constraints attempt to aid the study of constrained multi-objective optimization by allowing any number of equality and inequality constraints, with controllable feasibility ratio, to be added to state-of-the-art benchmark problems. This paper studies the features of SAT constraints by looking at some of their properties such as distribution, clustering and distance of feasible solutions in the decision and objective space when added to 0-1 multi-objective knapsack problems and multi-objective MNK-Landscapes.
- H. Aguirre and K. Tanaka. 2007. Working principles, behavior, and performance of MOEAs on MNK-landscapes. European Journal of Operational Research 181 (09 2007), 1670--1690. Google Scholar
Cross Ref
- H. E. Aguirre and K. Tanaka. 2004. Effects of elitism and population climbing on multiobjective MNK-landscapes. In Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat No.04TH8753), Vol. 1. 449--456 Vol.1. Google ScholarCross Ref
- A. Biere, M. Heule, H. van Maaren, and T. Walsh. 2009. Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications. IOS Press, NLD.Google Scholar
- K. Gokhan and S. Serpil. 2014. A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. European Journal of Operational Research 232, 3 (2014), 479--488. Google ScholarCross Ref
- R. W. Hamming. 1950. Error detecting and error correcting codes. The Bell System Technical Journal 29, 2 (1950), 147--160. Google ScholarCross Ref
- F. H. Ide, H. E. Aguirre, M. Miyakawa, and W. Darrell. 2021. A Generator for Scalable SAT Constrained Multi-Objective Optimization Benchmark Problems. In Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI).Google Scholar
- C. Picard and J. Schiffmann. 2001. Realistic Constrained Multi-Objective Optimization Benchmark Problems from Design. IEEE Transactions on Evolutionary Computation (2001), 1--1. Google ScholarCross Ref
- R. Tanabe and A. Oyama. 2017. A note on constrained multi-objective optimization benchmark problems. In 2017 IEEE Congress on Evolutionary Computation (CEC). 1127--1134. Google ScholarDigital Library
- S. Verel, A. Liefooghe, L. Jourdan, and C. Dhaenens. 2013. On the structure of multiobjective combinatorial search space: MNK-landscapes with correlated objectives. European Journal of Operational Research 227, 2 (Jan. 2013), 331--342. Google ScholarCross Ref
Index Terms
- Exploring the decision and objective space of SAT constrained multi-objective problems
Recommendations
A hybrid method for solving multi-objective global optimization problems
AbstractReal optimization problems often involve not one, but multiple objectives, usually in conflict. In single-objective optimization there exists a global optimum, while in the multi-objective case no optimal solution is clearly defined but rather a ...
A constrained multi-objective evolutionary algorithm assisted by an additional objective function
AbstractIn constrained multi-objective optimization, the degree of constraint violation as an additional objective function has been optimized together with the original M objective functions for better diversity. However, it still faces the ...
Highlights- The main population solves an (M + 1)-objective optimization problem.
- An ...
A comparative study of constrained multi-objective evolutionary algorithms on constrained multi-objective optimization problems
2017 IEEE Congress on Evolutionary Computation (CEC)Solving constrained multi-objective optimization problems is a difficult task, it needs to simultaneously optimize multiple conflicting objectives and a number of constraints. This paper first reviews a number of popular constrained multi-objective ...
Comments