基于两阶段算法的带时间窗车辆路径研究

车辆路径问题(VRP)是研究在规定区域内如何规划车辆行驶轨迹来提高运输效率的调度问题。实际生活中往往有顾客对服务时间有自己的要求,因此对于特定时间内车辆路径问题(VRPTW)的研究不但可以提高运输行业配送水平,而且可以有效提高顾客满意度及车辆利用率,实现资金合理配置。通过研究大量配送环节的VRPTW问题并结合实际配送需要,构建运输成本最小的带有惩罚函数的目标函数并设计两阶段算法,将聚类分析和改进遗传算法相结合。通过MATLAB仿真计算和对实验结果进行比较,验证所建模型及算法设计能够有效解决实际问题,降低配送成本。

Research on vehicle path with time window based on two-stage algorithm

Vehicle routing problem(VRP)is a scheduling problem that studies how to plan driving routes of vehicle in a prescribed area to improve transportation efficiency. In actual life, customers often have their own requirements of service. Hence, the research on vehicle routing problem with time window(VRPTW)can not only improve the delivery level of transportation industry, but also effectively improve the customer satisfaction degree and the utilization rate of vehicle, and realize reasonable allocation of funds. By studying VRPTW problem in a large number of distributing links and combined with actual distribution needs, an objective function is constructed with penalty function aimed at minimizing transport cost and a two-stage algorithm is designed, which combines clustering analysis and improved genetic algorithms. By MATLAB simulation calculation and comparison of experiment results, it is verified that the model and algorithm design can effectively solve practical problem and reduce distribution cost.