物流成本运输成本(课时).pptVIP

* * * * * * * * * * * Cpt S 223 Washington State University * 釜山至鹿特丹主要多式运输路线 Transportation mode Intermodal transport paths Ship + railway -TSR (Trains Siberian Railway) or railway -TCR (Trains China Railway) -TMR (Trains Manchuria Railway) -TMGR (Trains Mongolia Railway) -TKR (Trains Korea Railway) Ship + air Busan port –(ship)- New York-(air)- carrier Rotterdam airport Busan port-(ship)-LA-(air)- Rotterdam airport 釜山至鹿特丹主要线路耗费 Busan NY LA Singapore HK Rotterdam (300,144) (2800,264) (3700,528) (160,48) (650,240) (1600,600) (1200,240) (1600,360) (1400,528) (1100,456) (1240,240) (x,y): cost($), hour 测试数据 网络结构 Small scale: 13 nodes, ≈100arcs Large scale: 17 transit nodes,arcs 信息 转运点的调度信息 20趟海运调度计划/月（2005年11月2005年12月） 2-5趟航班/日 。。。 Cost $/TEU(ship), $/CBM(air) Costs are estimated based on tariff rates provided by shipping companies, airlines and railway companies; rail rates are hard to get, refer to railway tariff from ESCAP 问题本质分析 网络优化模型（weighted constrained shortest path) s t (wa, ca) (wn, cn) 问题本质分析 数学模型（参数、变量） 问题本质分析 数学模型 算法思想 Label-setting algorithm 一种基于动态规划的算法 主要依靠对资源(resource)和资源在路径拓展(resource extension functions)上消耗的描述和记录进行有哪些信誉好的足球投注网站 Dominance rules, pareto-optimal Irnich, S.; Desaulniers, G. (2005):Shortest Path Problems with Resource Constraints pruning rules 时间、耗费都大，删除 时间相等，耗费大，删除；耗费相等，时间长，删除 在某一点的到达时间大于出发时间的，删除 试验结果 Cape Pack () Tops Pro Fanuc Robotics FKI logistex ASRS (Automated Storage and Retrieval Systems, MSS II Daifuku) The mixed pallet design problem variables * * * * * * * * * * * * * * Dijkstra’s Algorithm 算法思想 Shortest Paths * 1 Initialize-Single-Source(G,s) 2 S = empty 3 Q = G.V 4 While Q ≠ empty 5 u = Extract-Min(Q) 6 S = S U {u} 7 for each vertex v\in G.Adj[u] 8 Relax(u,v,w) Running time O(VlgV+E) with using Fibonacci heap Shortest Paths * Edge Relaxation Consider an edge e = (u,z) such that u is the vertex most recently added to the cloud z is not in the cloud The relaxation of edge e updates dista