基于优化Dijkstra算法的物流配送系统设计  

The Design of Logistic Distribution System Based on Optimal Dijkstra Algorithm

作　　者：戴磊[1,2] 马小平[2] 姜代红[1,2] 

机构地区：[1]徐州工程学院信电学院,江苏徐州221008 [2]中国矿业大学信电学院,江苏徐州221116

出　　处：《微电子学与计算机》2011年第10期32-35,共4页Microelectronics & Computer

基　　金：江苏省高校自然科学研究项目(10KJD520008);徐州市科技计划项目(XM08C012)

摘　　要：针对物流配送的关键技术进行分析讨论,阐述了物流配送实时监控的实现过程.分析了路径寻优中的传统Dijkstra算法,改变图的存储结构和搜索方法,采用二叉排序树减少搜索临时结点,减少了内存存储空间,缩短了查询时间,分析和实验表明该算法是有效的.This paper introduces the key technology of logistic distribution.The paper reveals the implementing process of real-time monitoring in logistic distribution system.Dijkstra algorithm is introduced for searching optimal route.Changing the storage structure of the graphics and the search method,Dijkstra algorithm is modified by using Binary Sort Tree through analyzing algorithm.The memory space needed is decreased and the search time is shortened.Analyses and results prove the validity of the proposed algorithm.

关 键 词：物流配送 DIJKSTRA 路径寻优 二叉排序树 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]