| 基于“服务型”物流战略的p—Center选址问题研究 |
| |
| 引用本文： | 袁庆达,陈旭梅,黎青松.基于“服务型”物流战略的p—Center选址问题研究[J].西南交通大学学报,2001,36(3):250-253. |
| |
| 作者姓名： | 袁庆达 陈旭梅 黎青松 |
| |
| 作者单位： | 西南交通大学交通运输学院, |
| |
| 摘 要： | 介绍了物流战略和图中心的概念，针对、服务型”物流战略，钭大规模配送网络的多本着中心选址问题抽象为求解图的多中心（p-Center)问题，并证明了无论是顶点p-Center问题均存在近似度为2的顶点解，最后，基于此定理，给出了选址问题的一个多项式2－近似算法。
|
| 关 键 词： | 货物流通 选址问题 “服务型”物流战略 p－Center近似度 复杂性分析 |
| 文章编号： | 0258-2724(2001)03-0250-04 |
Research on the p-Center
Location Problem Based on Service-Oriented Logistics Strategy |
| |
| YUAN Qing-da,CHEN Xu-mei,LI Qing-song.Research on the p-Center
Location Problem Based on Service-Oriented Logistics Strategy[J].Journal of Southwest Jiaotong University,2001,36(3):250-253. |
| |
| Authors: | YUAN Qing-da CHEN Xu-mei LI Qing-song |
| |
| Abstract: | This paper begins with an introduction of the concepts of logistics strategy and graph center. Then, for the service oriented logistics strategy, it abstracts the location problem of multi distribution centers in large scale distribution network as a p center problem of graph, and proves that both vertex p center problem and absolute p center problem have the vertex solution with 2 degree of approximation. Finally, based on the theorem, a polynomial 2 approximation algorithm for the location problem is presented. |
| |
| Keywords: | cargo movement location problems service oriented logistics strategy p center degree of approximation complexity analysis |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
