根据城市物流中的物资开闭混合式两级配送情形,构建开闭混合式两级车辆路径问题的数学模型.远程中心仓库的物资必须先配送至外围的中转站,再转运至最终需求点,第1级车辆在完成配送任务后无需返回中心仓库,或者必须啄路返回.通过一种改进的变邻域搜索算法求解该NP难问题.扩展算例的实验结果表明该改进算法可获得求解质量与时间的平衡,性能优于改进的Memetic算法.
An open-closed mixed two-echelon vehicle routing problem (OCM-2EVRP) mathematical model is con- structed based on the close-open mixed two-echelon distribution of fl'cight in city logistics. In OCM-2EVRP, freight from a remote depot is compulsorily delivered through peripheral intermediate depots to the final cus- tomers in the city. Vehicles of the first ecbehm do not need to return to the depot after finishing their distribu- tion, or they should make the same trips in the reverse order. This NP-hard problem is solved by an improved variable neighborhood search algorithm. Results of computational experiments on several extended benchmark instances show that the improved algorithm can obtain a balance between solution quality and time and outper- forms an improved Memetic algorithm.