毕业设计（论文）多车辆物流配送智能算法研究.docVIP

摘 要 物流配送中的车辆路径问题最早由Dantzig和Ramser在1959年提出，在当今市场经济竞争愈发激烈的环境下，企业单一考虑压缩商品成本已经无法显著提高企业的经济效益，降低商品配送成本已经成为相关企业考虑的首要因素。车辆路径问题任是创新与改进搜索算法领域的热点模型。 本文从控制企业物流配送成本、提高物流配送效率的角度出发，综合考虑客户需求的随机性以及配送车辆的装载容量等约束条件，分别建立了限制车辆返回配送中心次数以及不限返回次数的随机需求单车辆物流配送模型，给出了车辆行驶路程长度的期望公式。然后在解决TSP问题的遗传算法基础上，以路径长度的数学期望最小化为目标，设计了针对SVRP问题的遗传算法，寻找出最优的配送次序。最后通过仿真实例验证算法的可行性与效率，并分析了遗传算子中变异概率对算法效果的影响。 关键词：车辆路径问题；随机需求；优化模型；遗传算法 Abstract The problem of vehicle routing in logistics distribution was first proposed by Dantzig and Ramser in 1959. In todays increasingly competitive market economy, it is not possible for enterprises to consider the cost of compressed goods significantly to improve the economic efficiency of enterprises and reduce the cost of commodity distribution. Related business to consider the primary factor. The vehicle path problem is a hot model in the field of innovation and improved search algorithms. Based on the reduction of the cost of logistics and distribution of enterprises and the improvement of logistics and distribution efficiency, this paper establishes the stochastic demand for limiting the number of vehicles returning to the distribution center and the number of non-return times, taking into account the randomness of customer demand and the loading capacity of distribution vehicles Single vehicle logistics distribution model, gives the vehicle travel distance length of the expected formula. Then, based on the genetic algorithm to solve the TSP problem, the genetic algorithm for SVRP problem is designed to minimize the mathematical expectation of path length, and the optimal distribution order is found. Finally, the feasibility and efficiency of the algorithm are verified by simulation examples, and the influence of the parameters of the operator on the convergence of the algorithm is analyzed. Key words: Vehicle routing problem; Stochastic demand; Optimization model; Genetic algorithm 目录 I Abstract II 目录 1 1.1 课题研究目的与意义 1 1.2 国内外研究现状 2 1.2.1 随机车辆路径问题 2 1.2.2 遗传算法 3 第二章 不做预防性返回的