期刊文献+

基于K-means和蚁群算法的配送网络优化问题研究——以南平延平区J速递公司为例

Researches on Distribution Network Optimization Based on K-Means and Ant Colony Algorithm:A Case Study of J Express Company in Yanping District of Nanping
下载PDF
导出
摘要 针对快递企业在城市配送区域划分以及配送路径选择方面存在的问题,在考虑物流需求量和实际道路情况的前提下,基于K-means聚类法进行配送区域划分,并应用蚁群算法对每一个配送区域内的配送线路进行优化,通过J速递公司在福建省南平市延平区的配送实例,验证了优化后提出的新配送方法在配送效率和成本方面均具有较大改进。 In view of the problems existing in the distribution area division and the distribution route selection of express delivery enterprises,the distribution area is divided based on K-means clustering method under the premise of considering the logistics demand and the actual road situation.Meantime,the ant colony algorithm is applied to optimize the distribution routes in each distribution area.Taking J express company's distribution in Yanping District of Nanping City as an example,it is verified that the new distribution method after optimization has a great improvement in the efficiency and cost of distribution.
作者 宋李玉 黄建华 SONG Liyu;HUANG Jianhua(Department of Economics and Management,Fujian Forestry Vocational and Technical College,Nanping 353000,China)
出处 《三明学院学报》 2021年第4期28-36,共9页 Journal of Sanming University
基金 2017年福建省中青年教师教育科研项目(社科类)(JAS170953)。
关键词 配送网络 K-means聚类分析 蚁群算法 distribution network K-means clustering analysis ant colony algorithm
  • 相关文献

参考文献3

二级参考文献16

共引文献85

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部