摘要
通过对动车组交路计划编制既有算法和动车组接续方式的分析,提出在动车段(所)所在站及非动车段所在站分别采用不同接续方式的思路。在此基础上,建立求解动车组交路计划的装箱问题模型,采用遗传算法对该模型进行算法设计,最后以杭深线福州南动车所为实例进行求解和模拟对比分析。
Through analyzing the existing algorithm for drawing EMU routing scheme and the EMU connection mode, this paper puts forward the ideas of applying different connection modes respectively on the stations located at EMU depot （workshop） and non-EMU depot （workshop）. Based on above, the model of bin packing problem is established to solve the problem of EMU routing scheme, the algorithm design is taken to the model by using genetic algorithm. In the end, the paper makes solution and simulation comparative analysis by taking Fuzhou South EMU Workshop on Hangzhou-Shenzhen line as example.
出处
《铁道运输与经济》
北大核心
2013年第12期30-36,共7页
Railway Transport and Economy
关键词
动车组
交路计划
装箱问题
遗传算法
EMU
Routing Scheme
Bin Packing Problem
Genetic Algorithm
