检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘建仁 LIU Jianren(Jiaotong College of Qinghai Nationalities University,Xining 810000,China)
出 处:《现代电子技术》2020年第23期116-119,123,共5页Modern Electronics Technique
基 金:青海省“西宁市智慧交通关键技术集成与示范”(2015-SF-A5)。
摘 要:为了解决城市物流配送路径规划过程中存在的一些难题,以获得更优的城市物流配送路径规划结果,提出考虑交通拥堵的城市物流配送路径规划算法。首先分析城市物流配送路径规划的影响因素,并建立相应的约束条件;然后建立城市物流配送路径规划的目标函数,采用蚁群算法找到最优城市物流配送路径规划方案;最后在相同实验环境下,与其他城市物流配送路径规划算法进行对比测试。结果表明,所提算法获得了十分理想的城市物流配送路径规划方案,降低了城市物流配送成本,具有更高的实际应用价值。In order to cope with the difficulties existing in the process of urban logistics distribution path planning and obtain better results of urban logistics distribution path planning,an urban logistics distribution path planning algorithm considering traffic congestion is proposed.The influence factors of urban logistics distribution path planning are analyzed,and the corresponding constraints are established.And then,the objective function of urban logistics distribution path planning is established.The ant colony algorithm is used to obtain the optimal planning scheme of urban logistics distribution path.In the same experimental environment,the proposed algorithm is compared with logistics distribution path planning algorithms used in other cities.The results show that the proposed algorithm can produce a satisfactory planning scheme of urban logistics distribution path,which reduces the cost of urban logistics distribution.Therefore,it has a higher practical application value.
关 键 词:城市物流 配送路径 目标函数 数学模型 蚁群算法 规划方案 影响因素分析
分 类 号:TN911.1-34[电子电信—通信与信息系统] TP391[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.44