A Novel Immune Algorithm for Multiparty Multiobjective Optimization
Kesheng Chen, Wenjian Luo, Qi Zhou, Yujiang liu, Peilan Xu, Yuhui Shi

TL;DR
This paper introduces a multiparty immune algorithm (MPIA) designed to effectively solve complex multiparty multiobjective optimization problems involving multiple decision makers, outperforming existing algorithms in diverse scenarios.
Contribution
The paper proposes a novel immune algorithm with inter-party guided crossover and adaptive strategies tailored for multiparty multiobjective problems, enhancing search diversity and performance.
Findings
MPIA outperforms traditional MOEAs in synthetic tests.
MPIA achieves superior results in real-world UAV path planning.
Adaptive strategies improve population diversity across DMs.
Abstract
Traditional multiobjective optimization problems (MOPs) are insufficiently equipped for scenarios involving multiple decision makers (DMs), which are prevalent in many practical applications. These scenarios are categorized as multiparty multiobjective optimization problems (MPMOPs). For MPMOPs, the goal is to find a solution set that is as close to the Pareto front of each DM as much as possible. This poses challenges for evolutionary algorithms in terms of searching and selecting. To better solve MPMOPs, this paper proposes a novel approach called the multiparty immune algorithm (MPIA). The MPIA incorporates an inter-party guided crossover strategy based on the individual's non-dominated sorting ranks from different DM perspectives and an adaptive activation strategy based on the proposed multiparty cover metric (MCM). These strategies enable MPIA to activate suitable individuals for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
