摘要
通过将B2C电子商务企业的实际物流配送网络描述为由配送中心和顾客两类节点构成的不完全无向图,建立了0-1整数规划的物流配送路径优化模型.该模型属于一类改进的多设施车辆路径优化模型,具有NP难性质.为了求解上述模型,首先利用FLOYD算法求得不完全无向图中各节点间的最短路径和最短路径长度,然后设计了捕食搜索算法对模型进行求解.通过仿真实例计算,并与遗传算法比较,取得了满意的结果.
The logistics distribution networks of business to customer（B2C） e-commerce enterprise are described in a way of an incomplete undigraph, which consists of two kinds of nodes：the distribution center nodes and the customer nodes. A model with 0-1 integer is built to optimize the logistics distribution routing. The model belongs to a type of improved multi-depot vehicle routing problem and has NP-hard complexity. To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution. Computation on simulation examples and comparison with genetic algorithm show that the results are satisfactory.
出处
《信息与控制》
CSCD
北大核心
2005年第4期481-485,共5页
Information and Control
基金
国家自然科学基金资助项目(70431003
07171056)
关键词
电子商务
物流配送
路径优化
FLOYD算法
捕食搜索算法
e-commerce
logistics distribution
routing optimization
FLOYD algorithm
predatory search algorithm
