检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:苏建欢 SU Jian-huan(College of Physics and Mechanical and Electrical Engineering,Hechi University, Yizhou Guangxi 546300, China)
机构地区:[1]河池学院物理与机电工程学院
出 处:《计算机仿真》2019年第8期408-411,458,共5页Computer Simulation
基 金:广西教育厅科技项目:广西高校中青年教师基础能力提升项目(2018KY0495)
摘 要:研究一种有效的配送路径优化方法,能缩短配送时间,保证配送安全性和便捷性,在实际应用过程中具备一定的使用效果。针对传统的自动化物流配送路径优化选择方式存在配送时间较长,安全性较低等问题,提出一种基于图论与蚁群相融合的自动化物流配送路径优化选择方法,通过计算自动化配送的限制条件建立自动化物流配送路径优化模型;将模型中每条配送路径的初始值作为输入,对配送次数和配送点之间的距离进行计算,选择出最优路径,挥发其他路径上的信息素,增强最优路径上的信息素,多次环迭代后,输出优化选择后的配送路径。仿真结果证明,所提方法能够有效缩短配送时间,提高物流配送便捷性,保证物流配送安全性。Effective distribution path optimization can shorten the delivery time, ensure the safety and convenience of distribution. Aiming at the problems of traditional automatic logistics distribution route optimization, such as long delivery time and low security, this paper proposes an automatic logistics distribution route optimization selection method based on graph theory and ant colony, and calculates the constraints of automated distribution. Establish an automated logistics distribution route optimization model;take the initial value of each distribution path in the model as input, calculate the number of delivery times and the distance between delivery points, select the optimal path, volatilize the pheromone on other paths, enhance the pheromone on the optimal path, after multiple loop iterations, outputs the optimized distribution path. The simulation results show that the proposed method can effectively shorten the delivery time, improve the convenience of logistics and distribution, and ensure the safety of logistics distribution.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.205