| B2C电子商务中物流配送路径优化的模型与算法 |
| |
| 引用本文： | 蒋忠中,汪定伟.B2C电子商务中物流配送路径优化的模型与算法[J].信息与控制,2005,34(4):481-485. |
| |
| 作者姓名： | 蒋忠中 汪定伟 |
| |
| 作者单位： | 东北大学信息科学与工程学院系统工程研究所,辽宁,沈阳,110004 |
| |
| 基金项目： | 国家自然科学基金资助项目(70431003,07171056) |
| |
| 摘 要： | 通过将B2C电子商务企业的实际物流配送网络描述为由配送中心和顾客两类节点构成的不完全无向图，建立了0 1整数规划的物流配送路径优化模型．该模型属于一类改进的多设施车辆路径优化模型，具有NP难性质．为了求解上述模型，首先利用FLOYD算法求得不完全无向图中各节点间的最短路径和最短路径长度，然后设计了捕食搜索算法对模型进行求解．通过仿真实例计算，并与遗传算法比较，取得了满意的结果．
|
| 关 键 词： | 电子商务 物流配送 路径优化 FLOYD算法 捕食搜索算法 |
| 文章编号： | 1002-0411（2005）04-0481-05 |
| 收稿时间： | 2004-12-16 |
| 修稿时间： | 2004-12-16 |
Model and Algorithm for Logistics Distribution Routing of B2C E-commerce |
| |
| JIANG Zhong-zhong,WANG Ding-wei.Model and Algorithm for Logistics Distribution Routing of B2C E-commerce[J].Information and Control,2005,34(4):481-485. |
| |
| Authors: | JIANG Zhong-zhong WANG Ding-wei |
| |
| Abstract: | 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. |
| |
| Keywords: | e-commerce logistics distribution routing optimization FLOYD algorithm predatory search algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《信息与控制》浏览原始摘要信息 |
|
点击此处可从《信息与控制》下载全文 |
