首页    期刊浏览 2024年12月01日 星期日
登录注册

文章基本信息

  • 标题:An Improved Algorithm for the Periodic Timetabling Problem
  • 本地全文:下载
  • 作者:Marc Goerigk ; Christian Liebchen
  • 期刊名称:OASIcs : OpenAccess Series in Informatics
  • 电子版ISSN:2190-6807
  • 出版年度:2017
  • 卷号:59
  • 页码:1-14
  • DOI:10.4230/OASIcs.ATMOS.2017.12
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:We consider the computation of periodic timetables, which is a key task in the service design process of public transportation companies. We propose a new approach for solving the periodic timetable optimisation problem. It consists of a (partially) heuristic network aggregation to reduce the problem size and make it accessible to standard mixed-integer programming (MIP) solvers. We alternate the invocation of a MIP solver with the well-known problem specific modulo network simplex heuristic (ModSim). This iterative approach helps the ModSim-method to overcome local minima efficiently, and provides the MIP solver with better initial solutions. Our computational experiments are based on the 16 railway instances of the PESPlib, which is the only currently available collection of periodic event scheduling problem instances. For each of these instances, we are able to reduce the objective values of previously best known solutions by at least 10.0%, and up to 22.8% with our iterative combined method.
  • 关键词:periodic timetabling; railway optimisation; modulo network simplex; periodic event scheduling problem
国家哲学社会科学文献中心版权所有