基于改进遗传算法的物流配送路径优化研究物流工程专业论文.docxVIP

山东科技大学硕士学位论文摘要 山东科技大学硕士学位论文 摘要 摘 要 随着经济社会的飞速发展，物流活动的地位越来越突出，作为物流活动主要环节最 优的行车线路，使运输工具有序的访问客户，在满足客户的需求量和发货量、的物流配 送调度问题也越来越成为学者研究的重点。车辆路径优化问题是物流配送中的一个重要 方面。车辆路径问题一般是指对一系列需要服务的客户，调用运输工具，安排车辆载重 限制、行驶时间限制等约束的条件下，力争实现车辆行驶里程最短、运输总费用最低等 目标。车辆路径问题是一种典型的 NP 难题，传统方法很难求得最优解，本文运用了启 发式算法来求解车辆路径优化问题。 论文详细分析了带时间窗的车辆路径问题的特点，界定了基本条件，建立了带时间 窗约束的车辆路径问题的数学模型；然后，对遗传算法及小生境技术进行了分析研究， 并把小生境技术引入遗传算法，构建了小生境遗传算法；接着基于带时间窗约束的车辆 路径优化问题的实例，对遗传算法和小生境遗传算法进行了设计和仿真研究，计算得到 了所给问题的最优解，同时也表明了改进的遗传算法比单纯遗传算法具有更好的优越性， 是求解车辆路径规划问题的一个有效方法；论文最后，将交通量作为约束条件加入到车 辆路径问题的模型中，构建出了更符合实际的模型，并进行求解，得出了更符合实际的 结果。 关键词：车辆路径问题，时间窗，遗传算法，小生境技术，交通量 Abstract With the rapid development of economy and society, the prominence of logist ics activities is increasing. As the ma in part of the logist ics activities, logist ics and distribution scheduling problem has increasingly become a research focus for scholars. Vehicle routing problem is an important aspect of Logist ics and Distribution. Vehicle routing problem genera lly refers that under a series of clients in need of service and some of vehicles, the quest ion is to get the best vehicle travel routes which meet the objective of shortest milea ge or the lowest total cost of transportation and so on, also some constraints of customer dema nd and shipments, vehicle load restrict ions, travel time constraints and others are must be satisfied. Vehicle routing problem is a typica l NP problem under which the optima l solution is hardly got by the traditiona l met hods, so in this paper, a heurist ic algor ithm is used to solve the VRP. The paper analyze s the character ist ics of the VRPTW in detail, confirms the basic conditions, and const itutes the model of the VRPTW. Then the paper researches the GA and the niche technology, and brings the niche technology into the GA and constructs the NGA. The GA and NGA are designed for computing an example of the VRPTW, and so the optima l solution is got, at the same time the results indicate the NGA is better than the GA a