摘要
物流配送网络中最优路线的选择问题一直都是配送中心关注的焦点 ,对于长途配送而言 ,交通阻塞和道路拥堵状况可以忽略不计 ,但对于城市配送而言 ,由于受交通堵塞和各种交通管制的影响 ,导致配送路径寻优更具复杂性 .文中通过对具有动态的交通堵塞和交通拥挤限制信息及静态禁止通行等限制信息的实际配送网络的描述 ,提出解决两种限制情况下配送网络寻优的方法 ,建立了配送网络图中权重确定模型 ,并提出将交通限制条件下城市物流配送网络转化成无限制的有向图网络 ,运用 Dijkstra算法对其寻优 。
The routing-optimization problem of logistics distribution network is the focus concerned by distribution center all the time. Generally, traffic jam or route crowd impact distribution in long distance can be ignored, but the effect can not be ignored in city distribution, because the actual distribution process is frequently impacted by traffic jam, traffic crowd and many traffic controls, the problem of seeking optimal route is more complexity. The paper describes the real distributing network that was restricted by limit info, such as dynamic traffic jam and traffic crowd, and static forbid-pass, and puts forward the method of seeking optimal solution under these limit conditions, and establishes the model to make the distribution network weight, and brings forward to transform the limit network into the unlimited orientation network, and then finds the optimal route by using Dijkstra algorithm, and gives an example to prove the arithmetic.
出处
《武汉理工大学学报(交通科学与工程版)》
北大核心
2004年第3期391-394,共4页
Journal of Wuhan University of Technology(Transportation Science & Engineering)