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 2025Show all

5 papers · 1 filter

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.AI2025

SHIELD: Multi-task Multi-distribution Vehicle Routing Solver with Sparsity and Hierarchy

Yong Liang Goh, Zhiguang Cao, Yining Ma +3

Recent advances toward foundation models for routing problems have shown great potential of a unified deep model for various VRP variants. However, they overlook the complex real-w…

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…