检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐超 杨斌[1] 朱小林[1] 吴艳芳 Xu Chao;Yang Bin;Zhu Xiaolin;Wu Yanfang(Logistics Research Center,Shanghai Maritime University,Shanghai 201306,China;School of Business Planning,Chongqing Technology and Business University,Chongqing 400000,China)
机构地区:[1]上海海事大学物流研究中心,上海201306 [2]重庆工商大学商务策划学院,重庆400000
出 处:《数值计算与计算机应用》2018年第3期195-204,共10页Journal on Numerical Methods and Computer Applications
基 金:上海市基础研究重点项目;上海市科委科研计划项目~~
摘 要:多式联运的运输模式大大提高了不同运输方式间的协作水平.然而公路卡车的行驶时间通常处于不确定的波动状态,使得多式联运时间网络呈现动态变化,从而极大阻碍了多式联运的一体化衔接.本文以此为研究对象,通过建立动态模型来研究多商品的路由问题.针对模型中的不确定性特征变量,采用Monte Carlo仿真方法将期望模型转化成线性规划模型,最终生成相应可靠性水平下总费用最低的联运服务路径.文章提出的随机方法应用到实例运输网络中,结合样本的聚类特征,能够快速、直观地找到问题的最优解,显示出该随机方法在实现联合运输服务网络路径可靠性方面具有一定优势.Multimodal transportation tremendously improves collaboration level of different modes of transport. However, the trucks travel time is usually in state of fluctuation. It results in some dynamic changes in the multimodal time network, which greatly impedes the integration of multimodal transport. Base on this problem, a corresponding model was established to make a decision on multi-commodity multimodal routing in this paper. Considering the uncertainty of characteristic variables, the Monte Carlo simulation method was used to transform the expected model into a linear programming model, and then the transportation service path was generated, which is the lowest total cost among all paths under the corresponding reliability level. The stochastic method proposed was applied to the actual multimodal transport network. Combining with the clustering characteristics of the sample,an optimal solution of the problem could be found quickly and intuitively, which shows the certain advantages of the stochastic method in realizing the reliability of the transportation service network routing.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.17.175.182