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

9 citations · 35 across the 19 of their papers we have counts for

collaborators
Showing cs.LGShow all

12 papers · 1 filter

cs.LG2026

READY: Reward Discovery for Meta-Black-Box Optimization

Zechuan Huang, Zhiguang Cao, Hongshu Guo +2

Meta-Black-Box Optimization (MetaBBO) is an emerging avenue within Optimization community, where algorithm design policy could be meta-learned by reinforcement learning to enhance…

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

Instance Generation for Meta-Black-Box Optimization through Latent Space Reverse Engineering

Chen Wang, Yue-Jiao Gong, Zhiguang Cao +1

To relieve intensive human-expertise required to design optimization algorithms, recent Meta-Black-Box Optimization (MetaBBO) researches leverage generalization strength of meta-le…

cs.LG2025

Generalizable Heuristic Generation Through LLMs with Meta-Optimization

Yiding Shi, Jianan Zhou, Wen Song +4

Heuristic design with large language models (LLMs) has emerged as a promising approach for tackling combinatorial optimization problems (COPs). However, existing approaches often r…

cs.LG2025

Surrogate Learning in Meta-Black-Box Optimization: A Preliminary Study

Zeyuan Ma, Zhiyang Huang, Jiacheng Chen +2

Recent Meta-Black-Box Optimization (MetaBBO) approaches have shown possibility of enhancing the optimization performance through learning meta-level policies to dynamically configu…

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.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★ 2 cited

Efficient Meta Neural Heuristic for Multi-Objective Combinatorial Optimization

Jinbiao Chen, Jiahai Wang, Zizhen Zhang +3

Recently, neural heuristics based on deep reinforcement learning have exhibited promise in solving multi-objective combinatorial optimization problems (MOCOPs). However, they are s…

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…