舰船信息网络物流配送最优路径选取方法研究
|
摘要
利用基于神经网络或基于遗传算法等传统方法进行舰船信息网络中物流配送最优路径选取,选取质量较差,使得物流配送时间长,导致运输成本过高,降低了客户满意度。针对上述问题,提出一种基于Dijkstra算法的物流配送最优路径选取方法。该方法主要分为两步:对Dijkstra算法选取最优物流配送路径原理进行分析;在该原理基础上构建物流配送最优路径选取模型,包括问题描述、求加权矩阵、建立距离矩阵、确立需求量与配送距离之间的线性关系、构建Dijkstra算法模型等流程。结果表明:按照本方法选取出的最优路径进行物流配送,平均时间为55.69 h,按照基于神经网络或基于遗传算法等传统方法选取出的最优路径进行物流配送,平均时间为58.62 h和62.42 h。前者与后两者对比,配送时间大大缩短,由此证明本方法选取质量更好,能大大缩短物流配送时间,降低运输成本,提高客户满意度。
Using traditional methods such as neural network or genetic algorithm to select the optimal route of logistics distribution in warship information network, the quality of the selection is poor, which makes the logistics distribution time long, leads to high transportation cost and reduces customer satisfaction. In view of the above problems, a method of selecting the best path of logistics distribution based on Dijkstra algorithm is proposed. The method is divided into two steps: first,the principle of Dijkstra algorithm to select the optimal logistics distribution path is analyzed; second, on the basis of this principle, the model of optimal logistics distribution path selection is constructed, including problem description, weighting matrix, distance matrix, relationship between demand and distribution distance, and Dijkstra algorithm. The law model and so on. The results show that the average time of logistics distribution is 55.69 hours. The average time of logistics distribution is 58.62 hours and 62.42 hours according to the optimal route selected by traditional methods such as neural network or genetic algorithm. Compared with the former, the distribution time is greatly shortened, which proves that this method has better quality, can greatly shorten the logistics distribution time, reduce transportation costs and improve customer satisfaction.
Using traditional methods such as neural network or genetic algorithm to select the optimal route of logistics distribution in warship information network, the quality of the selection is poor, which makes the logistics distribution time long, leads to high transportation cost and reduces customer satisfaction. In view of the above problems, a method of selecting the best path of logistics distribution based on Dijkstra algorithm is proposed. The method is divided into two steps: first,the principle of Dijkstra algorithm to select the optimal logistics distribution path is analyzed; second, on the basis of this principle, the model of optimal logistics distribution path selection is constructed, including problem description, weighting matrix, distance matrix, relationship between demand and distribution distance, and Dijkstra algorithm. The law model and so on. The results show that the average time of logistics distribution is 55.69 hours. The average time of logistics distribution is 58.62 hours and 62.42 hours according to the optimal route selected by traditional methods such as neural network or genetic algorithm. Compared with the former, the distribution time is greatly shortened, which proves that this method has better quality, can greatly shorten the logistics distribution time, reduce transportation costs and improve customer satisfaction.
引文
[1]殷洁,徐丽霞.船舶运输最优物流线路选取模型[J].舰船科学技术,2018(2):73-75.
[2]刘晗兵.基于GIS决策功能的物流配送TSP优化模型研究[J].电子设计工程,2017,25(18):46-49.
[3]曹舒淮,王潇,姜浩然,等.改进的Dijkstra算法在应急救援最优路径问题中的应用[J].山东工业技术,2017(1):144-144.
[4]王力锋,杨华玲.物流配送车辆最优网络路径选取仿真[J].计算机仿真,2018,35(05):156-159+202.
[2]刘晗兵.基于GIS决策功能的物流配送TSP优化模型研究[J].电子设计工程,2017,25(18):46-49.
[3]曹舒淮,王潇,姜浩然,等.改进的Dijkstra算法在应急救援最优路径问题中的应用[J].山东工业技术,2017(1):144-144.
[4]王力锋,杨华玲.物流配送车辆最优网络路径选取仿真[J].计算机仿真,2018,35(05):156-159+202.