基于Pawlak算法的物流选址指标建模研究

Modeling about Logistics Nodes Location Based on Pawlak Algorithm

文章从物流节点选址指标体系的复杂性入手,提出以Pawlak算法对指标体系进行约简,简化了物流选址的复杂性。并通过实例展示该算法在物流选址中的应用,结果表明该算法是可行和有效的,并具有很好的实际应用价值。它为物流节点选址问题的解决提供了新的可行途径和有效手段。

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.