This note proposes an effective pruning-based Pareto front generation method in mixed-discrete bi-objective optimization. The mixed-discrete problem is decomposed into multiple continuous subproblems; two-phase pruning steps identify and prune out non-contributory subproblems to the Pareto front construction. The efficacy of the proposed method is demonstrated on two benchmark examples.
@article{arxiv.1306.1589,
title = {Pruning-Based Pareto Front Generation for Mixed-Discrete Bi-Objective Optimization},
author = {SeungBum Hong and Jaemyung Ahn and Han-Lim Choi},
journal= {arXiv preprint arXiv:1306.1589},
year = {2013}
}
Comments
4 pages, 3 figures, submitted to Structural and Multidisciplinary Optimization