考虑换重条件的重载直达车流组织研究  

Study on Optimized Organization Scheme for Through Heavy Haul Trains Based on Changing-for-weight

作　　者：王文宪[1] 柏伟[1] 邓鹏[1] 

机构地区：[1]西南交通大学交通运输与物流学院,成都610031

出　　处：《交通运输工程与信息学报》2013年第1期68-73,共6页Journal of Transportation Engineering and Information

摘　　要：对于煤炭、矿产等大宗货物的装车地而言,在车流组织方向上,重载线路与非重载线路的交织共存使得装车地重载车流的组织形式更加多样,其优化的方法也不同于一般的装车地直达优化。本文首先分析了车流从装车地编发的各种组合方案,以及它们在重载运输系统中的费用消耗,然后针对列车在重载线路端点换重的情况,建立了装车地重载直达列车开行方案的0-1非线性规划模型。鉴于该模型变量多、规模庞大,用传统数学方法难以求解,本文设计了基于遗传算法的求解方法。结果表明,该算法具有较好的寻优能力,是解决装车地直达重载运输优化问题的有效算法。For the loading points the coal minerals and other bulk cargo, the coexisted heavy haul railway and common railway causes the diversity in organization scheme for through heavy haul trains, the optimization method is also different from the normal. First, this paper analyzed various combination programs compiled at the loading points, and their cost in the heavy haul transportation system. Then, established a 0-1 non-linear programming model based on the circumstance of endpoint-thang-for-weight. Considering the large scale of the model, and hard to solve by traditional mathematical methods, this paper designed a solution method based on genetic algorithm. The result shows that this algorithm is an effective way to solve the problem with optimized organization scheme for through heavy haul trains from the loading points.

关 键 词：装车地 重载车流 端点换重 遗传算法 

分 类 号：N945.12[自然科学总论—系统科学] U296[交通运输工程—交通运输规划与管理]