Pareto front generation with knee-point based pruning for mixed discrete\n multi-objective optimization

2017/09/26 by Juseong Lee, Lee, Juseong, Lee, Sang-Il +4
Computer Science · Engineering · #Advanced Control Systems Optimization #Advanced Multi-Objective Optimization Algorithms #FOS: Mathematics #Metaheuristic Optimization Algorithms Research #Optimization and Control (math.OC)

paper · pdf · doi:10.48550/arxiv.1709.09311

openalex publication_date 2017/09/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This note proposes an algorithm to generate the Pareto front of a mixed\ndiscrete multi-objective optimization problem based on the pruning of\nirrelevant subproblems. An existing pruning-based method for a mixed discrete\nbi-objective problem is extended for general multi-objective cases by\nintroducing a new reference point for pruning decision - the knee point. The\nvalidity of the proposed procedure is demonstrated through case studies.\n

Related

• Pruning-Based Pareto Front Generation for Mixed-Discrete Bi-Objective Optimization
• Pareto sensitivity, most-changing sub-fronts, and knee solutions
• Algorithms for Generating Pareto Fronts of Multi-objective Integer and Mixed-Integer Programming Problems
• A Method for Generating a Well-Distributed Pareto Set in Nonlinear Multiobjective Optimization
• A trust-region approach for computing Pareto fronts in multiobjective optimization