activity
20222026
most citedLearning Generalizable Models for Vehicle Routing Problems via Knowledge Distillation

25 citations · 30 across the 9 of their papers we have counts for

collaborators

10 papers

cs.AI2026

Reinforcement Learning Enhanced LLM Agents for Complex Vehicle Routing Problems

Yi Chen, Zikang Yu, Jiahai Wang +3

Vehicle Routing Problems (VRPs) are fundamental combinatorial optimization problems with widespread applications in various scenarios. The advanced optimization solvers can effecti…

cs.LG2026

Edge-aware Decoding for Neural Asymmetric Routing

Li Liang, Jinbiao Chen, Zizhen Zhang

Neural asymmetric routing models increasingly encode directionality through matrix representations and asymmetry-aware attention. The final routing action, however, is not a node i…

cs.AI2026

Automated Reformulation of Robust Optimization via Memory-Augmented Large Language Models

Jinbiao Chen, Shuang Jin, Guoyun Zhang +3

Robust optimization (RO) provides a principled framework for decision-making under uncertainty, but its practical use is often limited by the need to manually reformulate uncertain…

cs.LG2026

WeCon: An Efficient Weight-Conditioned Neural Solver for Multi-Objective Combinatorial Optimization Problems

Xuan Wu, Jinbiao Chen, Yang Li +7

Existing neural solvers for Multi-Objective Combinatorial Optimization Problems (MOCOPs) commonly adopt decomposition-based strategies that scalarize a MOCOP into multiple subprobl…

cs.NE2025

UCPO: A Universal Constrained Combinatorial Optimization Method via Preference Optimization

Zhanhong Fang, Debing Wang, Jinbiao Chen +2

Neural solvers have demonstrated remarkable success in combinatorial optimization, often surpassing traditional heuristics in speed, solution quality, and generalization. However,…

cs.AI2025

Preference-Driven Multi-Objective Combinatorial Optimization with Conditional Computation

Mingfeng Fan, Jianan Zhou, Yifeng Zhang +3

Recent deep reinforcement learning methods have achieved remarkable success in solving multi-objective combinatorial optimization problems (MOCOPs) by decomposing them into multipl…

cs.LG2025

BOPO: Neural Combinatorial Optimization via Best-anchored and Objective-guided Preference Optimization

Zijun Liao, Jinbiao Chen, Debing Wang +2

Neural Combinatorial Optimization (NCO) has emerged as a promising approach for NP-hard problems. However, prevailing RL-based methods suffer from low sample efficiency due to spar…

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…

cs.LG2022★ 25 cited

Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillation

Jieyi Bi, Yining Ma, Jiahai Wang +4

Recent neural methods for vehicle routing problems always train and test the deep models on the same instance distribution (i.e., uniform). To tackle the consequent cross-distribut…