Enabling Population-Based Architectures for Neural Combinatorial Optimization

2026-01-13

AI Summary

This work proposes a population-based neural combinatorial optimization framework that addresses the limited exploratory capacity and robustness of traditional neural approaches, which typically operate on a single solution. By leveraging neural networks to jointly represent a set of candidate solutions, the framework incorporates a population-aware hierarchical classification mechanism to explicitly model inter-solution information sharing and diversity control. This design simultaneously reinforces high-quality solutions and preserves population diversity, effectively bridging the gap between neural optimization and classical population-based metaheuristics. Experimental results on the Max-Cut and Maximum Independent Set problems demonstrate that the proposed framework substantially improves both solution quality and algorithmic robustness.

Technology Category

• Search and Optimization: Mixed Discrete/Continuous Search
• Constraint Satisfaction and Optimization: Mixed Discrete/Continuous Optimization
• Intelligent Robots: Learning & Optimization for ROB

Application Category

• Graph Algorithms and Modeling for the Web: Graph neural networks and deep learning approaches for Web-related graphs
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking

Abstract

Neural Combinatorial Optimization (NCO) has mostly focused on learning policies, typically neural networks, that operate on a single candidate solution at a time, either by constructing one from scratch or iteratively improving it. In contrast, decades of work in metaheuristics have shown that maintaining and evolving populations of solutions improves robustness and exploration, and often leads to stronger performance. To close this gap, we study how to make NCO explicitly population-based by learning policies that act on sets of candidate solutions. We first propose a simple taxonomy of population awareness levels and use it to highlight two key design challenges: (i) how to represent a whole population inside a neural network, and (ii) how to learn population dynamics that balance intensification (generating good solutions) and diversification (maintaining variety). We make these ideas concrete with two complementary tools: one that improves existing solutions using information shared across the whole population, and the other generates new candidate solutions that explicitly balance being high-quality with diversity. Experimental results on Maximum Cut and Maximum Independent Set indicate that incorporating population structure is advantageous for learned optimization methods and opens new connections between NCO and classical population-based search.

Problem

• Neural Combinatorial Optimization
• Population-Based Optimization
• Solution Representation
• Population Dynamics
• Metaheuristics

Innovation

• Population-Based Optimization
• Neural Combinatorial Optimization
• Solution Diversity
• Population Representation
• Intensification and Diversification