检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:强丽霞[1]
出 处:《铁道学报》2009年第6期91-96,共6页Journal of the China Railway Society
摘 要:优化组织装车地直达运输是缓解我国铁路主要干线运能与运量间矛盾的有效手段,本文在综合考虑装车地直达运输系统费用消耗的基础上,针对运输网络中存在径路选择和重载运输通道端点换重的情况,建立装车地直达运输组织方案优化模型。为了有效解决模型规模随着车流数目的增加而急剧扩大、求解异常困难的问题,设计了基于蚁群算法的求解方法,并通过算例验证了模型与算法的有效性。Optimizing organization of loading and through traffic is the effective means to alleviate the sharp conflicts between the transport capacity and traffic volume of the main trunk lines in China. In this paper, taking into comprehensive consideration the costs consumption of through traffic from loading points and the exist- ence of path choice and heavy haul channel endpoints-for-weight, the model of optimized organization scheme for through trains from loading points is set up. In order to effectively solve the problem that the model rapidly expands with traffic increase and solution becomes extremely difficult, the ant colony algorithm based solving method is designed. Numerical examples verify the effectiveness of the model and algorithm.
分 类 号:U292.32[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3