π€ AI Summary
This work addresses the NP-hard combinatorial optimization problem of team formation and path planning, motivated by real-time applications such as airport scheduling and healthcare resource allocation. We propose a graph neural network (GNN)-driven partial column generation framework: taskβteam relationships are modeled as a graph, and a GNN predicts columns with high-potential negative reduced costs to dynamically guide the pricing subproblem. This approach overcomes the limitations of conventional random or heuristic column selection in column generation, enabling adaptive acceleration across diverse pricing scenarios. Experiments on multiple real-world datasets demonstrate that our method achieves 37%β62% faster convergence and improves solution quality by an average of 4.8% over state-of-the-art partial column generation methods. Moreover, under time-constrained conditions, it significantly enhances solver robustness.
π Abstract
The team formation and routing problem is a challenging optimization problem with several real-world applications in fields such as airport, healthcare, and maintenance operations. To solve this problem, exact solution methods based on column generation have been proposed in the literature. In this paper, we propose a novel partial column generation strategy for settings with multiple pricing problems, based on predicting which ones are likely to yield columns with a negative reduced cost. We develop a machine learning model tailored to the team formation and routing problem that leverages graph neural networks for these predictions. Computational experiments demonstrate that applying our strategy enhances the solution method and outperforms traditional partial column generation approaches from the literature, particularly on hard instances solved under a tight time limit.