arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.13797cs.AIcs.LG
收藏

基于学习大邻域搜索的机场地勤车辆路径规划

Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handling

Nanyang Technological University(南洋理工大学);Eindhoven University of Technology(埃因霍温理工大学);Singapore Management University(新加坡管理大学);Shandong University(山东大学);Agency for Science Technology and Research (A*STAR)(新加坡科技研究局)

Jianan Zhou, Yaoxin Wu, Zhiguang Cao, Wen Song, Jie Zhang, Zhenghua Chen

摘要:

机场地勤车辆的调度是机场地勤的一项重要任务。由于航班的显著增长,同时为大量航班安排多种类型的操作(服务)是具有挑战性的,其中每种类型的操作由一个特定的车队执行。为了解决这个问题,我们首先表示为一个复杂的车辆路径问题的操作调度,并制定它作为一个混合整数线性规划(MILP)模型。然后给出MILP模型的图表示,提出了一种学习辅助的大邻域搜索(LNS)方法,该方法使用基于真实场景生成的数据,将模仿学习和图卷积网络(GCN)相结合,学习破坏算子来自动选择变量,并采用现成的求解器作为修复算子来重新优化所选变量。基于实际机场的实验结果表明,该方法允许处理多达200个航班的10种类型的操作同时进行,并优于国家的最先进的方法。此外,学习的方法执行一致伴随不同的求解器,并推广到更大的实例,验证了我们的方法的通用性和可扩展性。

英文摘要:

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 multiple types of operations (services) for a large number of flights, where each type of operation is performed by one specific vehicle fleet. To tackle this issue, we first represent the operation scheduling as a complex vehicle routing problem and formulate it as a mixed integer linear programming (MILP) model. Then given the graph representation of the MILP model, we propose a learning assisted large neighborhood search (LNS) method using data generated based on real scenarios, where we integrate imitation learning and graph convolutional network (GCN) to learn a destroy operator to automatically select variables, and employ an off-the-shelf solver as the repair operator to reoptimize the selected variables. Experimental results based on a real airport show that the proposed method allows for handling up to 200 flights with 10 types of operations simultaneously, and outperforms state-of-the-art methods. Moreover, the learned method performs consistently accompanying different solvers, and generalizes well on larger instances, verifying the versatility and scalability of our method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑