activity
20232026
most citedLearning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt

9 citations · 34 across the 18 of their papers we have counts for

collaborators
Showing cs.LGShow all

11 papers · 1 filter

cs.LG2026

RADAR: Learning to Route with Asymmetry-aware DistAnce Representations

Hang Yi, Ziwei Huang, Yining Ma +1

Recent neural solvers have achieved strong performance on vehicle routing problems (VRPs), yet they mainly assume symmetric Euclidean distances, restricting applicability to real-w…

cs.LG2025

Probing Neural Combinatorial Optimization Models

Zhiqin Zhang, Yining Ma, Zhiguang Cao +1

Neural combinatorial optimization (NCO) has achieved remarkable performance, yet its learned model representations and decision rationale remain a black box. This impedes both acad…

cs.LG2025

DesignX: Human-Competitive Algorithm Designer for Black-Box Optimization

Hongshu Guo, Zeyuan Ma, Yining Ma +3

Designing effective black-box optimizers is hampered by limited problem-specific knowledge and manual control that spans months for almost every detail. In this paper, we present \…

cs.LG2025

MetaBox-v2: A Unified Benchmark Platform for Meta-Black-Box Optimization

Zeyuan Ma, Yue-Jiao Gong, Hongshu Guo +11

Meta-Black-Box Optimization (MetaBBO) streamlines the automation of optimization algorithm design through meta-learning. It typically employs a bi-level structure: the meta-level p…

cs.LG2025

Diversity Optimization for Travelling Salesman Problem via Deep Reinforcement Learning

Qi Li, Zhiguang Cao, Yining Ma +2

Existing neural methods for the Travelling Salesman Problem (TSP) mostly aim at finding a single optimal solution. To discover diverse yet high-quality solutions for Multi-Solution…

cs.LG2024

ConfigX: Modular Configuration for Evolutionary Algorithms via Multitask Reinforcement Learning

Hongshu Guo, Zeyuan Ma, Jiacheng Chen +4

Recent advances in Meta-learning for Black-Box Optimization (MetaBBO) have shown the potential of using neural networks to dynamically configure evolutionary algorithms (EAs), enha…

cs.LG2024★ 7 cited

Hierarchical Neural Constructive Solver for Real-world TSP Scenarios

Yong Liang Goh, Zhiguang Cao, Yining Ma +3

Existing neural constructive solvers for routing problems have predominantly employed transformer architectures, conceptualizing the route construction as a set-to-sequence learnin…

cs.LG2024★ 1 cited

Symbol: Generating Flexible Black-Box Optimizers through Symbolic Equation Learning

Jiacheng Chen, Zeyuan Ma, Hongshu Guo +3

Recent Meta-learning for Black-Box Optimization (MetaBBO) methods harness neural networks to meta-learn configurations of traditional black-box optimizers. Despite their success, t…

cs.LG2023★ 9 cited

Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt

Yining Ma, Zhiguang Cao, Yeow Meng Chee

In this paper, we present Neural k-Opt (NeuOpt), a novel learning-to-search (L2S) solver for routing problems. It learns to perform flexible k-opt exchanges based on a tailored act…

cs.LG2023★ 5 cited

MetaBox: A Benchmark Platform for Meta-Black-Box Optimization with Reinforcement Learning

Zeyuan Ma, Hongshu Guo, Jiacheng Chen +5

Recently, Meta-Black-Box Optimization with Reinforcement Learning (MetaBBO-RL) has showcased the power of leveraging RL at the meta-level to mitigate manual fine-tuning of low-leve…

cs.LG2023★ 3 cited

Neural Multi-Objective Combinatorial Optimization with Diversity Enhancement

Jinbiao Chen, Zizhen Zhang, Zhiguang Cao +4

Most of existing neural methods for multi-objective combinatorial optimization (MOCO) problems solely rely on decomposition, which often leads to repetitive solutions for the respe…