首页> 外文期刊>International Journal of Innovative Computing Information and Control >MAXIMIZING NETWORK RELIABILITY FOR STOCHASTIC TRANSPORTATION NETWORKS UNDER A BUDGET CONSTRAINT BY USING A GENETIC ALGORITHM
【24h】

MAXIMIZING NETWORK RELIABILITY FOR STOCHASTIC TRANSPORTATION NETWORKS UNDER A BUDGET CONSTRAINT BY USING A GENETIC ALGORITHM

机译:预算约束下的遗传算法最大化随机运输网络的网络可靠性

获取原文
获取原文并翻译 | 示例
           

摘要

A transportation network with an origin (supplier) and a destination (customer) is composed of routes and vertices. On each route, there are several carriers to deliver the freight, and each carrier possesses a delivery cost and multiple available capacities with a probability distribution because the capacity may be reserved for various orders. Carrier selection means selecting exactly one carrier to deliver the freight via each route and has significant influence on both customer service and cost. Hence, the transportation network associated with any carrier selection is a stochastic transportation network. Network reliability, the probability that d units of a given commodity are shipped successfully through the transportation network, is a performance index of freight delivery. This paper focuses on finding the optimal carrier selection based on network reliability criterion under a budget constraint. An optimization algorithm integrating a genetic algorithm, minimal paths, and the Recursive Sum of Disjoint Products is proposed to solve such a problem. A practical case of LCD television delivery from China to Germany is presented to illustrate the solution procedure.
机译:具有起点(供应商)和终点(客户)的运输网络由路线和顶点组成。在每个路线上,有多个承运人来运送货物,并且每个承运人都具有运送成本和具有概率分布的多个可用容量,因为可以为各种订单预留容量。承运人选择是指精确选择一个承运人通过每条路线运送货物,这对客户服务和成本都有重大影响。因此,与任何承运人选择相关的运输网络是随机运输网络。网络可靠性是指给定商品的d个单位通过运输网络成功运输的概率,是货运性能的指标。本文重点研究在预算约束下基于网络可靠性准则的最优载波选择。提出了一种结合遗传算法,最小路径和不相交积的递归和的优化算法来解决该问题。给出了从中国到德国的液晶电视交付的实际案例,以说明解决方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号