Optimization of the VRP with Single Depot Based on Vehicle Coordination Strategy
An improved vehicle coordination strategy for vehicle routing problem (VRP) based on SWEEP was proposed in order to solving single-depot VRP with stochastic demands. In this strategy, the vehicle routing that customers were not served by basic vehicle (BV) is re-optimized using SWEEP rules, then these customers are severed by SWEEP vehicle (SV) in order that the total serve time will be less and the cost is decreased. An improved genetic algorithm (GA) was designed based on the proposed vehicle coordination strategy to realize the single-depot VRP with stochastic demands. The result of a representative example and the analysis were given. The simulation results show that the proposed algorithm can not only improve the optimal solution, but also adapt for many single-depot VRP, and can solve the problem efficiently.
vehicle routing problem (VRP) vehicles coordination genetic algorithm SWEEP
Li Song Chen Ling-hui
School of Management, Hebei University Baoding, Hebei, 071002, China Hebei Software Institute Baoding, Hebei, 071000, China
国际会议
长沙
英文
2032-2035
2010-05-11（万方平台首次上网日期，不代表论文的发表时间）