• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Computers in Railways X: Computer System Design and Operation in the Railway and other Transit Systems; WIT Transactions on Built Environment; vol.88 >A new idea for train scheduling using ant colony optimization
【24h】

A new idea for train scheduling using ant colony optimization

机译：利用蚁群算法进行列车调度的新思路

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper develops a new algorithm to the train scheduling problem using Ant Colony System (ACS) meta-heuristic. At first, a mathematical model for a kind of train scheduling problem is developed and then the algorithm based on the meta-heuristic is presented to solve the problem. The problem is considered as a traveling salesman problem (TSP) wherein cities represent the trains. ACS determines the sequence of trains dispatched on the graph of the TSP. Based on the sequence obtained and removing for collisions incurred, train scheduling is determined. Numerical examples in small and medium sizes are solved by using the algorithm. The solutions are compared to the exact optimum solutions to check for quality and accuracy. Comparison of the solutions shows that the algorithm results in good enough quality and time savings. A case study is presented to illustrate the solution.
机译：本文提出了一种基于蚁群系统元启发式算法的列车调度问题新算法。首先，建立了一种列车调度问题的数学模型，然后提出了基于元启发式算法的算法。该问题被视为旅行推销员问题（TSP），其中城市代表火车。 ACS确定在TSP图表上调度的列车的顺序。基于获得的序列并消除发生的碰撞，确定列车调度。使用该算法求解了中小尺寸的数值示例。将解决方案与精确的最佳解决方案进行比较，以检查质量和准确性。解决方案的比较表明，该算法可产生足够好的质量并节省时间。提出了一个案例研究来说明解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号