Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
The effectiveness of multiobjective optimizer in single-objective optimization enviroment
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Reference point based multi-objective optimization using evolutionary algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A multi-objective genetic local search algorithm and itsapplication to flowshop scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Simultaneous use of different scalarizing functions in MOEA/D
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Alleviate the hypervolume degeneration problem of NSGA-II
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Variable space diversity, crossover and mutation in MOEA solving many-objective knapsack problems
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
This paper proposes an idea of using evolutionary multiobjective optimization (EMO) to optimize scalarizing functions. We assume that a scalarizing function to be optimized has already been generated from an original multiobjective problem. Our task is to optimize the given scalarizing function. In order to efficiently search for its optimal solution without getting stuck in local optima, we generate a new multiobjective problem to which an EMO algorithm is applied. The point is to specify multiple objectives, which are similar to but different from the scalarizing function, so that the location of the optimal solution is near the center of the Pareto front of the generated multiobjective problem. The use of EMO algorithms helps escape from local optima. It also helps find a number of alternative solutions around the optimal solution. Difficulties of Pareto ranking-based EMO algorithms in the handling of many objectives are avoided by the use of similar objectives. In this paper, we first demonstrate that the performance of EMO algorithms as single-objective optimizers of scalarizing functions highly depends on the choice of multiple objectives. Based on this observation, we propose a specification method of multiple objectives for the optimization of a weighted sum fitness function. Experimental results show that our approach works very well in the search for not only a single optimal solution but also a number of good alternative solutions around the optimal solution. Next we evaluate the performance of our approach in comparison with a hybrid EMO algorithm where a single-objective fitness evaluation scheme is probabilistically used in an EMO algorithm. Then we show that our approach can be also used to optimize other scalarizing functions (e.g., those based on constraint conditions and reference solutions). Finally we show that our approach is applicable not only to scalarizing functions but also other single-objective optimization problems.