检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华南理工大学土木与交通学院,广东广州510640 [2]北京交通大学交通运输学院,北京100044
出 处:《中国铁道科学》2013年第5期134-139,共6页China Railway Science
基 金:国家自然科学基金资助项目(61174188)
摘 要:针对采用机车肩回交路的重载铁路线路,将其列车运行图中的列车运行线转化为节点,机车周转线转化为边,运用机车转化为流,从而将机车周转图的优化问题转化为网络流问题。在此基础上,以运用机车数最少、单机走行数最少、附挂机车数最少、机车在站停留时间最短和机车工作均衡性最好为优化目标,以网络流问题中的节点流量守恒和节点流量要满足节点需求为约束条件,建立肩回交路条件下的多机牵引机车周转图多目标优化模型。按照优化目标函数的优先级,采用分层序列法对模型求解,并利用C#语言编写程序,通过调用ILOG CPLEX优化软件实现了该算法。算例表明,采用所给模型和据此编制的机车周转图优化程序,可以快速优化肩回交路条件下的多机牵引机车周转图。For heavy haul railway with locomotive arm routing, the train path in train diagram is converted to a node, locomotive turnaround line to an arc and the locomotive to the flow. So the problem of optimi- zing locomotive working diagram can be transformed into the problem of network flow. On this basis, the multi-objective optimization model for locomotive working diagram under the conditions of locomotive arm routing and multi locomotive traction is built, which aims the minimum numbers of locomotives in opera- tion, the minimum number of deadheading locomotives, the minimum number of dead hauling locomotives, the minimum detention time of locomotives at station and the best equilibrium characteristics of locomotive operation. The constrained condition is that the node flow conservation and node flow should meet the node demand in network flow problem. Following the priority level of optimization object functions, the lexicographic method is employed to find the optimal solution. C~ language is used to compile program, this algorithm is realized by calling the optimization software ILOG CPLEX. Numerical example shows that the proposed model and program can fast arm routing and multi locomotive traction. optimize the locomotive working diagram with locomotive
关 键 词:机车周转图 肩回交路 多机牵引 网络流 分层序列法
分 类 号:U292.61[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.26