activity
20192024
most citedLearning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning

239 citations · 989 across the 21 of their papers we have counts for

collaborators
Showing cs.AIShow all

8 papers · 1 filter

cs.AI2024

Collaboration! Towards Robust Neural Methods for Routing Problems

Jianan Zhou, Yaoxin Wu, Zhiguang Cao +3

Despite enjoying desirable efficiency and reduced reliance on domain expertise, existing neural methods for vehicle routing problems (VRPs) suffer from severe robustness issues --…

cs.AI2024★ 3 cited

Cross-Problem Learning for Solving Vehicle Routing Problems

Zhuoyi Lin, Yaoxin Wu, Bangjian Zhou +4

Existing neural heuristics often train a deep architecture from scratch for each specific vehicle routing problem (VRP), ignoring the transferable knowledge across different VRP va…

cs.AI2023★ 48 cited

Neural Airport Ground Handling

Yaoxin Wu, Jianan Zhou, Yunwen Xia +3

Airport ground handling (AGH) offers necessary operations to flights during their turnarounds and is of great importance to the efficiency of airport management and the economics o…

cs.AI2023★ 61 cited

Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handling

Jianan Zhou, Yaoxin Wu, Zhiguang Cao +3

Dispatching vehicle fleets to serve flights is a key task in airport ground handling (AGH). Due to the notable growth of flights, it is challenging to simultaneously schedule multi…

cs.AI2021★ 11 cited

Learning Large Neighborhood Search Policy for Integer Programming

Yaoxin Wu, Wen Song, Zhiguang Cao +1

We propose a deep reinforcement learning (RL) method to learn large neighborhood search (LNS) policy for integer programming (IP). The RL policy is trained as the destroy operator…

cs.AI2021★ 45 cited

NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem

Liang Xin, Wen Song, Zhiguang Cao +1

We present NeuroLKH, a novel algorithm that combines deep learning with the strong traditional heuristic Lin-Kernighan-Helsgaun (LKH) for solving Traveling Salesman Problem. Specif…

cs.AI2019★ 35 cited

Learning Variable Ordering Heuristics for Solving Constraint Satisfaction Problems

Wen Song, Zhiguang Cao, Jie Zhang +1

Backtracking search algorithms are often used to solve the Constraint Satisfaction Problem (CSP). The efficiency of backtracking search depends greatly on the variable ordering heu…

cs.AI2019★ 49 cited

Learning Improvement Heuristics for Solving Routing Problems

Yaoxin Wu, Wen Song, Zhiguang Cao +2

Recent studies in using deep learning to solve routing problems focus on construction heuristics, the solutions of which are still far from optimality. Improvement heuristics have…