← Search

Yingqian Zhang

7 accepted papers

2026

Learning with Foresight: Enhancing Neural Routing Policy via Multi-Node Lookahead Prediction

IJCAI 2026

Neural policies have shown promise in solving vehicle routing problems due to their reduced reliance on handcrafted heuristics. However, current training paradigms suffer from a fundamental limitation: they primarily focus on next-node prediction for solution construction, resulting in myopic decisi

Cited by 0Scholar
2026

Neural Multi-Objective Combinatorial Optimization for Flexible Job Shop Scheduling Problems

ICLR 2026poster

Neural combinatorial optimization (NCO) has made significant advances in applying deep learning techniques to efficiently and effectively solve single-objective flexible job shop scheduling problems (FJSPs). However, the more practical multi-objective FJSPs (MOFJSPs) remain underexplored, limiting t…

Cited by 0SourceScholar
2025

DRoC: Elevating Large Language Models for Complex Vehicle Routing via Decomposed Retrieval of Constraints

ICLR 2025poster

This paper proposes Decomposed Retrieval of Constraints (DRoC), a novel framework aimed at enhancing large language models (LLMs) in exploiting solvers to tackle vehicle routing problems (VRPs) with intricate constraints. While LLMs have shown promise in solving simple VRPs, their potential in addre…

Cited by 0SourcePDFScholar
2025

Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization

ICML 2025poster

Deep reinforcement learning (DRL) has been widely used for dynamic algorithm configuration, particularly in evolutionary computation, which benefits from the adaptive update of parameters during the algorithmic execution. However, applying DRL to algorithm configuration for multi-objective combinato…

2025

Large Language Models as End-to-end Combinatorial Optimization Solvers

NeurIPS 2025poster

Combinatorial optimization (CO) problems, central to decision-making scenarios like logistics and manufacturing, are traditionally solved using problem-specific algorithms requiring significant domain expertise. While large language models (LLMs) have shown promise in automating CO problem solving,…

Cited by 0SourceScholar
2025

Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems

AAAI 2025technical

Neural combinatorial optimization (NCO) has gained significant attention due to the potential of deep learning to efficiently solve combinatorial optimization problems. NCO has been widely applied to job shop scheduling problems (JSPs) with the current focus predominantly on deterministic problems.…

2024

Cross-Problem Learning for Solving Vehicle Routing Problems

IJCAI 2024poster

Existing neural heuristics often train a deep architecture from scratch for each specific vehicle routing problem (VRP), ignoring the transferable knowledge across different VRP variants. This paper proposes the cross-problem learning to assist heuristics training for different downstream VRP varian…