ABSTRACT
Many real-world applications contain complex optimization problems with several conflicting objectives. Finding a solution which can satisfy all the objectives is usually a challenging task for optimization algorithms. When dealing with these complex multi-objective problems, decision-makers want to find the best tradeoff between the conflicting objectives. Another challenge occurs in problems where multiple configurations of the input variables might yield the same objective function values. Such problems are called multimodal problems. For a decision maker, it might be of importance to obtain enough information about all the alternative optimal solutions that reach the same objective value. Traditionally, Evolutionary Algorithms make use selection processes based only on objective function values, which might be a disadvantage when faced with multimodal problems. In this article, we present two operators to use in multimodal multi-objective algorithms, namely a modified crowding distance operator and a neighbourhood Polynomial mutation, which take into account the distribution of solution in the decision space at run-time. Our experimental results demonstrate that the proposed operators are able to outperform the performance of a state-of-the-art method on six current multimodal benchmark functions.
- Shi Cheng, Hui Lu, Xiujuan Lei, and Yuhui Shi. 2018. A quarter century of particle swarm optimization. Complex & Intelligent Systems 4, 3 (2018), 227--239.Google ScholarCross Ref
- Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and TAMT Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE transactions on evolutionary computation 6, 2 (2002), 182--197. Google ScholarDigital Library
- Kalyanmoy Deb and Santosh Tiwari. 2005. Omni-optimizer: A procedure for single and multi-objective optimization. In International Conference on Evolutionary Multi-Criterion Optimization. Springer, Guanajuato, Mexico, 47--61. Google ScholarDigital Library
- Mohammad Hamdan. 2012. The distribution index in polynomial mutation for evolutionary multiobjective optimisation algorithms: An experimental study. In International Conference on Electronics Computer Technology. IEEE, Kanyakumari, India.Google Scholar
- Jing Liang, Weiwei Xu, Caitong Yue, Kunjie Yu, Hui Song, Oscar D Crisalle, and Boyang Qu. 2019. Multimodal multiobjective optimization with differential evolution. Swarm and Evolutionary Computation 44 (2019), 1028--1059.Google ScholarCross Ref
- Jing Liang, Caitong Yue, and Boyang Qu. 2016. Multimodal multi-objective optimization: a preliminary study. In Evolutionary Computation (CEC). IEEE, Vancouver, BC, Canada, 2454--2461.Google Scholar
- Ye Tian, Ran Cheng, Xingyi Zhang, and Yaochu Jin. 2017. PlatEMO: A MATLAB platform for evolutionary multi-objective optimization {educational forum}. IEEE Computational Intelligence Magazine 12, 4 (2017), 73--87.Google ScholarDigital Library
- Caitong Yue, Boyang Qu, and Jing Liang. 2018. A multiobjective particle swarm optimizer using ring topology for solving multimodal multiobjective problems. IEEE Transactions on Evolutionary Computation 22, 5 (2018), 805--817.Google ScholarCross Ref
- Aimin Zhou, Qingfu Zhang, and Yaochu Jin. 2009. Approximating the set of Pareto-optimal solutions in both the decision and objective spaces by an estimation of distribution algorithm. IEEE transactions on evolutionary computation 13, 5 (2009), 1167--1189. Google ScholarDigital Library
Index Terms
- Modified crowding distance and mutation for multimodal multi-objective optimization
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 ...
Multi-objective modified differential evolution algorithm with archive-base mutation for solving multi-objective $$p$$p-xylene oxidation process
Maximizing the diversity of the obtained objective vectors and increasing the convergence speed to the true Pareto front are two important issues in the design of multi-objective evolutionary algorithms (MOEAs). To solve complex multi-objective ...
Multimodal scalarized preferences in multi-objective optimization
GECCO '17: Proceedings of the Genetic and Evolutionary Computation ConferenceScalarization functions represent preferences in multi-objective optimization by mapping the vector of objectives to a single real value. Optimization techniques using scalarized preferences mainly focus on obtaining only a single global preference ...
Comments