Multi-Objective Evolutionary Optimization

Overview

The field studies how to find sets of solutions that capture trade-offs among competing goals, rather than a single best answer. Common approaches include NSGA-II and NSGA-III, SPEA2, MOEA/D, and differential evolution, with diversity preservation and constraint-handling methods to guide the search. Current work tackles large-scale, dynamic, uncertain, and expensive problems using techniques such as variable grouping, surrogates, adaptive operators, and learned guidance, across applications from engineering design to scheduling and machine learning. A central challenge is balancing convergence, diversity, feasibility, and evaluation cost; performance remains problem-dependent, while runtime theory and reliable algorithm selection are active concerns.

Latest papers

93 papers11 papers in the last four weeks, up 10% on the four weeks before. 0.1% of all new papers.

Nov 21, 2025

PepEVOLVE: Position-Aware Dynamic Peptide Optimization via Group-Relative Advantage

Macrocyclic peptides are an emerging modality that combines biologics-like affinity with small-molecule-like developability, yet their vast combinatorial space and multi-parameter objectives make lead optimization slow and challenging. Prior generative approaches for peptide lead optimization (e.g., PepINVENT) require chemists to pre-specify mutable positions for optimization, choices that are not always known a priori, and rely on static pretraining and optimization algorithms that limit the model's ability to generalize and effectively optimize peptide sequences. We introduce PepEVOLVE, a position-aware, dynamic framework that learns both where to edit and how to dynamically optimize peptides for multi-parameter improvement. PepEVOLVE (i) augments pretraining with dynamic masking and CHUCKLES shifting to improve generalization, (ii) uses a context-free multi-armed-bandit router that discovers high-reward residues, and (iii) couples a novel evolving optimization algorithm with group-relative advantage to stabilize reinforcement updates. During in silico evaluations, the router policy reliably learns and concentrates probability on chemically tractable sites that influence the desired peptide's properties. On a therapeutically motivated Rev-binding macrocycle benchmark, PepEVOLVE outperformed PepINVENT by reaching higher averaged permeability-weighted optimization scores of approximately 0.8 vs. 0.6, achieving best candidates with score of 0.97 (vs. 0.89), and converging in fewer steps under the task of optimizing permeability and lipophilicity with structure constraints. Overall, PepEVOLVE offers a practical, reproducible path to linear and macrocyclic peptide lead optimization when optimal edit sites are unknown, enabling more efficient chemical space exploration and improving design quality across multiple objectives to accelerate the design cycles.
Jun 6, 2025

Decomposability-Guided Cooperative Coevolution for Large-Scale Itinerary Planning

Large-scale itinerary planning is a variant of the traveling salesman problem, aiming to determine an optimal path that maximizes the collected point-of-interest (POI) scores while minimizing travel time and cost, subject to travel duration constraints. This paper analyzes inter-component dependence in large-scale itinerary planning and establishes sufficient conditions for weak decomposability, under which an optimal path can visit each cluster as a contiguous subpath. Guided by this weak decomposability, we propose a novel multi-objective cooperative coevolutionary algorithm for large-scale itinerary planning, addressing the challenges of component imbalance and interactions. Specifically, we design a dynamic decomposition strategy based on the normalized fitness within each component, define optimization potential considering component scale and contribution, and develop a computational resource allocation strategy. Finally, we evaluate the proposed algorithm on 18 real-world test cases, eight large-scale semi-synthetic test cases, and eight adapted public clustered orienteering problem benchmark cases. Comparative results show that the proposed algorithm achieves the highest mean hypervolume across all 34 test cases and significantly outperforms the compared algorithms. Ablation and optimizer-decoupling analyses further validate the effectiveness of its core mechanisms and the general applicability of the proposed framework, with particularly pronounced performance gains on large-scale benchmark instances.
May 16, 2025

Diffusion-based Evolutionary Optimization for 3D Multi-Objective Molecular Generation

De novo 3D molecular design with multiple properties and fragment-retention constraints is formulated as a constrained multi-objective optimization problem. Existing 3D diffusion models provide strong capabilities for generating novel molecules, but adapting them to new conditions and multi-objective optimization tasks remains difficult. We present Diffusion-based Evolutionary Molecular Optimization (DEMO), a framework that draws solely on the unconditional molecular prior of a frozen pretrained diffusion model to generate chemically valid 3D candidates, while evolutionary search handles conditional generation and constrained multi-objective optimization, without retraining or fine-tuning. DEMO performs crossover and mutation on intermediate diffusion states through an Evolutionary-Guided Diffusion (EGD) operator, combines 2D topology and 3D geometry in Structure-Aware Environmental Selection (SAES) to preserve structural diversity, and uses three cooperating populations to coordinate structural exploration, fragment-constraint satisfaction, and property optimization. Experimental results demonstrate that EGD outperforms task-specific conditional generators in property targeting; SAES preserves structural diversity while retaining competitive hypervolume in multi-objective optimization; and DEMO improves objective convergence and generates diverse feasible molecules under fragment constraints. These results show how evolutionary search can reuse existing diffusion models for diverse molecular design requirements.