基于稀疏矩阵的大规模城市物流配送路径规划

打开文本图片集

Large-Scale Urban Logistics Distribution Path Planning Based on Sparse Matrix

ZHANG Lu （Jinzhong College of Information， Jinzhong O3o800， China）

关键词：稀疏矩阵；城市物流；路径规划； A* 算法；仿真分析中图分类号：F259；U495 文献标志码：A DOI： 10.13714/j.cnki.1002-3100.2026.04.014

Abstract：Inordertosolveproblmslikelowcomputigfciecyandredundantodeaceses inargescaleurbanlogisticsdistrution route planning， this paper proposes a sparse A* path planning method based on sparse matrix features （Sparse A* ） from the perspective of sparsematrics.istlytheurbanlgistcsoadetwork isbstractedintasparseadjacencymatrixmodel.Besides，secondayorting function is designed based onthe standard A* evaluation function to adjust the priority of nodes with the same value，and balance heuristic optimalityandsparseguded-sarch.Secondlytoverifythemethod'sefectivenessalargescalesimulatonenvionmentisbuilton thePythonplatformandcomparativeexperimentsareperformeduderthesameroadntworkandorigin/destinationonditions.The experiment results indicate thatthe methodsignificantlyreduces the number ofsearched nodes and computationtime on the basis of approximate pathoptimalityandcanimprovethepathplaningeficiencyandresouceutilizationrateinlargcalesparseroadorks. Key words： sparse matrix; urban logistics; path planning; A* algorithm; simulation analysis

0引言

城市物流系统发展迅速，大规模路网环境下配送路径规划的难度与日俱增，对物流运作效率及城市交通负荷产生巨大影响伴随即时配送业务2、电商物流[3、城市内部供应链网络4等物流模式持续发展，错综复杂的城市道路导致节点及边数呈指数级增加]。（剩余5953字）