Pruning-Based Pareto Front Generation for Mixed-Discrete Bi-Objective Optimization

preprint2013arXivOpen access

Abstract

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.