9 citations · 34 across the 18 of their papers we have counts for
18 papers
Interpreting Neural Combinatorial Optimization via Evolving Programmatic Bottlenecks
Haocheng Duan, Yuxin Guo, Jieyi Bi +4
Neural Combinatorial Optimization (NCO) achieves strong performance, yet its black-box nature remains a key roadblock to deployment and scientific diagnosis. Standard interpretabil…
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…
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…
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…
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 \…
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…
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…
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…
Learning to Handle Complex Constraints for Vehicle Routing Problems
Jieyi Bi, Yining Ma, Jianan Zhou +4
Vehicle Routing Problems (VRPs) can model many real-world scenarios and often involve complex constraints. While recent neural methods excel in constructing solutions based on feas…
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…
MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts
Jianan Zhou, Zhiguang Cao, Yaoxin Wu +4
Learning to solve vehicle routing problems (VRPs) has garnered much attention. However, most neural solvers are only structured and trained independently on a specific problem, mak…
Auto-configuring Exploration-Exploitation Tradeoff in Evolutionary Computation via Deep Reinforcement Learning
Zeyuan Ma, Jiacheng Chen, Hongshu Guo +2
Evolutionary computation (EC) algorithms, renowned as powerful black-box optimizers, leverage a group of individuals to cooperatively search for the optimum. The exploration-exploi…
Deep Reinforcement Learning for Dynamic Algorithm Selection: A Proof-of-Principle Study on Differential Evolution
Hongshu Guo, Yining Ma, Zeyuan Ma +5
Evolutionary algorithms, such as Differential Evolution, excel in solving real-parameter optimization challenges. However, the effectiveness of a single algorithm varies across dif…
LLaMoCo: Instruction Tuning of Large Language Models for Optimization Code Generation
Zeyuan Ma, Hongshu Guo, Jiacheng Chen +4
Recent research explores optimization using large language models (LLMs) by either iteratively seeking next-step solutions from LLMs or directly prompting LLMs for an optimizer. Ho…
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…
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…
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…
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…