首页> 外文会议>Workshop on Power Electronics and Intelligent Transportation Systems >Study on Optimal Model and Algorithm of Sorting Sequence of Stage Plan on Marshalling Station
【24h】

Study on Optimal Model and Algorithm of Sorting Sequence of Stage Plan on Marshalling Station

机译:编组站舞台阶段计划排序序列的最优模型与算法研究

获取原文

摘要

Arrangement of sorting sequence is an important part for formulation of stage plan on marshalling station. In this paper, we establish a model to minimize the waiting time of wagon as objective function, and we present simulated annealing algorithm to optimize the problem of sorting sequence, through searching feasible solution in solution space, for each initial solution, we use distribution car flow algorithm pretreatment and calculate the fitness value, then according to the size of fitness value, we estimate the merits of sorting sequence, in light of the actual situation we describe implementation of the correlation method of simulated annealing algorithm. When applied to the computational experiments, the results indicate this method is feasible and effective.
机译:分选序列的安排是在​​编组站上制定阶段计划的重要组成部分。在本文中,我们建立了一种模型,以最小化Wagon作为客观函数的等待时间,并且我们提出了模拟退火算法,以优化排序序列的问题,通过在解决方案中搜索可行的解决方案,对于每个初始解决方案,我们使用分销汽车流量算法预处理并计算健身值,然后根据适应值的大小,我们估计分类顺序的优点,鉴于实际情况我们描述了模拟退火算法的相关方法的实现。当应用于计算实验时,结果表明该方法是可行和有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号