带货物权重的车辆路径问题及遗传算法

考虑一个分销中心、多个零售商组成的分销网络系统中具有柔性车辆能力的带货物权重的车辆路径问题.并根据车辆的满载情况采用了不同的运输策略,即单点运输和多点运输方式.在多点运输方式下,与以往诸多研究不同的是,文章建立了一种基于货物权重的VRP模型——WVRP,即在安排车辆线路时每个零售商的货物需求量也作为一个因素考虑,尽可能使车辆优先供货需求量较大的零售商.最后,针对问题的性质,开发了一种基于划分的遗传算法PB-GA对问题进行求解,并与一般遗传算法及常用的启发式算法进行了分析比较.

Vehicle routing problem with weight coefficients

A distribution network for one warehouse and multiple retailers is considered in this paper.The amount of vehicle is viewed upon as an operational variable without upper bound,which is known as flexible vehicle.According to whether the truck is full,different strategies are adopted,viz.direct shipment and peddling shipment.Using the peddling shipment strategy,a model named WVRP with weight coefficient is built.Distinguished from many other models,the demand of each retailer is also important factor to be considered when routing schedule is made.The retailers with larger demands have priority to be visited earlier.Finally,a genetic algorithm named PB-GA using a special partition method is proposed to solve this model,detailed comparison is made with usual heuristic for vehicle routing problem.