随机配送时间车辆路径优化模型及求解算法

Model and Algorithm of Vehicle Routing Problem with StochasticD elivery Time

针对有时间窗约束的不确定条件下车辆路径优化问题,考虑行驶时间和服务时间的随机特征,以运输成本最小和客户满意度最大化为目标,建立随机配送时间车辆路径问题的随机机会约束规划模型,求解时由于标准遗传算法易早熟,对遗传操作进行了改进。最后使用算例进行对比,验证了模型和算法的可行性及有效性。

Aiming at Vehicle Routing Problem(VRP)with time window under the conditons of uncertainty,considering the stochastic characteristics of travel time and service time,minimize the transport costs and maximize the customer satisfaction as the goal,a model of Vehicle Routing Problem with stochastic delivery time was formulated.Because of the disadvantage that falling easily into local optimal point in standard genetic algorithm,the genetic operation was improved.Finally,a numerical example is used to verify the feasibility and effectiveness of the model and algorithm.