Linear Subset Size Scheduling for Many-objective Optimization using NSGA-II based on Pareto Partial Dominance

Makoto Ohki

2018

Abstract

This paper describes techniques for improving the solution search performance of a multi-objective evolutionary algorithm (MOEA) in many-objective optimization problems (MaOP). As an MOEA for MaOP, we focus on NSGA-II based on Pareto partial dominance. NSGA-II based on Pareto partial dominance requires beforehand a combination list of the number of objective functions to be used for Pareto partial dominance. Moreover, the contents of the combination list greatly influence the optimization result. We propose to schedule a parameter r meaning the subset size of objective functions for Pareto partial dominance. This improvement not only releases users from the schedule of the parameter r but also improves the convergence to Pareto optimal solutions (POS) and the diversity of the individual set obtained by the optimization. Moreover, we propose to kill individuals of the archive set, where the individuals have the same contents as the individual created by the mating. This improvement excludes individuals with the same contents which obtained relatively good evaluations. The improved technique and other conventional techniques are applied to a many-objective 0/1 knapsack problem for verification of the effectiveness.

Paper Citation

in Harvard Style

Ohki M. (2018). Linear Subset Size Scheduling for Many-objective Optimization using NSGA-II based on Pareto Partial Dominance.In Proceedings of the 15th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-758-321-6, pages 277-283. DOI: 10.5220/0006905402770283

in Bibtex Style

@conference{icinco18,
author={Makoto Ohki},
title={Linear Subset Size Scheduling for Many-objective Optimization using NSGA-II based on Pareto Partial Dominance},
booktitle={Proceedings of the 15th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2018},
pages={277-283},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006905402770283},
isbn={978-989-758-321-6},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 15th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - Linear Subset Size Scheduling for Many-objective Optimization using NSGA-II based on Pareto Partial Dominance
SN - 978-989-758-321-6
AU - Ohki M.
PY - 2018
SP - 277
EP - 283
DO - 10.5220/0006905402770283