基于节点环的物流网格配送方法  

Logistics Distribution Method Based on Network with Node Loop

作　　者：徐光联[1] 马晓录[2] 

机构地区：[1]鹤壁职业技术学院电子信息工程学院,河南鹤壁458030 [2]河南工业大学机电工程学院,郑州450000

出　　处：《科技和产业》2013年第7期110-115,共6页Science Technology and Industry

基　　金：河南省基础与前沿技术研究项目(122300410258)

摘　　要：为解决网格之间的物流配送问题,研究了有容量节点在物流配送中的调节作用,提出使用带扩展的有节点环流的NIO网络流模型。首先扩展网络节点,节点由入点、出点、中转弧和节点环组成;接着根据NIO网络模型特点,改进了流量守恒约束条件,给出了控制网络流的弧容量配平算法;最后对配平后的网络使用最大流算法,生成网格间的物流分配优化方案。计算得出物流通过节点环流调配后的增强效果。To deal to solve the logistics problem between the grid capacity nodes in the logistics and distribution regulation, proposed with an ex- tender node loop NIO network flow model. The first extended network node that is consist of inflow node, outflow node, transit arc and node loop; Then according to the NIO the network model, the flow conservation constraints conditions improve, the arc capacity balancing algorithm is put forward to control network flow; Finally, trim network using the maximum flow algorithm to generate the the logistics distribution between the grid optimization program. By calculating the distribution of the increasing effect is generated from the deployment flow of node loop.

关 键 词：物流 网络流 节点环流 最大流 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]