arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0611140cs.AIcs.NE
收藏

接种效益分析--以训练运行计划为例

On the Benefits of Inoculation, an Example in Train Scheduling

Yann Semet, Marc Schoenauer

摘要:

列车时刻表的局部重构是一个非常困难的、严格约束的组合问题。众所周知,铁路公司的公众形象与每天的延误量成正比,其利润也是如此!本文介绍了一种接种过程,大大提高了进化算法的训练重调度。该过程包括建立在一个预先计算的解决方案的基础上,事先提供的问题相关的信息周围的初始人口。优化是通过调整出发和到达的时间,以及分配的轨道,为每个训练在每个车站。这是通过基于置换的进化算法实现的,该算法依赖于半贪婪启发式调度程序,通过一个接一个地插入列车来逐渐重建时间表。一个大型的现实世界的情况下,涉及约500列火车和超过100万个约束的各种实例上的实验结果。在与商业数学编程工具CPLEX的竞争中,似乎在一个大的实例类中,排除琐碎的实例以及太困难的实例,并且只有很少的例外,聪明的初始化将令人鼓舞的失败变成了明显的成功,预示着大量的财务节省。

英文摘要:

The local reconstruction of a railway schedule following a small perturbation of the traffic, seeking minimization of the total accumulated delay, is a very difficult and tightly constrained combinatorial problem. Notoriously enough, the railway company's public image degrades proportionally to the amount of daily delays, and the same goes for its profit! This paper describes an inoculation procedure which greatly enhances an evolutionary algorithm for train re-scheduling. The procedure consists in building the initial population around a pre-computed solution based on problem-related information available beforehand. The optimization is performed by adapting times of departure and arrival, as well as allocation of tracks, for each train at each station. This is achieved by a permutation-based evolutionary algorithm that relies on a semi-greedy heuristic scheduler to gradually reconstruct the schedule by inserting trains one after another. Experimental results are presented on various instances of a large real-world case involving around 500 trains and more than 1 million constraints. In terms of competition with commercial math ematical programming tool ILOG CPLEX, it appears that within a large class of instances, excluding trivial instances as well as too difficult ones, and with very few exceptions, a clever initialization turns an encouraging failure into a clear-cut success auguring of substantial financial savings.

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

↑