基于神经预测的图集覆盖问题列生成加速算法
The Neural-Prediction based Acceleration Algorithm of Column Generation for Graph-Based Set Covering Problems
摘要:
集合覆盖问题是一类重要的组合优化问题,在许多领域得到了广泛的应用和研究。本文提出了一种改进的神经预测列生成算法(CG-P),用于解决基于图的集合覆盖问题。我们利用一个基于图神经网络的神经预测模型来预测每个边被包含在最终解决方案中的概率。我们的CG-P算法构造了一个简化的图,只包含具有较高预测概率的边,这种图简化过程显着加快了求解过程。我们评估CG-P算法在铁路乘务调度问题,它优于基线列生成算法。我们为CG-P算法提供了两种求解模式。在最优模式下,我们可以得到一个最优性保证的解决方案,同时减少时间成本为63.12%。在快速模式下,我们可以在仅2.91%的计算时间内获得7.62%最优性差距的次优解。
英文摘要:
Set covering problem is an important class of combinatorial optimization problems, which has been widely applied and studied in many fields. In this paper, we propose an improved column generation algorithm with neural prediction (CG-P) for solving graph-based set covering problems. We leverage a graph neural network based neural prediction model to predict the probability to be included in the final solution for each edge. Our CG-P algorithm constructs a reduced graph that only contains the edges with higher predicted probability, and this graph reduction process significantly speeds up the solution process. We evaluate the CG-P algorithm on railway crew scheduling problems and it outperforms the baseline column generation algorithm. We provide two solution modes for our CG-P algorithm. In the optimal mode, we can obtain a solution with an optimality guarantee while reducing the time cost to 63.12%. In the fast mode, we can obtain a sub-optimal solution with a 7.62% optimality gap in only 2.91% computation time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。