.png){kind=icon}
.png){kind=icon}
Return
The Parallel Epsilon Algorithm for Triobjective Integer Optimization Problems
.png){kind=icon}
PRE
AI
DOI：10.1287/ijoc.2024.0798.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a new algorithm, the parallel epsilon algorithm (PEA), for enumerating all nondominated images of triobjective integer optimization problems. The algorithm solves at most 2| YN | + 1 lexicographic epsilon-constraint scalarization problems, where YN is the set of all nondominated images. PEA is easy to implement and easy to parallelize. A novel order on the nondominated set induced by the structure of the parameter set of the lexicographic epsilon-constraint scalarization is utilized to split the computational load into a number of independent parallel tasks. The advantage of the proposed algorithm through parallelization is demonstrated in a computational study. PEA is significantly faster than other state-of-the-art algorithms and achieves an almost linear speedup in the number of threads.
Keywords:
multicriteria optimization
parallel computing
multiobjective integer programming
<<-constraint scalarization
Pareto optimality
Journal
I
IF:
2.1
Papers:
86
Citations:
3.2K