activity
20222026
most citedNeural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization

20 citations · 38 across the 5 of their papers we have counts for

collaborators

9 papers

cs.LG2026

Efficient Decoder Scaling Strategy for Neural Routing Solvers

Qing Luo, Fu Luo, Ke Li +1

Construction-based neural routing solvers, typically composed of an encoder and a decoder, have emerged as a promising approach for solving vehicle routing problems. While recent s…

cs.LG2025

MTL-KD: Multi-Task Learning Via Knowledge Distillation for Generalizable Neural Vehicle Routing Solver

Yuepeng Zheng, Fu Luo, Zhenkun Wang +2

Multi-Task Learning (MTL) in Neural Combinatorial Optimization (NCO) is a promising approach to train a unified model capable of solving multiple Vehicle Routing Problem (VRP) vari…

cs.LG2025

Improving Generalization of Neural Combinatorial Optimization for Vehicle Routing Problems via Test-Time Projection Learning

Yuanyao Chen, Rongsheng Chen, Fu Luo +1

Neural Combinatorial Optimization (NCO) has emerged as a promising learning-based paradigm for addressing Vehicle Routing Problems (VRPs) by minimizing the need for extensive manua…

cs.LG2025

Rethinking Neural Combinatorial Optimization for Vehicle Routing Problems with Different Constraint Tightness Degrees

Fu Luo, Yaoxin Wu, Zhi Zheng +1

Recent neural combinatorial optimization (NCO) methods have shown promising problem-solving ability without requiring domain-specific expertise. Most existing NCO methods use train…

cs.LG2025

Learning to Insert for Constructive Neural Vehicle Routing Solver

Fu Luo, Xi Lin, Mengyuan Zhong +4

Neural Combinatorial Optimisation (NCO) is a promising learning-based approach for solving Vehicle Routing Problems (VRPs) without extensive manual design. While existing construct…

cs.LG2024★ 2 cited

Self-Improved Learning for Scalable Neural Combinatorial Optimization

Fu Luo, Xi Lin, Zhenkun Wang +3

The end-to-end neural combinatorial optimization (NCO) method shows promising performance in solving complex combinatorial optimization problems without the need for expert design.…

cs.NE2024★ 14 cited

Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model

Fei Liu, Xialiang Tong, Mingxuan Yuan +5

Heuristics are widely used for dealing with complex search and optimization problems. However, manual design of heuristics can be often very labour extensive and requires rich work…

cs.LG2023★ 20 cited

Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization

Fu Luo, Xi Lin, Fei Liu +2

Neural combinatorial optimization (NCO) is a promising learning-based approach for solving challenging combinatorial optimization problems without specialized algorithm design by e…

cs.NE2022★ 2 cited

Dynamic Multi-objective Ensemble of Acquisition Functions in Batch Bayesian Optimization

Jixiang Chen, Fu Luo, Zhenkun Wang

Bayesian optimization (BO) is a typical approach to solve expensive optimization problems. In each iteration of BO, a Gaussian process(GP) model is trained using the previously eva…