周期时刻表生成的列生成算法
Column Generation for Periodic Timetabling
AI总结:
针对PESPlib基准库求解难题,通过时间离散化重构PESP模型,提出基于弧与路径的整数规划公式,引入列生成处理规模增长,在LP松弛下界上取得迄今最优结果。
摘要:
公共交通网络的周期时刻表问题通常被建模为周期事件调度问题(PESP)。将基准库 PESPlib 的实例求解至最优仍是一项挑战。作为迈向该目标的进一步方法,我们通过对底层图进行时间离散化来重构问题,并考虑了基于弧和基于路径的整数规划公式。对于基于路径的情况,我们使用运营线路的图扩展上的环路作为变量,从而将更多问题固有结构纳入模型。其结果是若干已知不等式的有效性以及 LP 松弛的下界,这是迄今为止已知的最佳下界。作为扩展,我们将乘客路由集成到新模型中。所提模型在线性规划松弛方面具有优势,但另一方面问题规模有所增加。我们定义了相应的定价问题,以通过列生成来处理规模。两种模型在不同问题实例上进行了实际测试。
英文摘要:
Periodic timetabling for public transportation networks is typically modelled as a Periodic Event Scheduling Problem (PESP). Solving instances of the benchmark library PESPlib to optimality continues to pose a challenge. As a further approach towards this goal, we remodel the problem by a time discretization of the underlying graph and consider arc-based as well as path-based integer programming formulations. For the path-based case, we use cycles on the graph expansion of the operational lines as variables and, therefore, include more of the problem inherent structure into the model. A consequence is the validity of several known inequalities and a lower bound on the LP-relaxation, that is the best known to date. As an extension we integrate passenger routing into the new model. The proposed models have an advantage in the linear programming relaxation, on the one hand, but have an increased problem size, on the other hand. We define the corresponding pricing problems for the use of column generation to handle the size. Both models are practically tested on different problem instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。