| 物流配送点选址模型及其算法研究 |
| |
| 引用本文： | 龚延成,郭晓汾,蔡团结,李卫江.物流配送点选址模型及其算法研究[J].中国公路学报,2003,16(2):123-126. |
| |
| 作者姓名： | 龚延成 郭晓汾 蔡团结 李卫江 |
| |
| 作者单位： | 1. 解放军汽车管理学院车辆管理系,安徽,蚌埠,233011
2. 长安大学汽车学院,陕西,西安,710064 |
| |
| 摘 要： | 首先介绍以最低送货运输费用为目标 ,借助最小二乘法推导出单物流配送点的选址模型及其迭代算法 ;在此基础上重点分析了已知物流配送点数目条件下的选址和物流服务分配问题 ,提出用二进制数的矩阵来描述物流服务分配方案 ,推导出其选址的数学模型 ,并给出交替选址迭代算法 ;最后讨论了如何把在未知配送点数目条件下的选址问题转化为已知配送点数目条件下的选址问题来求解
|
| 关 键 词： | 物流 配送点选址模型 迭代算法 服务分配 |
| 文章编号： | 1001-7372(2003)02-0123-04 |
| 修稿时间： | 2002年5月21日 |
Research on the choosing model of physical distribution sites and its arithmetic |
| |
| GONG Yan cheng ,GUO Xiao fen ,CAI Tuan jie ,LI Wei jiang.Research on the choosing model of physical distribution sites and its arithmetic[J].China Journal of Highway and Transport,2003,16(2):123-126. |
| |
| Authors: | GONG Yan cheng GUO Xiao fen CAI Tuan jie LI Wei jiang |
| |
| Institution: | GONG Yan cheng 1,GUO Xiao fen 2,CAI Tuan jie 2,LI Wei jiang 2 |
| |
| Abstract: | The focus of this research is to model and solve the choosing site problem for physical distribution. Authors deduce the model of choosing site and its arithmetic for a single distribution site, first, aiming at the lowest cost of transportation. Based on this, authors make detailed analysis on the problems of choosing multi sites and service distribution methods under the condition of being known the number of planned sites, putting forward a binary matrix that can describe a physical service distribution, giving the models, arithmetic and a practical example. Finally, authors discuss the way to solve the problem of choosing multi sites under the condition of being unknown the number of planned sites. |
| |
| Keywords: | logistics physical distribution spot model for choosing site iteration arithmetic service distribution |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
