Enabling Population-Based Architectures for Neural Combinatorial Optimization
cs.NE, cs.LG
Submitted: 2026-01-13
Updated: 2026-09-14
Comments: Accepted manuscript. Published in IEEE Transactions on Evolutionary Computation. DOI: 10.1109/TEVC.2026.3730516. Revised version incorporating the changes made during peer review
Journal ref: IEEE Transactions on Evolutionary Computation, 2026
DOI: 10.1109/TEVC.2026.3730516
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Neural Combinatorial Optimization with Reinforcement Learning
- Self-Improved Learning for Scalable Neural Combinatorial Optimization
- Instance-Conditioned Adaptation for Large-scale Generalization of Neural Routing Solver
- Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration
- Memory-Enhanced Neural Solvers for Routing Problems
- Accelerating Vehicle Routing via AI-Initialized Genetic Algorithms
- PolyNet: Learning Diverse Solution Strategies for Neural Combinatorial Optimization
- A Generalization of Transformer Networks to Graphs
- A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimization
- A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization
Related papers
- Evolutionary Ensemble of Agents
- Encoding and Decoding Temporal Signals with Spiking Bandpass Wavelets
- Large Language Models and Evolutionary Computation: A Critical Review of Bidirectional Interaction, Automated Algorithm Design, and Co-Adaptive Systems
- Learning Alzheimer's Disease Signatures by bridging EEG with Spiking Neural Networks and Biophysical Simulations
- Investigating Hyperparameter Optimization and Transferability for ES-HyperNEAT: A TPE Approach
- S-AI-Recursive: A Bio-Inspired and Temporal Sparse AI Architecture for Iterative, Introspective, and Energy-Frugal Reasoning