| 基于Pawlak算法的物流选址指标建模研究 |
| |
| 引用本文： | 张丽岩,马,健,孙,焰.基于Pawlak算法的物流选址指标建模研究[J].物流科技,2014(2):1-2,21. |
| |
| 作者姓名： | 张丽岩 马 健 孙 焰 |
| |
| 作者单位： | [1]苏州科技学院土木工程学院,江苏苏州215001 [2]同济大学交通运输工程学院,上海200092 |
| |
| 基金项目： | 国家自然科学基金项目,项目编号：71072027; 住房和城乡建设部项目,项目编号：2013-K5-27; 江苏省高校自然科学基金项目,项目编号：12KJB580005 |
| |
| 摘 要： | 文章从物流节点选址指标体系的复杂性入手,提出以Pawlak算法对指标体系进行约简,简化了物流选址的复杂性。并通过实例展示该算法在物流选址中的应用,结果表明该算法是可行和有效的,并具有很好的实际应用价值。它为物流节点选址问题的解决提供了新的可行途径和有效手段。
|
| 关 键 词： | 物流节点选址 指标建模 属性约简 Pawlak算法 |
Modeling about Logistics Nodes Location Based on Pawlak Algorithm |
| |
| ZHANG Li-yan,MA Jian,SUN Yan.Modeling about Logistics Nodes Location Based on Pawlak Algorithm[J].Logistics Management,2014(2):1-2,21. |
| |
| Authors: | ZHANG Li-yan MA Jian SUN Yan |
| |
| Institution: | 1. School of Civil Engineering, Suzhou University of Science and Technology, Suzhou 215001, China; 2. School of Transportation Engineering, Tonal University, Shanghai 200092, China) |
| |
| Abstract: | The paper proposes simplified method about the index system of logistics node location using the Pawlak algorithm, which can reduce the complexity of decision of logistics node location. It demonstrates the algorithm by example in logistics application field, and the results show that the algorithm is feasible, effective and good practical value. It provides a novel feasible way and effective means to solve the logistics node location problem. |
| |
| Keywords: | logistics nodes location index modeling attribute reduction Pawlak algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
